Parallel ldpc decoder
US-2020252080-A1 · Aug 6, 2020 · US
US12021625B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12021625-B2 |
| Application number | US-202318156247-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jan 18, 2023 |
| Priority date | Dec 13, 2019 |
| Publication date | Jun 25, 2024 |
| Grant date | Jun 25, 2024 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method for encoding or transmitting. In some embodiments, the method includes forming a set of one or more unpunctured codewords by coding a plurality of payload bits at a mother code rate, removing a plurality of punctured bits from the set of one or more unpunctured codewords to form a set of one or more punctured codewords, and transmitting the set of one or more punctured codewords. In some embodiments, the number of punctured bits exceeds a first threshold, or the number of punctured bits exceeds a second threshold.
Opening claim text (preview).
What is claimed is: 1. A method, comprising: forming a set of one or more unpunctured codewords by coding a plurality of payload bits at a mother code rate; determining a number of bits to remove, such that the number of bits is greater than a first threshold and a ratio of a number of shortening bits to the number of bits to remove is less than the mother code rate; puncturing the set of one or more unpunctured codewords to remove a number of bits to form a set of one or more punctured codewords; and transmitting the set of one or more punctured codewords. 2. The method of claim 1 , wherein the number of bits exceeds the first threshold and the number of bits exceeds a second threshold. 3. The method of claim 1 , further comprising calculating a number of available bits based on a number of data bits per symbol. 4. The method of claim 3 , further comprising selecting the number of unpunctured codewords in the set of unpunctured codewords based on the number of available bits. 5. The method of claim 4 , wherein the number of available bits is less than or equal to a third threshold and the number of unpunctured codewords is one. 6. The method of claim 5 , wherein the third threshold is 1944. 7. The method of claim 6 , wherein: the number of available bits is greater than the third threshold and less than or equal to a fourth threshold; and the number of unpunctured codewords is two. 8. The method of claim 4 , further comprising selecting a length of the unpunctured codeword based on the number of available bits. 9. The method of claim 8 , further comprising calculating the number of shortening bits, based on the number of unpunctured codewords and based on the length of an unpunctured codeword. 10. The method of claim 9 , wherein the first threshold is greater than a larger of: 0.01× N CW ×L LDPC ×(1− R m ) and 0.1 N shrt / ( 1.2 × R m 1 - R m ) , wherein: N CW is the number of unpunctured codewords, L LDPC is the length of an unpunctured codeword, N shrt is the number of shortening bits, and R m is the mother code rate. 11. The method of claim 2 , wherein the second threshold is greater than 0.03×N CW ×L LDPC ×(1−R m ). 12. The method of claim 1 , wherein the coding of the plurality of payload bits comprises coding the plurality of payload bits using a low-density parity-check (LDPC) code. 13. The method of claim 1 , further comprising selecting a punctured code rate, based on a ratio of acknowledgements to negative acknowledgments, wherein the removing of the number of bits comprises removing the number of bits to effect the punctured code rate. 14. The method of claim 1 , comprising not adding a fraction of a symbol to the punctured codewords, and not adding a symbol to the punctured codewords. 15. A system, comprising: a wireless station, comprising a processing circuit, the processing circuit being configured to: form a set of one or more unpunctured codewords by coding a plurality of payload bits at a mother code rate; determine a number of bits to remove, such that the number of bits is greater than a first threshold and a ratio of a number of shortening bits to the number of bits to remove is less than a the mother code rate puncture the set of one or more unpunctured codewords to remove a number of bits to form a set of one or more punctured codewords; and transmit the set of one or more punctured codewords. 16. The system of claim 15 , wherein the number of bits exceeds the first threshold and the number of bits exceeds a second threshold. 17. The system of claim 15 , wherein the processing circuit is further configured to calculate a number of available bits based on a number of data bits per symbol. 18. The system of claim 17 , wherein the processing circuit is further configured to select the number of unpunctured codewords in the set of unpunctured codewords based on the number of available bits. 19. The system of claim 18 , wherein the processing circuit is further configured to select a length of the unpunctured codeword based on the number of available bits. 20. The system of claim 19 , wherein the processing circuit is further configured to calculate the number of shortening bits, based on the number of unpunctured codewords and based on the length of an unpunctured codeword.
Formatting · CPC title
IEEE 802.11 [WLAN] · CPC title
Rate compatible low-density parity check [LDPC] codes · CPC title
by puncturing · CPC title
by adapting the channel coding (H04L1/1812 takes precedence) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.