Modified tree structure approach for finding the first two minimum values

Author

Weiwei Cui ; Yi Yang ; Xueqin Jiang ; Sooyoung Kim

Author_Institution

Donghua Univ., Donghua, China

fYear

2014

fDate

9-13 July 2014

Firstpage

563

Lastpage

567

Abstract

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.

Keywords

decoding; parity check codes; trees (mathematics); LDPC; MTS approach; TS approach; check node; first two minimum values; hardware cost; low complexity decoder; low-density parity-check codes; min-sum decoding algorithm; modified TS approach; modified tree structure approach; second minimum values; Architecture; Computer architecture; Decoding; Hardware; Indexes; Iterative decoding; Low-density parity-check (LDPC) code; comparison; first minimum value; minsum algorithm; second minimum value;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal and Information Processing (ChinaSIP), 2014 IEEE China Summit & International Conference on

Conference_Location

Xi´an

Print_ISBN

978-1-4799-5401-8

Type

conf

DOI

10.1109/ChinaSIP.2014.6889306

Filename

6889306