A Matrix-Theoretic Approach to the Construction of Non-Binary Quasi-Cyclic LDPC Codes

Author

Juane Li ; Keke Liu ; Shu Lin ; Abdel-Ghaffar, Khaled

Author_Institution

Dept. of Electr. & Comput. Eng., Univ. of California, Davis, Davis, CA, USA

Volume

63

Issue

4

fYear

2015

fDate

Apr-15

Firstpage

1057

Lastpage

1068

Abstract

This paper presents two simple and very flexible methods for constructing non-binary (NB) quasi-cyclic (QC) LDPC codes. The proposed construction methods have several known ingredients including base array, masking, binary to nonbinary replacement, and matrix-dispersion. By proper choice and combination of these ingredients, NB-QC-LDPC codes with excellent performance can be constructed. The constructed codes can be decoded with a reduced-complexity iterative decoding scheme which significantly reduces the hardware implementation complexity.

Keywords

computational complexity; cyclic codes; iterative decoding; matrix algebra; parity check codes; NB QB LDPC code; base array; binary to nonbinary replacement; hardware implementation complexity reduction; masking; matrix-dispersion; matrix-theoretic approach; nonbinary quasicyclic LDPC code construction; reduced-complexity iterative decoding scheme; Arrays; Complexity theory; Decoding; Hardware; Iterative decoding; Null space; base array; binary to nonbinary replacement; masking; matrix dispersion; quasi-cyclic low density parity-check codes; revolving iterative decoding;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2015.2403856

Filename

7042290