A Turbo-Decoding Message-Passing Algorithm for Sparse Parity-Check Matrix Codes

A turbo-decoding message-passing (TDMP) algorithm for sparse parity-check matrix (SPCM) codes such as low-density parity-check, repeat-accumulate, and turbo-like codes is presented. The main advantages of the proposed algorithm over the standard decoding algorithm are 1) its faster convergence speed...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing Vol. 54; no. 11; pp. 4376 - 4392
Main Author: Mansour, M.M.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.11.2006
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithm design and analysis
Algorithms
Applied sciences
Architecture
Charts
Code standards
Codes
Coding
Coding, codes
Decoders
Decoding
Digital video broadcasting
Exact sciences and technology
Information, signal and communications theory
Iterative decoding
Iterative methods
low-density parity-check (LDPC) codes
Maximum likelihood decoding
Parity check codes
Ramanujan graphs
repeat-accumulate (RA) codes
Signal and communications theory
Sparse matrices
Telecommunications and information theory
Throughput
Turbo codes
turbo decoding algorithm
Very large scale integration
very large scale integration (VLSI) decoder architectures
Performance evaluation
Information rate
Iterative method
very large scale integration (VLSI) decoder architectures
Iterative decoding
Implementation
low-density parity-check (LDPC) codes
Coding
Algorithm complexity
Sparse matrix
Convergence rate
Parity check codes
Ramanujan graphs
turbo decoding algorithm
Turbo code
Algorithm
Information transmission
Circuit architecture
Boarded computer
Message passing
Algorithm performance
Error correcting code
Error correction
repeat-accumulate (RA) codes
Parity check
Signal to noise ratio
ISSN:1053-587X, 1941-0476
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A turbo-decoding message-passing (TDMP) algorithm for sparse parity-check matrix (SPCM) codes such as low-density parity-check, repeat-accumulate, and turbo-like codes is presented. The main advantages of the proposed algorithm over the standard decoding algorithm are 1) its faster convergence speed by a factor of two in terms of decoding iterations, 2) improvement in coding gain by an order of magnitude at high signal-to-noise ratio (SNR), 3) reduced memory requirements, and 4) reduced decoder complexity. In addition, an efficient algorithm for message computation using simple "max" operations is also presented. Analysis using EXIT charts shows that the TDMP algorithm offers a better performance-complexity tradeoff when the number of decoding iterations is small, which is attractive for high-speed applications. A parallel version of the TDMP algorithm in conjunction with architecture-aware (AA) SPCM codes, which have embedded structure that enables efficient high-throughput decoder implementation, are presented. Design examples of AA-SPCM codes based on graphs with large girth demonstrate that AA-SPCM codes have very good error-correcting capability using the TDMP algorithm
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2006.880240