On the Overflow Problem in Finite Precision Turbo Decoding Message Passing

Much attention has been paid recently to the so-called layered decoding of LDPC codes, also known as turbo-decoding message passing (TDMP). The TDMP algorithm for decoding LDPC codes is known to possess some desirable features, such as fast convergence speed, reduced memory requirements and reduced...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 60; no. 5; pp. 1253 - 1259
Main Author: Sulek, W.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.05.2012
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithm design and analysis
Algorithms
Applied sciences
Coding, codes
Computer simulation
Decoding
Exact sciences and technology
Hardware
Information, signal and communications theory
Iterative decoding
Low density parity check codes
Manganese
Mathematical analysis
Message passing
Messages
overflow errors
Quantization
Representations
Signal and communications theory
Studies
Telecommunications and information theory
turbo decoding algorithm
Overflow(computer arithmetics)
Performance evaluation
Dynamic response
turbo decoding algorithm
Iterative method
Turbo code
Algorithm
Iterative decoding
Implementation
Convergence speed
Low-density parity-check codes
overflow errors
Message passing
Simulation
Convergence rate
Error correcting code
Parity check 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:Much attention has been paid recently to the so-called layered decoding of LDPC codes, also known as turbo-decoding message passing (TDMP). The TDMP algorithm for decoding LDPC codes is known to possess some desirable features, such as fast convergence speed, reduced memory requirements and reduced implementation complexity in comparison with standard two-phase message passing algorithm. In this paper we analyze an important issue connected with hardware implementation of TDMP algorithm, namely the finite precision representation of messages influence on the decoding performance. Constrained dynamic range of the finite precision representation of messages entails overflow errors. We present an analysis revealing that in the subsequent decoding iterations, the subtraction of non-overflowed intrinsic message from overflowed extrinsic message is a source of errors that have substantial impact on the decoding results. The analysis is confirmed by simulation results showing significant performance loss. However this performance loss can be almost completely eliminated with a basic modifications in the messages computation algorithm. Effectiveness of the presented modifications is confirmed by simulation results obtained with hardware TDMP decoder implementation that has been developed.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2012.030712.110545