ABP Decoding Apparatus Error Suppression
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing decoding methods using adaptive belief propagation for Reed-Solomon and BCH codes may result in decoder errors, leading to suboptimal decoding performance due to the potential for unrecognized errors.
Innovation Solution
A decoding apparatus and method that employs repetitive decoding with belief propagation, retaining a list of decoded word candidates and selecting the most likely decoded word to suppress decoder errors and enhance decoding performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If adaptive belief propagation decoding is used for Reed-Solomon and BCH codes, then decoding speed and efficiency are improved, but decoder errors occur leading to suboptimal decoding performance
Solution Approach 1:
The patent applies preliminary action by performing multiple iterative decoding passes before finalizing the decoded word. The belief propagation algorithm is executed repeatedly with updated reliability values, and candidate decoded words are generated in advance through list decoding, allowing the system to select the most reliable result rather than accepting the first decoding attempt.
Solution Approach 2:
The patent implements feedback mechanisms where reliability values are continuously updated based on previous decoding results. The soft information from each decoding pass feeds back into the next iteration, allowing the decoder to refine its estimates. The list of candidate decoded words also provides feedback for selection and validation in subsequent iterations.
2Reliability
If list decoding with multiple candidates is retained, then decoding accuracy is improved, but device complexity and calculation cost increase
Solution Approach 1:
The patent changes parameters by dynamically adjusting the list size and reliability thresholds during decoding. Instead of maintaining a fixed large list of candidates, the system adapts the number of retained candidates based on confidence levels and error patterns, reducing unnecessary computational overhead while maintaining accuracy for difficult cases.
Solution Approach 2:
The patent applies partial action by maintaining only the necessary number of candidate decoded words rather than exhaustively evaluating all possible combinations. The belief propagation algorithm focuses computation on the most promising candidates identified through soft decision metrics, avoiding unnecessary calculation on unlikely candidates.
Data Source
AI summary
A decoding apparatus and method is disclosed by which the decoder error occurrence probability is suppressed and a high decoding performance can be achieved. An ABP decoding apparatus diagonalizes a parity check matrix, updates LLR values, decodes the LLR values and then adds a decoded word obtained by the decoding to a decoded word list. The ABP decoding apparatus repeats the decoding procedure as inner repetitive decoding by a predetermined number of times. Further, as the ABP decoding apparatus successively changes initial values for priority ranks of the LLR values, it repeats the inner repetitive decoding as outer repetitive decoding by a predetermined number of times. Then, the ABP decoding apparatus selects an optimum one of the decoded words from within a decoded word list obtained by the repeated inner repetitive decoding. The invention is applied to an error correction system.