Improvements on construction of quasi cyclic irregular non binary LDPC codes

Author

Arulmozhi, M. ; Anbuselvi, M.

Author_Institution

Dept. of ECE, SSN Coll. of Eng., Chennai, India

fYear

2014

fDate

27-28 Feb. 2014

Firstpage

1

Lastpage

5

Abstract

Non Binary Low Density Parity Check (NB-LDPC) codes, a category of LDPC codes have better decoding performance in high order Galois field. A construction method called hierarchically diagonal matrix (HDM) is proposed in this paper. The constructed HDM is analyzed for IEEE 802.11 n specification of code length 648, rate 1/2 over GF (4). Codes constructed based on the hierarchical matrix perform well over the AWGN channel with FFT based sum product iterative decoding (FFT-SPA) algorithm. The computation complexity of the HDM is analyzed. The average number of multiplications and additions involved in the HDM of check node unit and variable node unit has reduced to 62% and 48% when compared with random matrix.

Keywords

Galois fields; cyclic codes; fast Fourier transforms; iterative decoding; matrix algebra; parity check codes; wireless LAN; AWGN channel; FFT; IEEE 802.11 n specification; hierarchical matrix; hierarchically diagonal matrix; high order Galois field; irregular LDPC code; low density parity check code; nonbinary LDPC code; quasicyclic LDPC code; sum product iterative decoding; Complexity theory; Decoding; Iterative decoding; Manganese; Phase change materials; Sparse matrices; LDPC; NB-LDPC 802.11n standard;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Communication and Embedded Systems (ICICES), 2014 International Conference on

Conference_Location

Chennai

Print_ISBN

978-1-4799-3835-3

Type

conf

DOI

10.1109/ICICES.2014.7034108

Filename

7034108