LDPC Base Matrix Layout for Faster Decoding Convergence
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current channel encoding schemes for high-bandwidth wireless local area networks (WLANs) face challenges in achieving reliable and efficient data transmission, particularly in 60 GHz scenarios with limited frequency and power resources.
Innovation Solution
The proposed solution involves an LDPC encoding and decoding method that uses a parity check matrix compliant with a specific base matrix design. This design accelerates decoding convergence by enabling quick transmission, exchange, and update of information between code word bits, supporting multiple code rates and improving encoding complexity and decoding performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If a conventional parity check matrix is used for LDPC encoding, then the encoding structure is simple, but the decoding convergence speed is slow
Solution Approach 1:
The patent applies local quality by designing specific patterns in the first two columns of the base matrix that differ from the rest of the matrix. These columns contain specialized structures (alternating 1-0/0-1 patterns or 1-1-1-0/1-0-1-1 sequences) that locally enhance information exchange capabilities between code word bits, thereby accelerating decoding convergence without requiring complete redesign of the entire matrix structure.
Solution Approach 2:
The patent changes the structural parameters of the base matrix by imposing specific constraints on the first two columns. These parameter changes include requiring alternating patterns of 1-0 and 0-1, or specific sequences of 1-1-1-0 and 1-0-1-1, which transform the matrix properties to enable faster information propagation during decoding while maintaining the overall sparsity and quasi-cyclic structure.
2Reliability
If the base matrix structure is optimized for faster decoding, then the decoding performance improves, but the encoding complexity increases
Solution Approach 1:
The patent segments the base matrix into distinct functional regions: the first two columns with specialized structures optimized for decoding convergence, and the remaining columns with conventional quasi-cyclic patterns. This segmentation allows the matrix to simultaneously achieve fast decoding performance through the specialized first two columns while maintaining encoding simplicity through the standard structures in the remaining columns.
Data Source
AI summary
This application discloses an LDPC encoding and decoding method and a related apparatus. This application supports 802.11 series protocols such as Wi-Fi 8, UWB. The method includes: performing low-density parity-check LDPC encoding on an information bit sequence based on a parity check matrix, to obtain a first code word, where the parity check matrix complies with a base matrix, and the base matrix meets one of the following: Each row in the first two columns of the base matrix includes at least one 1, or the first two columns of the base matrix include “1 0” and “0 1” that alternate regularly, and “1 1” is included between “1 0” and “0 1”; and sending the first code word. The parity check matrix complies with the base matrix, which can accelerate an overall decoding convergence speed of a system.