A modified Min-Sum algorithm for low-density parity-check codes

Author

Han, Wei ; Huang, Jianguo ; Wu, Fangfei

Author_Institution

Coll. of Marine Eng., Northwestern Polytech. Univ., Xi´´an, China

fYear

2010

fDate

25-27 June 2010

Firstpage

449

Lastpage

451

Abstract

A modified Min-Sum algorithm for low-density parity check codes is proposed in this paper. The inaccurate check node messages of the Min-Sum algorithm compared to the belief propagation (BP) algorithm are compensated by modified variable node messages, which is different from the normalized Min-Sum algorithm. The modified factor is obtained before decoding program and only one extra multiplication is needed in one cycle. So the increased complexity is fairly low. The simulation results show that the bit error rate (BER) and average number of iteration of the modified Min-Sum algorithm are very close to the BP algorithm, the modified algorithm can improve the BER performance compared to the Min-Sum algorithm while added complexity slightly.

Keywords

AWGN channels; Belief propagation; Bit error rate; Degradation; Educational institutions; Error correction codes; Iterative algorithms; Iterative decoding; Parity check codes; LDPC codes; Min-Sum algorithm; belief propagation; bit error rate(BER); modified factor;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Information Security (WCNIS), 2010 IEEE International Conference on

Conference_Location

Beijing, China

Print_ISBN

978-1-4244-5850-9

Type

conf

DOI

10.1109/WCINS.2010.5541818

Filename

5541818