By Topic

Reduced-complexity algorithms for near-optimal decoding of turbo TCM codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Sybis, M. ; Chair of Wireless Commun., Poznan Univ. of Technol., Poznan ; Tyczka, P. ; Papaharalabos, S. ; Mathiopoulos, P.T.

A reduced-complexity modified decoding algorithm for turbo trellis-coded modulation (TTCM) is proposed and evaluated in terms of complexity and bit error rate (BER) performance in an additive white Gaussian noise channel. The algorithm uses an optimal approximation of the Jacobian logarithm, used in the so-called Log-MAP decoding, by means of the max operation and three piecewise-linear terms. Further computational complexity savings are obtained by applying this approximation only to the two largest values within the decoding step. To improve performance, the algorithms are also investigated using a scaling factor for the extrinsic information. Computer-simulated BER performance evaluation results and complexity comparisons are reported showing the near-optimal performance as well as noticeable implementation advantages of the proposed algorithms with respect to the Log-MAP decoding.

Published in:

Electronics Letters  (Volume:45 ,  Issue: 5 )