LDPC Check Matrix Layout for Reliable Long-Code Transmission
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In data transmission using LDPC codes, ensuring favorable communication quality is a challenge, particularly in maintaining error correction capabilities and avoiding error floors in decoding processes.
Innovation Solution
The implementation of an LDPC coding method with a specific check matrix of 69120 bits and a code rate of 11/16, where the check matrix includes an information matrix section represented by an initial value table indicating positions of elements, ensuring effective encoding and decoding of LDPC codes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If LDPC coding is performed with increased code length to approach Shannon limit, then error correction capability is improved, but device complexity and processing difficulty increase
Solution Approach 1:
The check matrix is divided into an information matrix section and a parity matrix section, with the information matrix further represented by an initial value table. This segmentation allows the large 69120-bit code to be processed in manageable blocks, reducing processing complexity while maintaining the long code length needed for error correction performance接近 Shannon limit
Solution Approach 2:
The patent specifies precise parameters including code length N=69120 bits, code rate r=11/16, and a specific initial value table with 360 columns. These parameter changes optimize the balance between error correction capability and processing complexity by selecting a code length that achieves near-Shannon-limit performance while using a structured initial value table to simplify the information matrix representation
2Manufacturing precision
If specific check matrix structure with initial value table is used, then manufacturing precision of encoding process is improved, but ease of operation decreases
Solution Approach 1:
The initial value table is prepared in advance, containing pre-calculated positions of elements with value 1 in the information matrix section. This preliminary action allows the encoding process to proceed with high precision by simply referencing the pre-defined table, while the receiver can use the same table to efficiently reconstruct the check matrix structure for decoding without dealing with the full complexity of the original matrix generation
Data Source
AI summary
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 11/16 or 12/16. The LDPC code includes information bits and parity bits, and the check matrix includes an information matrix corresponding to the information bits and a parity matrix corresponding to the parity bits. The information matrix is 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 information matrix on the basis of 360 columns and is a predetermined table. The present technique can be applied to, for example, data transmission using the LDPC code.