H03M13/036

Method, system, device and storage medium for constructing base matrix of PBRL LDPC code
11848684 · 2023-12-19 · ·

The present disclosure relates to a method, system, and non-transitory computer-readable storage medium for constructing a base matrix of a PBRL LDPC code, comprising: determining at least one candidate sub-matrix of a PBRL LDPC code based on a base matrix of a QR-QC-LDPC code; obtaining at least one count of cycles with at least one preset length for each of the at least one candidate sub-matrix; and determining a first sub-matrix of the base matrix of the PBRL LDPC code based on the at least one count of cycles.

Bit interleaver for low-density parity check codeword having length of 64800 and code rate of 3/15 and 16-symbol mapping, and bit interleaving method using same

A bit interleaver, a bit-interleaved coded modulation (BICM) device and a bit interleaving method are disclosed herein. The bit interleaver includes a first memory, a processor, and a second memory. The first memory stores a low-density parity check (LDPC) codeword having a length of 64800 and a code rate of 3/15. The processor generates an interleaved codeword by interleaving the LDPC codeword on a bit group basis. The size of the bit group corresponds to a parallel factor of the LDPC codeword. The second memory provides the interleaved codeword to a modulator for 16-symbol mapping.

HIGH PERFORMANCE, FLEXIBLE, AND COMPACT LOW-DENSITY PARITY-CHECK (LDPC) CODE
20210058192 · 2021-02-25 ·

Certain aspects of the present disclosure generally relate to techniques for puncturing of structured low-density parity-check (LDPC) codes. Certain aspects of the present disclosure generally relate to methods and apparatus for a high-performance, flexible, and compact LDPC code. Certain aspects can enable LDPC code designs to support large ranges of rates, blocklengths, and granularity, while being capable of fine incremental redundancy hybrid automatic repeat request (IR-HARQ) extension while maintaining good floor performance, a high-level of parallelism to deliver high throughout performance, and a low description complexity.

Data processing device and data processing method for improving data transmission quality using a low density parity check code

The present technology relates to a data processing device and a data processing method, which are capable of securing excellent communication quality in data transmission using an LDPC code. In group-wise interleave, an LDPC code in which a code length N is 16200 bits and an encoding rate r is 10/15 or 12/15 is interleaved in units of bit groups of 360 bits. In group-wise deinterleave, a sequence of the LDPC code that has undergone the group-wise interleave is restored to an original sequence. For example, the present technology can be applied to a technique of performing data transmission using an LDPC code.

Data processing device and data processing method
10951241 · 2021-03-16 · ·

A transmitting device for generating a digital television broadcast signal incudes circuitry configured to receive data to be transmitted in a digital television broadcast signal and perform LDPC (low density parity check) encoding on input bits of the received data according to a parity check matrix initial value table of an LDPC code having a code length of 16200 bits and a code rate of 10/15 to generate an LDPC code word. The LDPC code enables error correction processing to correct errors generated in a transmission path of the digital television broadcast signal. The LDPC code word includes information bits and parity bits, the parity bits being processed by the receiving device to recover information bits corrupted by transmission path errors.

ENCODING METHOD AND DEVICE AND DECODING METHOD AND DEVICE FOR STRUCTURED LDPC
20210091790 · 2021-03-25 · ·

Provided is an encoding method and device and a decoding method and device for structured LDPC. The encoding method includes: determining a base matrix used for encoding and performing an LDPC encoding operation on a source information bit sequence according to the base matrix and an expansion factor Z corresponding to the base matrix to obtain a codeword sequence, where Z is a positive integer. The base matrix includes multiple submatrices and the submatrices include an upper-left submatrix Hb1 and an upper-left submatrix Hb2, and the upper-left submatrix Hb1 is an upper-left submatrix of the upper-left submatrix Hb2.

Devices and methods for generating a low density parity check code for a incremental redundancy HARQ communication apparatus

Devices and methods are disclosed for generating on the basis of a first protograph matrix P.sub.1 of size mn, wherein the first protograph matrix P.sub.1 defines a first code H.sub.1, a second protograph matrix P.sub.2 of size (m+d)(n+d), wherein the second protograph matrix P.sub.2 defines a second code H.sub.2. The device comprises a processor configured to: generate an auxiliary protograph matrix P of size (m+d.sub.1)(n+d.sub.1) on the basis of the first protograph matrix P.sub.1 using row splitting; generate d.sub.2 random integer numbers, wherein d.sub.2=dd.sub.1; generate a binary matrix M of size d.sub.2(nm), wherein rows of the binary matrix M are generated on the basis of the d.sub.2 random integer numbers; generate a matrix M by lifting the binary matrix M; Other operation steps are also included.

Method and apparatus for encoding and decoding of variable length quasi-cyclic low-density parity-check, QC-LDPC, codes

A method for quasi-cyclic low-density parity-check (QC-LDPC) encoding and decoding of a data packet by a lifted matrix is provided, the method comprising: lifting the QC-LDPC code for maximal code length N.sub.max and maximal circulant size Z.sub.upper of the base matrix; generating a plurality of optimal values r.sub.i for a plurality of circulants Z.sub.1, Z.sub.2, . . . , Z.sub.upper based on the QC-LDPC code lifted for maximal length N.sub.max, 0r.sub.iZ.sub.upper1; saving the generated plurality of optimal values r.sub.i corresponding to the plurality of circulants Z.sub.1, Z.sub.2, . . . , Z.sub.upper and a matrix for the QC-LDPC code lifted for maximal length N.sub.max in the memory; receiving a current circulant Z.sub.current from the plurality of circulants Z.sub.1, Z.sub.2, . . . , Z.sub.upper; selecting a current optimal value r.sub.current from the plurality of optimal values r.sub.i stored in the memory corresponding to the current circulant Z.sub.current; and lifting the base matrix based on the current optimal value r.sub.current.

TRANSMISSION METHOD AND RECEPTION DEVICE
20210075445 · 2021-03-11 · ·

The present technology relates to a transmission method and a reception device for securing favorable communication quality in data transmission using an LDPC code.

In group-wise interleaving, the LDPC code with a code length N of 69120 bits is interleaved in units of 360-bit bit groups 0 to 191. In group-wise deinterleaving, a sequence of the LDPC code after group-wise interleaving is returned to an original sequence. The present technology can be applied, for example, in a case of performing data transmission using an LDPC code, and the like.

Transmission apparatus, transmission method, reception apparatus, and reception method
10965320 · 2021-03-30 · ·

The present technique relates to a transmission apparatus, a transmission method, a reception apparatus, and a reception method that can ensure favorable communication quality in data transmission using an LDPC code. LDPC coding is performed based on a check matrix of an LDPC code with a code length N of 69120 bits and a code rate r of 2/16, 3/16, or 4/16. The check matrix includes a matrix A with M1 rows and K columns, where M1 represents a predetermined value, and K=Nr represents an information length of the LDPC code, a matrix B with M1 rows and M1 columns in a dual diagonal structure, a matrix Z with M1 rows and NKM1 columns that is a zero matrix, a matrix C with NKM1 rows and K+M1 columns, and a matrix D with NKM1 rows and NKM1 columns that is an identity matrix. The matrix A and the matrix C are represented by a check matrix initial value table. The check matrix initial value table is a table indicating positions of elements of 1 in the matrix A and the matrix C on a basis of 360 columns and is a predetermined table. The present technique can be applied to, for example, data transmission using the LDPC code.