Cascade LDPC Decoding for Long Codeword Convergence
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional LDPC decoders face challenges in decoding codewords with lengths greater than their maximum supported length, leading to decoder failure and incomplete convergence to a valid codeword, especially when the output fails to converge within the predetermined maximum iteration limit.
Innovation Solution
The method involves processing a received vector using a cascade LDPC code structure with block matrices, partitioning the codeword into portions, and iteratively decoding each portion using specific block matrices to satisfy parity check equations, allowing for decoding of longer codewords by breaking them into segments that fit within the decoder's capacity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Length of moving object
If the codeword length is increased beyond the maximum supported length, then the data transmission capacity is improved, but the decoding reliability deteriorates due to decoder failure and incomplete convergence
Solution Approach 1:
The parity check matrix H is divided into multiple block matrices (HA, HB, HC, HD) that process different portions of the codeword sequentially. This segmentation allows the decoder to handle long codewords by breaking them into manageable segments, each processed by corresponding block matrices, thereby maintaining decoding reliability for extended codeword lengths
Solution Approach 2:
The decoding process is extended from a single-iteration approach to a multi-dimensional iterative process involving multiple passes through different block matrices. By adding the dimension of sequential block matrix processing and multiple iterations, the system can converge on valid codewords even for lengths exceeding the original maximum support
2Measurement precision
If the maximum iteration limit is set to ensure convergence, then the decoding accuracy is improved, but the processing time increases and may exceed acceptable limits
Solution Approach 1:
The decoding process is segmented into multiple passes, each handling specific portions of the codeword through dedicated block matrices. This segmentation allows the system to achieve accurate decoding results by distributing the computational workload across multiple focused iterations rather than requiring a single exhaustive iteration process
Solution Approach 2:
Each block matrix pass performs preliminary decoding actions on specific portions of the codeword before the next pass. By performing these preliminary decoding operations in sequence, the system progressively refines the decoded output and converges on the final accurate result more efficiently
Data Source
AI summary
Systems and methods are provided for decoding a codeword of a low density parity check (LDPC) code. The systems and methods may include receiving a vector corresponding to the codeword encoded with a parity check matrix, and processing a first portion of the received vector with a first portion of the parity check matrix to obtain a decoding estimate of a first portion of the codeword. The systems and methods may further include processing the decoding estimate of the first portion of the codeword with a second portion of the parity check matrix to obtain an intermediate vector, and processing a second portion of the received vector with a third portion of the parity check matrix and the intermediate vector to obtain a decoding estimate of a second portion of the codeword.