GF(q) Decoder-Detector Interface With FIFO Extrinsic Memory
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional LDPC decoders face inefficiencies in computing and storing decoder extrinsic information, which affects their performance in error correction for noisy communication and data storage channels.
Innovation Solution
The method involves computing R messages for variable nodes, forming decoder extrinsic information, and storing it in a memory like a First-In-First-Out (FIFO) buffer, allowing retrieval and combination with detector extrinsic information to enhance decoding efficiency, independent of the codeword's symbol count, and incorporating a full shift calculator module for cyclic shifting of channel information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional LDPC decoders store detector extrinsic information in memory and retrieve it for subtraction to form decoder extrinsic information, then the decoding process can be completed, but the memory depth must scale with the number of symbols in the codeword, increasing memory complexity and access time
Solution Approach 1:
The patent segments the extrinsic information processing by separating detector extrinsic information from decoder extrinsic information computation. Instead of storing and retrieving full extrinsic information for all symbols, the system computes decoder extrinsic information by combining R messages directly at variable nodes, eliminating the need for deep memory structures that scale with codeword length.
Solution Approach 2:
The patent applies preliminary action by pre-computing and storing only the essential R messages at variable nodes before decoding operations begin. This allows the decoder to form decoder extrinsic information through direct combination of these pre-computed messages, avoiding the need to store and retrieve detector extrinsic information for each symbol during decoding.
2Productivity
If traditional LDPC decoders load and subtract detector extrinsic information from P messages to obtain decoder extrinsic information, then the decoding can proceed, but this process increases the time latency in the data path
Solution Approach 1:
The patent performs preliminary computation of R messages and their combination to form decoder extrinsic information before the main decoding process. By pre-computing these values and making them readily available, the system eliminates time-consuming load and subtract operations during the critical decoding path, thereby reducing data path latency.
Solution Approach 2:
The patent merges the computation of decoder extrinsic information with the R message processing at variable nodes. Instead of separate load and subtract operations, the system combines R messages directly to form decoder extrinsic information, streamlining the data path and reducing the number of operational steps required.
3Reliability
If the memory depth is increased to accommodate all detector extrinsic information for large codewords, then complete decoding can be performed, but the memory resource consumption increases significantly
Solution Approach 1:
The patent segments memory requirements by storing only essential R messages at variable nodes rather than complete detector extrinsic information for all symbols. This segmentation reduces memory resource consumption while maintaining the error correction capability through direct combination of the segmented R message components during decoding operations.
Solution Approach 2:
The patent extracts only the necessary components (R messages) from the full extrinsic information that are required for decoding. By taking out and storing only these essential elements at variable nodes, the system achieves reliable error correction with significantly reduced memory resource requirements compared to storing complete detector extrinsic information.
Data Source
AI summary
Systems and methods are provided for GF(q) iterative decoding. A decoder computes a plurality of R messages corresponding to a variable node of the decoder and forms decoder extrinsic information for the variable node by combining the plurality of R messages. The decoder stores the decoder extrinsic information in a memory during a first time period and retrieves the decoder extrinsic information from the memory during a second time period, the second time period occurring after the first time period. The decoder extrinsic information is provided to a soft detector.