Back to results
US 8,276,050 B2Granted
Method and apparatus of encoding and decoding data using low density parity check code in a wireless communication system
AssigneeLG Electronics Inc.
InventorsMin Seok Oh, Ki Hyoung Cho, Kyu Hyuk Chung
Life of this patent
Estimating the term…
Abstract
A method of encoding data using low density parity check (LDPC) code defined by a m×n parity check matrix is disclosed. More specifically, the method includes encoding input source data using the parity check matrix, wherein the parity check matrix comprises a plurality of z×z sub-matrices of which row weights and column weights are ‘0’ or ‘1’.
Claims15
An apparatus for encoding data using low density parity check (LDPC) code, the apparatus comprising:
- a base matrix generation module to generate a second base matrix by replacing each first value corresponding to each element of a first base matrix with a second value corresponding to each element of the second base matrix, wherein each first value of the first base matrix is an integer that indicates either a zero matrix or a first permutation matrix having a zmax×zmax size and each second value of the second base matrix is an integer that indicates either a zero matrix or a second permutation matrix having a z×z size;
- a parity check matrix generation module to generate a parity check matrix by replacing each second value of the second base matrix with a corresponding second permutation matrix or the zero matrix having the z×z size;
- and
- an encoding module to encode data using the parity check matrix,
- wherein zmax is greater than z and each second value is determined based on the equation shift(z)=floor (shift (zmax)z/zmax), and
- wherein “shift (zmax)” is the first value, “shift(z)” is the second value, and “floor (x)” denotes a nearest integer from x toward negative infinity.
3 more elements
A method of generating a base matrix used for encoding or decoding data in a mobile communication system, the method comprising:
- providing a plurality of first base matrixes for a plurality of code rates, each of the first base matrixes including a first value as an element, the first value an integer that indicates either a zero matrix or a first permutation matrix having a zmax×zmax size;
- selecting one of the plurality of first base matrixes, the selected one of the plurality of first base matrixes corresponding to a first code rate among the plurality of code rates;
- and
- generating a second base matrix by replacing each first value corresponding to each element of the selected one of the plurality of first base matrixes with a second value corresponding to each element of the second base matrix, the second value an integer that indicates either a zero matrix or a second permutation matrix having a z×z size, wherein z is smaller than zmax and each second value is determined based on the equation shift(z)=floor (shift (zmax)” is the first value, “shift(z)” is the second value, and “floor (x)” denotes a nearest integer from x toward negative infinity.
1 more element
Dependencies are inferred from the claim text.