Structured Non-Binary LDPC Codes for Faster Decoding With Less Memory
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current communication systems face inefficiencies in data transmission due to noise, interference, and fading, particularly in next-generation multimedia mobile communication systems, where binary LDPC codes are insufficient for high-speed and reliable data processing, necessitating the development of non-binary structured LDPC codes with reduced storage capacity and improved decoding speed.
Innovation Solution
A method for generating non-binary structured LDPC codes by constructing a parity check matrix composed of sub-matrices, including zero matrices and non-binary identity matrices, specifically using three types of Q matrices (Type 1, Type 2, and Type 3) to optimize storage and decoding performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If binary LDPC codes are used for data transmission, then the implementation is simple, but the decoding performance and reliability are insufficient for high-speed multimedia communication
Solution Approach 1:
The patent transitions from binary LDPC codes to non-binary LDPC codes by changing the algebraic structure parameter from GF(2) to GF(q) where q>2. This parameter change enables better error correction performance and higher decoding reliability while maintaining structured code properties for efficient implementation.
Solution Approach 2:
The patent employs composite structured parity check matrices that combine multiple types of sub-matrices (identity matrices, shifted identity matrices, and zero matrices) in a systematic arrangement. This composite structure achieves both high decoding performance and implementation efficiency by leveraging the strengths of different matrix components.
2Reliability
If unstructured parity check matrices are used, then the code performance is high, but the storage capacity requirement and decoding complexity increase
Solution Approach 1:
The patent divides the large parity check matrix into smaller sub-matrices (identity matrices, shifted identity matrices, and zero matrices). This segmentation reduces the storage requirement from O(N²) to O(N) by exploiting the repetitive and structured nature of these sub-matrices, while maintaining the performance benefits of structured codes.
Solution Approach 2:
The patent changes the structural parameters of the parity check matrix by using specific patterns of sub-matrices with defined positions and transformations. This structured approach reduces the degrees of freedom in matrix design, enabling compact representation and efficient decoding algorithms with reduced storage requirements.
3Productivity
If non-binary structured LDPC codes are generated with reduced storage capacity, then the decoding speed improves, but the code design complexity increases
Solution Approach 1:
The patent segments the code design process into standardized operations: generating identity matrices, creating shifted versions, and arranging them in predetermined patterns. This modular segmentation simplifies the overall design complexity while enabling fast decoding through structured matrix properties that reduce computational burden.
Data Source
AI summary
A method for generating a non-binary Low Density Parity Check (LDPC) code. The method includes generating non-binary identity matrixes so as to satisfy at least one condition, wherein the non-binary LDPC code is defined by a parity check matrix, and the parity check matrix includes a plurality of sub-matrixes, which are divided into zero matrixes and the non-binary identity matrixes.