Iterative Decoding with Minimum-Estimate Buffering Against Error Floors
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Iterative decoding algorithms often exhibit an error-floor phenomenon where bit error rates improve initially but then increase at higher signal-to-noise ratios, limiting their utility due to late-stage performance slowdowns.
Innovation Solution
An iterative decoding method that executes multiple cycles based on a parity check equation, storing minimum estimated values for variable nodes in a data buffer and outputting these values as the final result when the maximum cycle count is reached, thereby reducing bit error rates without generating an error-floor phenomenon.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the maximum number of iterative decoding cycles is executed, then the decoding process completes, but the bit error rate increases due to the error-floor phenomenon
Solution Approach 1:
The patent stores the minimum estimated values for variable nodes corresponding to the minimum number of bit errors during the iterative decoding cycles. When the maximum number of cycles is reached, these pre-stored minimum values are output as the final decoding result, preventing the error-floor phenomenon by avoiding the use of late-stage degraded estimates.
2Measurement precision
If iterative decoding cycles are executed, then decoding accuracy improves initially, but performance slows down in late stages
Solution Approach 1:
During the iterative decoding cycles, the patent identifies and stores the minimum estimated values corresponding to the minimum number of bit errors. This preliminary identification and storage of optimal values during the decoding process allows the system to quickly output the best result without waiting for all maximum cycles to complete, thus reducing decoding time while maintaining accuracy.
3Ease of manufacture
If the Nth codeword is output as final result, then the decoding process is simple, but the error-floor phenomenon occurs
Solution Approach 1:
The patent maintains a storage unit that records the minimum estimated values for variable nodes corresponding to the minimum number of bit errors encountered during iterative decoding. When the maximum number of cycles is reached, this pre-stored optimal result is output instead of the final Nth codeword, preventing the error-floor phenomenon while adding minimal complexity to the decoding process.
Data Source
AI summary
An iterative decoding method is disclosed and includes sequentially executing a number of iterative decoding cycles in relation to a parity check equation until the parity check equation is resolved, or a maximum number N of iterative decoding cycles is reached, during execution of the number of iterative decoding cycles, storing in a data buffer minimum estimated values for a set of variable nodes corresponding to a minimum number of bit errors, and outputting the minimum estimated values stored in the data buffer as a final decoding result when the number of iterative decoding cycles reaches N.