Method for puncturing low density parity check code
AssigneeSamsung Electronics Co., Ltd.
InventorsEoi-Young Choi, Seung-Bum Suh
Life of this patent
Estimating the term…
Abstract
A method is provided for puncturing a low density parity check (LDPC) code decoded by a parity check matrix that is expressed by a factor graph including a check node and a bit node, being connected to each other at an edge, and includes a parity part having a dual diagonal matrix with a single 3-weight column and the remaining columns being 2-weight columns. The method includes generating a puncturing pattern such that bits of the LDPC code are punctured in an order of a bit mapped to a column with a higher weight from among the columns constituting the parity part; and puncturing the LDPC code according to the generated puncturing pattern.
Claims10
A method for puncturing, by a transmitter, a low density parity check (LDPC) code by using a parity check matrix that is expressed by a factor graph including check nodes and bit nodes, being connected to each other at an edge, wherein the parity check matrix includes a parity part having a dual diagonal matrix with a single 3-weight column and the remaining columns being 2-weight columns in a mobile communication system, the method comprising:
- generating, by the transmitter, a puncturing pattern such that bits nodes of the LDPC code are punctured in order including a bit node mapped to the column with the highest weight among the columns constituting the parity part;
- and
- puncturing, by the transmitter, the bit nodes of the LDPC code according to the generated puncturing pattern.
A method for puncturing, by a transmitter, a low density parity check (LDPC) code by using a parity check matrix that is expressed by a factor graph including check nodes and bit nodes being connected to each other at an edge, wherein the parity check matrix includes a parity pan having a dual diagonal matrix with a single 3-weight column and 2-weight columns, in a mobile communication system, the method comprising:
- puncturing, by the transmitter, a bit node of the LDPC code, being mapped to a column with the highest weight among the columns constituting the parity part;
- after puncturing, by the transmitter, the bit node mapped to the column with the highest weight, determining at least one bit node that is recovered in the next iterative decoding process, using the factor graph;
- and
- puncturing, by the transmitter, the LDPC code in order of a bit node with the highest priority among the determined recoverable bit nodes.
Dependencies are inferred from the claim text.