LDPC Decoding with Parallel Bit-Flipping and Extreme Value Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional low density parity code (LDPC) decoding methods are inefficient due to the need to wait for previous operations to complete, leading to prolonged overall time for iterative operations and reduced performance.
Innovation Solution
A decoding method that performs bit-flipping operations concurrently with extreme value search operations, using parity check sub-matrices to update data bit value sets and determine error thresholds, allowing for simultaneous syndrome calculations and iterative operations without waiting for extreme value search completion.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If traditional sequential decoding operations are performed (waiting for extreme value search to complete before bit-flipping), then operational correctness is maintained, but overall decoding time is excessively long
Solution Approach 1:
The patent performs preliminary syndrome calculations and error function calculations before the iterative operations begin. By pre-computing these values and storing them in buffers, the system prepares data in advance so that bit-flipping operations can proceed concurrently with extreme value search without waiting for previous steps to complete, thus reducing overall decoding time while maintaining correctness
Solution Approach 2:
The patent enables continuous decoding operations by allowing multiple operations to execute concurrently rather than sequentially. The bit-flipping operations continue without interruption while extreme value search proceeds in parallel, maximizing resource utilization and eliminating idle waiting time, thereby achieving continuous useful action throughout the decoding process
2Productivity
If concurrent operations are performed (bit-flipping alongside extreme value search), then decoding speed is improved, but resource requirements and operational complexity increase
Solution Approach 1:
The patent divides the decoding process into distinct functional modules: syndrome calculation units, error function calculation units, bit-flipping units, and extreme value search units. Each module handles a specific operation and can execute independently or concurrently with others. This segmentation allows parallel execution while keeping each module's complexity manageable and the overall system organized
Solution Approach 2:
The patent introduces buffer memory as an intermediary component that stores intermediate results (syndrome values, error functions, thresholds) between calculation stages. These buffers act as mediators that decouple the timing dependencies between concurrent operations, allowing bit-flipping and extreme value search to proceed independently while maintaining data flow and operational correctness
Data Source
AI summary
A decoding method is provided, and the method includes performing a decoding operation on a plurality of data bit value sets of a codeword. The decoding operation includes following steps: (1) obtaining a syndrome of the data bit value sets; (2) determining whether the codeword is correct or incorrect according to the latest obtained syndrome, wherein if the codeword is correct, the decoding operation is ended, wherein if the codeword is wrong, continuing to step (3) to start an iterative operation; (3) obtaining a plurality of error value sets respectively corresponding to the data bit value sets, wherein in response to obtaining a first error value set, steps (4) and (5) are performed simultaneously; (4) performing an extreme value search operation; (5) performing a bit-flipping operation; and (6) performing a syndrome calculation operation after the step (5) is completed, and performing step (2).