Design of non-binary quasi-cyclic LDPC codes by absorbing set removal

Author

Amiri, B. ; Flores Castro, J.A. ; Dolecek, L.

Author_Institution

Electr. Eng. Dept., Univ. of California, Los Angeles, Los Angeles, CA, USA

fYear

2014

fDate

2-5 Nov. 2014

Firstpage

461

Lastpage

465

Abstract

Non-binary quasi-cyclic (NB-QC) codes are a class of graph-based codes with high performance and implementation-friendly structure. In this paper, we introduce a new method for designing NB-QC codes with improved performance in the low error-rate region. Specifically, we propose a construction which reduces the number of non-binary absorbing sets, which are known to cause errors when decoding non-binary LDPC codes. Our construction is based on a careful selection of the code design parameters. Simulation results demonstrate the superior performance of codes designed according to our technique compared to existing state-of-the-art NB-QC codes.

Keywords

cyclic codes; decoding; parity check codes; set theory; NB-QC code; absorbing set removal; code design parameter selection; decoding; error rate region; graph-based code; implementation-friendly structure; nonbinary absorbing set reduction; nonbinary quasi-cyclic LDPC Code; state-of-the-art NB-QC code; Algorithm design and analysis; Bit error rate; Decoding; Electronic mail; Labeling; Parity check codes; Simulation;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Workshop (ITW), 2014 IEEE

Conference_Location

Hobart, TAS

ISSN

1662-9019

Type

conf

DOI

10.1109/ITW.2014.6970874

Filename

6970874