LDPC Parity-Check Matrix Layout for Flexible Code Length
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional methods for generating low-density parity-check codes are limited by algebraic characteristics, restricting code length and circulant permutation matrix size, and involve complex encoding processes.
Innovation Solution
A method for generating low-density parity-check codes that allows flexible adjustment of code length and circulant permutation matrix size by arranging block matrices along a diagonal, interposing all-zero matrices, and circularly permutating to form an expanded global matrix, while ensuring row-column constraints are met.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If algebraic methods are used to establish GC low-density parity-check code, then error correction capability is improved, but encoding process complexity increases and code length flexibility is reduced
Solution Approach 1:
The patent segments the parity-check matrix into local matrices and global matrices. Local matrices handle short code length encoding with simpler algebraic methods, while global matrices provide the coupling for error correction. This segmentation allows different parts of the system to use appropriately complex methods, reducing overall encoding complexity while maintaining error correction capability.
Solution Approach 2:
The patent changes the parameter of code length flexibility by allowing the global matrix to be configured with variable dimensions and coupling strengths. This enables the system to adapt code length and permutation matrix size according to specific application requirements, breaking the limitations of fixed algebraic code structures.
2Reliability
If algebraic methods are used to establish GC low-density parity-check code, then error correction capability is improved, but code length and permutation matrix size are limited
Solution Approach 1:
The patent introduces dynamic configurability to the parity-check matrix structure, where the global matrix dimensions, local matrix sizes, and coupling patterns can be adjusted based on required code length and performance requirements. This dynamic approach replaces fixed algebraic structures with adaptable configurations, enabling flexible code length and permutation matrix size while maintaining error correction capability.
Solution Approach 2:
The patent creates a universal framework where the same local matrices can be reused across different code lengths by adjusting the global matrix configuration. This multi-functionality allows a single set of local matrices to serve multiple code length requirements, enhancing adaptability without sacrificing error correction performance.
3Reliability
If conventional GC low-density parity-check code is used, then error correction ability is promoted, but implementation complexity of decoder hardware increases
Solution Approach 1:
The patent segments the decoding process into local decoding operations and global decoding operations. Local decoders can be implemented with simpler hardware for short code length correction, while global decoders handle the coupling information. This segmentation reduces the complexity of individual decoder units while maintaining overall error correction ability.
Solution Approach 2:
The patent uses replicated local matrices in the parity-check structure, which enables the use of identical, standardized decoder units for each local matrix. This copying approach allows hardware reuse and standardization, reducing overall decoder hardware complexity while maintaining error correction capability through multiple identical processing elements.
Data Source
AI summary
A method for generating a low-density parity-check code, including: arranging t block matrices along a diagonal to form a local matrix, wherein the t block matrices are identical and do not overlap; the block matrix has m rows and n columns; interposing an all-zero matrix between each two adjacent columns of the block matrix to separate the n columns and form an expanded global matrix, wherein each all-zero matrix has a size of m×(t−1); permutating the expanded global matrix rightward circularly in sequence to generate t expanded global matrices, and arranging the t expanded global matrices under the local matrix in sequence to form a basic parity-check matrix. The present invention can flexibly adjust the code length and the CPM size of the basic parity-check matrix, reducing the complexity of the parity-check matrix to further simplify the implementation of the decoder hardware.