Turbo Decoding Using the Sectionalized Minimal Trellis of the Constituent Code: Performance-Complexity Trade-Off

The performance and complexity of turbo decoding using rate k/n constituent codes are investigated. The conventional, minimal and sectionalized trellis modules of the constituent convolutional codes are utilized. The performance metric is the bit error rate (BER), while complexity is analyzed based...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2013-09, Vol.61 (9), p.3600-3610
Main Authors: Moritz, Guilherme Luiz, Demo Souza, Richard, Pimentel, Cecilio, Pellenz, Marcelo Eduardo, Uchoa-Filho, Bartolomeu F., Benchimol, Isaac
Format: Article
Language:English
Subjects:
Applied sciences
Bit error rate
Codes
Coding, codes
Complexity
Complexity theory
Constituents
Convolutional codes
Decoding
decoding complexity
Exact sciences and technology
Information, signal and communications theory
Mathematical analysis
Measurement
minimal trellis
Modules
Performance measurement
Signal and communications theory
Studies
Systematics
Telecommunications and information theory
Tradeoffs
Turbo codes
Vectors (mathematics)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The performance and complexity of turbo decoding using rate k/n constituent codes are investigated. The conventional, minimal and sectionalized trellis modules of the constituent convolutional codes are utilized. The performance metric is the bit error rate (BER), while complexity is analyzed based on the number of multiplications, summations and comparisons required by the max-log-MAP decoding algorithm. Our results show that the performance depends on how the systematic bits are grouped in a trellis module. The best performance is achieved when the k systematic bits are grouped together in the same section of the module, so that the log-likelihood ratio (LLR) of the k-bit vector is calculated at once. This is a characteristic of the conventional trellis module and of some of the sectionalizations of the minimal trellis module. Moreover, we show that it is possible to considerably reduce the decoding complexity with respect to the conventional trellis if a particular sectionalization of the minimal trellis module is utilized. In some cases, this sectionalization is found within the best performing group, while in some other cases a small performance loss can be traded off for a large complexity reduction.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2013.072913.120912