A low density parity check (LDPC) encoder, an LDPC decoder, and an LDPC encoding method are disclosed. The LDPC encoder includes first memory, second memory, and a processor. The first memory stores an LDPC codeword having a length of 16200 and a code rate of 2/15. The second memory is initialized to 0. The processor generates the LDPC codeword corresponding to information bits by performing accumulation with respect to the second memory using a sequence corresponding to a parity check matrix (PCM).

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.

A low density parity check (LDPC) encoder, an LDPC decoder, and an LDPC encoding method are disclosed. The LDPC encoder includes first memory, second memory, and a processor. The first memory stores an LDPC codeword having a length of 16200 and a code rate of 3/15. The second memory is initialized to 0. The processor generates the LDPC codeword corresponding to information bits by performing accumulation with respect to the second memory using a sequence corresponding to a parity check matrix (PCM).

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 5/16, 6/16, 7/16, or 8/16. The check matrix includes a matrix A with M1 rows and K columns, where M1 represents a predetermined value, and K=N×r 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 N-K-M1 columns that is a zero matrix, a matrix C with N-K-M1 rows and K+M1 columns, and a matrix D with N-K-M1 rows and N-K-M1 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.

A base matrix is applied to an LDPC coder. The base matrix includes multiple parts, each including multiple of rows and columns, and containing integers, each representative of an identity matrix cyclically shifted in accordance with the integer or representative of an all-zero matrix. At least two of the multiple parts are configured such that their respective column-wise combinations of rows represents a same starting vector, cyclically shifted or interleaved, with zero or more but not all integers not indicative of the all-zero matrix of the same vector substituted by integers indicative of the all-zero matrix. The at least two of the multiple parts are not identical. The applied base matrix is used for one of encoding data using the LDPC coder or decoding data using the LDPC coder.

A transmission method includes performing LDPC coding on a basis of a parity check matrix of an LDPC code having a code length N of 69120 bits and a coding rate r of 3/16, and performing group-wise interleaving in which the LDPC code is interleaved in units of bit groups of 360 bits. The transmission method further includes mapping the LDPC code to one of 16 signal points of uniform constellation (UC) in 16QAM on a 4-bit basis. In the group wise interleaving, an (i+1)th bit group from a head of the LDPC code is set as a bit group i, and a sequence of bit groups 0 to 191 of the 69120-bit LDPC code is interleaved into a sequence of bit groups.

According to some embodiments, a method for use in a wireless transmitter of a wireless communication network comprises encoding information bits using a purity check matrix (PCM) and transmitting the encoded information bits to a wireless receiver. The parity check matrix (PCM) is optimized according to two or more approximate cycle extrinsic message degree (ACE) constraints. In some embodiments, a first portion of the PCM is optimized according to a first ACE constraint and a second portion of the PCM is optimized according to a second ACE constraint.

A data storage system performs operations including receiving a data write command specifying data to be written; selecting an irregular LDPC encoding scheme of a plurality of available irregular LDPC encoding schemes available to the encoder in accordance with (i) a working mode of the data storage system, (ii) device-specific criteria and/or (iii) a data type of the specified data; and encoding the specified data to be written using the selected irregular LDPC encoding scheme.

A polarization stream architecture is described. A transmitter may implement a reverse polarization stream to shape a first source signal in a first signal space to a first target signal in a second signal space. The reverse polarization stream is implemented as a cascade of reverse polarization steps. Each reverse polarization step includes a shuffle function, a split function, a scaling function and an offset function. Machine-learning techniques may be used to implement the scaling function and the offset function. A receiver may implement a polarization stream to recover the source signal.

A successive cancellation list-based decoder and a decoding method thereof are provided. In the method, an error check is performed on a set of data bits. A data unit includes the set of the data bits and at least one first check bit. Part of the set of data bits are considered as at least one second check bit. At each of the second check bits, its previous error-check result are verified, where the verified result is related to a comparison between each of the previous first check bits and a value obtained through a function calculation on corresponding data bits. The verified result at each of the second check bits determines whether to continue decoding of the set of data bits or to early terminate the decoding process. The method is able to increase the probability for early termination of the decoding process and to improve the decoding efficiency.