Rate matching methods for ldpc codes
AssigneeTelefonaktiebolaget LM Ericsson (publ)
InventorsMattias ANDERSSON, Yufei BLANKENSHIP, Sara SANDBERG
Life of this patent
Estimating the term…
Abstract
A method of producing a set of coded bits from a set of information bits for transmission between a first node and a second node in a wireless communications system, the method comprises generating a codeword vector by encoding the set of information bits with a low-density parity-check code, wherein the codeword vector is composed of systematic bits and parity bits. The method comprises performing circular buffer-based rate matching on the generated codeword vector to produce the coded bits for transmission, wherein the circular buffer-based rate matching comprises puncturing a first plurality of systematic bits.
Claims18
A method of producing a set of coded bits from a set of information bits for transmission between a wireless device and a network node in a wireless communications system, the method comprising:
- attaching dummy bits to the set of information bits to make an information vector comprising the set of information bits, and
- encoding the information vector with a quasi-cyclic low-density parity-check code (QC-LDPC) that is specified through a parity check matrix to generate a codeword vector comprising the information bits, wherein the QC-LDPC code is designed with the knowledge that a portion of information bits will be punctured from the codeword vector, and
- puncturing the portion of the information bits from the codeword vector before writing the punctured codeword vector into a circular buffer, where the amount of bits in the punctured portion is twice a lifting factor of the parity check matrix and wherein columns in the parity check matrix that are mapped to the punctured information bits have a higher column weight than columns in the parity check matrix that are mapped to non-punctured bits;
- and
- performing circular buffer-based rate matching on the punctured codeword vector to produce the coded bits for transmission, wherein the circular buffer-based rate matching comprises removing the attached dummy bits.
A wireless device for producing a set of coded bits from a set of information bits for transmission to a network node in a wireless communications system, the wireless device comprising:
- processing circuitry, the processing circuitry configured to:
- attach dummy bits to the set of information bits to make an information vector comprising the set of information bits, and
- encode the information vector with a quasi-cyclic low-density parity-check code (QC-LDPC) that is specified through a parity check matrix to generate a codeword vector comprising the information bits, wherein the QC-LDPC code is designed with the knowledge that a portion of information bits will be punctured from the codeword vector, and
- puncture the portion of the information bits from the codeword vector before writing the punctured codeword vector into a circular buffer, where the amount of bits in the punctured portion is twice a lifting factor of the parity check matrix and wherein columns in the parity check matrix that are mapped to the punctured information bits have a higher column weight than columns in the parity check matrix that are mapped to non-punctured bits;
- and
- perform circular buffer-based rate matching on the punctured codeword vector to produce the coded bits for transmission, wherein the circular buffer-based rate matching comprises removing the attached dummy bits.
A network node for producing a set of coded bits from a set of information bits for transmission to a wireless device in a wireless communications system, the network node comprising:
- processing circuitry, the processing circuitry configured to:
- attach dummy bits to the set of information bits to make an information vector comprising the set of information bits, and
- encode the information vector with a quasi-cyclic low-density parity-check code (QC-LDPC) that is specified through a parity check matrix to generate a codeword vector comprising the information bits, wherein the QC-LDPC code is designed with the knowledge that a portion of information bits will be punctured from the codeword vector, and
- puncture the portion of the information bits from the codeword vector before writing the punctured codeword vector into a circular buffer, where the amount of bits in the punctured portion is twice a lifting factor of the parity check matrix and wherein columns in the parity check matrix that are mapped to the punctured information bits have a higher column weight than columns in the parity check matrix that are mapped to non-punctured bits;
- and
- perform circular buffer-based rate matching on the punctured codeword to produce the coded bits for transmission, wherein the circular buffer-based rate matching comprises removing the attached dummy bits.
Dependencies are inferred from the claim text.