Two Low-Complexity Reliability-Based Message-Passing Algorithms for Decoding Non-Binary LDPC Codes

This paper presents two low-complexity reliability-based message-passing algorithms for decoding LDPC codes over non-binary finite fields. These two decoding algorithms require only finite field and integer operations and they provide effective trade-off between error performance and decoding comple...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 58; no. 11; pp. 3140 - 3147
Main Authors: Chen, Chao-Yu, Huang, Qin, Chao, Chi-chao, Lin, Shu
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.11.2010
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Applied sciences
Coding, codes
Complexity theory
Decoding
Exact sciences and technology
fast Fourier transform q-ary sum-product algorithm
Geometry
Information, signal and communications theory
Iterative decoding
non-binary LDPC codes
Reliability
Reliability-based message-passing algorithms
Signal and communications theory
Telecommunications and information theory
Variable speed drives
Finite field
Error estimation
Fast Fourier transformation
Decoding
Algorithm
Binary code
Field experiment
Reliability-based message-passing algorithms
Message passing
Algorithm complexity
fast Fourier transform q-ary sum-product algorithm
Error correcting code
Parity check codes
non-binary LDPC codes
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 paper presents two low-complexity reliability-based message-passing algorithms for decoding LDPC codes over non-binary finite fields. These two decoding algorithms require only finite field and integer operations and they provide effective trade-off between error performance and decoding complexity compared to the non-binary sum product algorithm. They are particularly effective for decoding LDPC codes constructed based on finite geometries and finite fields.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2010.091310.090327