A Class of Nonbinary LDPC Codes with Fast Encoding and Decoding Algorithms

This letter is concerned with a class of nonbinary low-density parity-check (LDPC) codes, referred to as column-scaled LDPC (CS-LDPC) codes, whose parity-check matrices have a property that each column is a scaled binary vector. The CS-LDPC codes, which include algebraically constructed nonbinary LD...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 61; no. 1; pp. 1 - 6
Main Authors: Zhao, Shancheng, Ma, Xiao, Zhang, Xiaoyi, Bai, Baoming
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.01.2013
Institute of Electrical and Electronics Engineers
Subjects:
Algebraic LDPC codes
Applied sciences
Coding, codes
Complexity theory
Decoding
Encoding
Exact sciences and technology
FFT-QSPA
Finite element methods
Information, signal and communications theory
Iterative decoding
multistage decoding
nonbinary LDPC codes
Signal and communications theory
Telecommunications and information theory
Vectors
Performance evaluation
Finite field
Multistage method
Fast Fourier transformation
Coding circuit
Algebraic LDPC codes
Algebraic code
Iterative method
nonbinary LDPC codes
Algorithm
Iterative decoding
Implementation
Degradation
FFT-QSPA
Simulation
Coding
Algebraic method
Error correcting code
Parity check codes
multistage decoding
Parity check
Damaging
ISSN:0090-6778, 1558-0857
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This letter is concerned with a class of nonbinary low-density parity-check (LDPC) codes, referred to as column-scaled LDPC (CS-LDPC) codes, whose parity-check matrices have a property that each column is a scaled binary vector. The CS-LDPC codes, which include algebraically constructed nonbinary LDPC codes as subclasses, admit fast encoding and decoding algorithms. Specifically, for a code over the finite field F 2p , the encoder can be implemented with p parallel binary LDPC encoders followed by a series of bijective mappers, while the decoder can be implemented with an iterative decoder in which no message permutations are required during the iterations. In addition, there exist low-complexity iterative multistage decoders that can be utilized to trade off the performance against the complexity. Simulation results show that the performance degradation caused by the iterative multistage decoding algorithms is relevant to the code structure.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2012.101712.110173