Modified tree structure approach for finding the first two minimum values
Weiwei Cui, Yi Yang, Xueqin Jiang, Sooyoung Kim · 2014
In the min-sum decoding algorithm of low-density parity-check (LDPC) codes, for a given set of input values to one check node, efficient approaches for finding the first and the second minimum values are greatly needed for the low complexity decoder. In this paper, based on the tree structure (TS) approach, we propose the modified TS (MTS) approach, which requires less number of comparisons to find the first and the second minimum values. Therefore, the hardware cost of the proposed MTS approach is lower than that of the TS approach.