On optimal and near-optimal turbo decoding using generalized max* operator

Authors:
Stylianos Papaharalabos;P. Takis Mathiopoulos;Guido Masera;Maurizio Martina
Affiliations:
Institute for Space Applications and Remote Sensing, National Observatory of Athens, Athens, Greece;Institute for Space Applications and Remote Sensing, National Observatory of Athens, Athens, Greece;VLSI Lab, Dipartimento di Elettronica, Politecnico di Torino, Torino, Italy;VLSI Lab, Dipartimento di Elettronica, Politecnico di Torino, Torino, Italy
Venue:
IEEE Communications Letters
Year:
2009

Citing 3
Cited 3

Convex Optimization

Convex Optimization
Channel codng for 4G systems with adaptive modulation and codng

IEEE Wireless Communications
An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes

IEEE Journal on Selected Areas in Communications

On chip interconnects for multiprocessor turbo decoding architectures

Microprocessors & Microsystems
Novel Generalized max* Approximation Method for Simplified Decoding of Turbo and TTCM Codes

Wireless Personal Communications: An International Journal
A network-on-chip-based turbo/LDPC decoder architecture

DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by a recently published robust geometric programming approximation, a generalized approach for approximating efficiently the max* operator is presented. Using this approach, the max* operator is approximated by means of a generic and yet very simple max operator, instead of using additional correction term as previous approximation methods require. Following that, several turbo decoding algorithms are obtained with optimal and near-optimal bit error rate (BER) performance depending on a single parameter, namely the number of piecewise linear (PWL) approximation terms. It turns out that the known Max-Log-MAP algorithm can be viewed as special case of this new generalized approach. Furthermore, the decoding complexity of the most popular previously published methods is estimated, for the first time, in a unified way by hardware synthesis results, showing the practical implementation advantages of the proposed approximations against these methods.