System and method for structured LDPC code family with fixed code length and no puncturing
First Claim
Patent Images
1. For use in a wireless communication network, a method for constructing a low density parity check (LDPC) family of codes, the method comprising:
- constructing a mother code having a highest code rate in the LDPC family of codes, wherein the mother code is constructed by;
selecting m number of rows and n number of columns;
setting maximum column weights and row weights;
designing a protograph matrix based on the set column weights and row weights and selected m and n;
selecting circulant blocks based on the protograph matrix; and
deriving a second code from the mother code by splitting each row of the mother code into two or more split rows and merging certain values from two or more split rows to form at least one row in the second code using splitting and merging rules that introduce no smaller cycles than those in the mother code.
1 Assignment
0 Petitions
Accused Products
Abstract
A family of low density parity check (LDPC) codes is generated based on a mother code having a highest code rate. The low density parity check (LDPC) codes include a codeword size of at least 1344. The LDPC codes also include a plurality of parity bits in a lower triangular form. The mother code is constructed by: selecting m number of rows and n number of columns; setting maximum column weights and row weights; designing a protograph matrix based on the set column weights and row weights and selected m and n; and selecting circulant blocks based on the protograph matrix.
36 Citations
21 Claims
-
1. For use in a wireless communication network, a method for constructing a low density parity check (LDPC) family of codes, the method comprising:
constructing a mother code having a highest code rate in the LDPC family of codes, wherein the mother code is constructed by; selecting m number of rows and n number of columns; setting maximum column weights and row weights; designing a protograph matrix based on the set column weights and row weights and selected m and n; selecting circulant blocks based on the protograph matrix; and deriving a second code from the mother code by splitting each row of the mother code into two or more split rows and merging certain values from two or more split rows to form at least one row in the second code using splitting and merging rules that introduce no smaller cycles than those in the mother code. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
9. For use in a wireless communications network, a low density parity check (LDPC) code implemented in a non-transitory, computer-readable medium, the LDPC code comprising:
-
a codeword size of at least 1344; a plurality of information bits; and a plurality of parity bits, wherein the plurality of parity bits comprises a lower triangular form, and wherein the LDPC code is based on a mother code, wherein the mother code is constructed by; selecting m number of rows and n number of columns; setting maximum column weights and row weights; designing a protograph matrix based on the set column weights and row weights and selected m and n; selecting circulant blocks based on the protograph matrix; and deriving a second code from the mother code by splitting each row of the mother code into two or more split rows and merging certain values from two or more split rows to form at least one row in the second code using splitting and merging rules that introduce no smaller cycles than those in the mother code. - View Dependent Claims (10, 11, 12, 13, 14, 15)
-
-
16. For use in a wireless communications network, a method for performing error correction comprising using a low density parity check (LDPC) code from a LDPC family of codes in a non-transitory, computer-readable medium, the LDPC code comprising:
-
a codeword size of at least 1344; a plurality of information bits; and a plurality of parity bits, wherein the plurality of parity bits comprises a lower triangular form, and wherein the LDPC code is based on a mother code, wherein the mother code is constructed by; selecting m number of rows and n number of columns; setting maximum column weights and row weights; designing a protograph matrix based on the set column weights and row weights and selected m and n; selecting circulant blocks based on the protograph matrix; and deriving a second code from the mother code by splitting each row of the mother code into two or more split rows and merging certain values from two or more split rows to form at least one row in the second code using splitting and merging rules that introduce no smaller cycles than those in the mother code. - View Dependent Claims (17, 18, 19, 20, 21)
-
Specification