Primary LDPC Matrix Layout for Shorter Codeword Encoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Longer codeword lengths in low-density parity-check (LDPC) codes result in higher computation costs and limitations in block size for data transmission, particularly in mobile wireless communication, where different code rates restrict selectable codeword lengths.
Innovation Solution
The method generates encoded data using a primary LDPC matrix composed of a first primary matrix part related to multiple local LDPC matrices and a second primary matrix part related to a global LDPC matrix, allowing for shorter codeword lengths while maintaining error correction ability by selectively arranging and combining these matrices for encoding and decoding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If longer codeword lengths are used in LDPC codes, then error correction ability is improved, but computation cost and hardware/software resources increase
Solution Approach 1:
The patent divides the LDPC code structure into multiple code blocks, where each block can be independently encoded and decoded using shorter codeword lengths. This segmentation allows the system to maintain error correction capability through multiple blocks while avoiding the high computation cost associated with a single long codeword.
Solution Approach 2:
The patent introduces a new dimension to the code structure by organizing code blocks in a two-dimensional arrangement with row and column dimensions. This dimensional change enables the system to achieve the error correction performance of long codes through the combined effect of multiple short codes arranged in a structured pattern, thereby reducing computational complexity.
2Reliability
If longer codeword lengths are used, then error correction ability is improved, but block size limitations are imposed by code rates
Solution Approach 1:
The patent implements dynamic block size adjustment by allowing the number and arrangement of code blocks to be flexibly configured according to different code rates and transmission requirements. This dynamic structure enables the system to adapt block sizes to various channel conditions while maintaining error correction performance, overcoming the rigidity imposed by fixed code rate limitations.
Solution Approach 2:
The patent creates a universal code structure that can function with multiple code rates and block sizes through the modular code block arrangement. The same basic structure can be scaled and configured to meet different transmission requirements, making the system versatile across various application scenarios without being constrained by specific code rate limitations.
3Device complexity
If shorter codeword lengths are used, then computation cost is reduced, but error correction ability deteriorates
Solution Approach 1:
The patent merges multiple short code blocks into a unified code structure that collectively provides error correction capability comparable to long codes. By combining the error correction contributions of multiple short codes through their structured arrangement, the system achieves the reliability of long codes while maintaining the computational advantages of short codes.
Solution Approach 2:
The patent creates a composite code structure by combining multiple short code blocks with different properties (different code rates, different block sizes) into a unified encoding scheme. This composite structure leverages the strengths of individual short codes while achieving the overall error correction performance previously only attainable with long codes, effectively creating a 'material' with superior properties to its components.
Data Source
AI summary
A method for generating encoded data includes: generating at least one local LDPC matrix and a global LDPC matrix, the global LDPC matrix relating to each of the at least one local LDPC matrix; repeatedly selecting one of the at least one local LDPC matrix as a target local LDPC matrix until a number t of the target local LDPC matrices are selected, where t is a user-defined number that is greater than one; generating a block matrix that includes the target local LDPC matrices; generating a primary LDPC matrix that includes a first primary matrix part relating to the block matrix, and a second primary matrix part relating to the global LDPC matrix; and encoding data based on the primary LDPC matrix.


