Improved log domain decoding algorithm for LDPC codes over GF (q)

Author

Hossain, Md Murad ; Islam, Md Rafiqul

Author_Institution

Dept. of Electr. & Electron. Eng., Islamic Univ. of Technol. (IUT), Gazipur, Bangladesh

fYear

2011

fDate

22-24 Dec. 2011

Firstpage

411

Lastpage

416

Abstract

An improved log domain decoding algorithm of Low density parity check (LDPC) codes over GF (q) using permutation to simplify the parity check equation is presented in this paper. This approach is different from the conventional log domain decoding algorithm of Low Density Parity Check (LDPC) codes over GF (q). The difference between improved log domain decoding and conventional log domain is that in improved log domain decoding permutation is applied in check node process where permutation is applied in between check node process and variable node process for conventional log domain decoding. Improved Log domain is mathematically equivalent to the conventional log domain decoding, however improved log-domain has advantages in terms of implementation, computational complexity and numerical stability. The proposed algorithm and the conventional log domain decoding algorithm are compared both in terms of memory requirement and simulated BER performance of (1008, 504) regular LDPC codes over GF (4) having row weight 3 & column weight 6, BPSK modulation.

Keywords

decoding; error statistics; parity check codes; phase shift keying; BPSK modulation; GF; LDPC codes; computational complexity; log domain decoding algorithm; low density parity check codes; memory requirement; numerical stability; permutation; simulated BER performance; GF (q); Iterative decoding; LDPC; Log Domain Decoding; sum-product algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Information Technology (ICCIT), 2011 14th International Conference on

Conference_Location

Dhaka

Print_ISBN

978-1-61284-907-2

Type

conf

DOI

10.1109/ICCITechn.2011.6164824

Filename

6164824