LDPC Decoder Search Circuit for Parallel Min and Next-Min Detection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing low-density parity-check code decoding methods are inefficient in searching for minimum and next minimum values, particularly when dealing with a large number of input values, as they require sequential completion of minimum value searches before proceeding to next minimum value searches.
Innovation Solution
A search circuit comprising a first and second search circuit that compares pairs and sets of input values to simultaneously determine the minimum value, next minimum value, and their addresses, allowing for concurrent processing without waiting for the completion of the minimum value search.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If sequential searching method is used to find minimum and next minimum values, then the searching process is simple to implement, but the decoding efficiency is low due to sequential completion requirement
Solution Approach 1:
The search circuit is divided into multiple independent comparison units (first comparison unit, second comparison unit, third comparison unit, etc.), each responsible for comparing specific input values. This segmentation allows parallel execution of minimum value search and next minimum value search operations, eliminating the sequential bottleneck while maintaining implementation simplicity through modular design.
Solution Approach 2:
The first comparison unit performs the minimum value search operation in advance and simultaneously provides the result to the second comparison unit. This preliminary action allows the next minimum value search to start before the first search completely finishes, enabling overlapping execution and improving overall decoding efficiency without significantly increasing circuit complexity.
2Speed
If concurrent processing of minimum and next minimum value searches is implemented, then the decoding speed is improved, but the computational overhead increases
Solution Approach 1:
The circuit merges the minimum value search and next minimum value search operations into a unified parallel processing structure. The first comparison unit finds the minimum value while the second, third, and fourth comparison units simultaneously search for the next minimum value using the same input data. This merging approach achieves concurrent processing without duplicating the entire search algorithm, thereby improving searching speed while controlling computational overhead through shared resources.
Data Source
AI summary
The present invention relates to a search circuit in a decoding unit of low-density parity-check codes, which used for searching a minimum value and a next minimum value from r input values, where r is an integer greater than 3. The search circuit includes a first search circuit and a second search circuit. The search method includes performing operations on each pair of input values Vi, Vj of the r input values, respectively. The second search circuit, which is coupled to the first search circuit, performs operations on every two sets of compared values Wm, Lm, and Wn, Ln of the s compared values, where s is a positive integer smaller than r, the smaller value Wm is smaller than the greater value Lm, and the smaller value Wn is smaller than the greater value Ln. The second search circuit performs operations according to the smaller value Wo and the greater value Lo to produce the minimum value and the next minimum value. Thereby, the search of the minimum value, the next minimum value, and the address of the minimum value can be performed at the same time without the need of waiting completion of search for the minimum value then the next minimum value can be searched.