Cart (Loading....) | Create Account
Close category search window

Linearly approximated log-MAP algorithms for turbo decoding

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 $13
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

2 Author(s)
Jung-Fu Cheng ; Ericsson Inc., NC, USA ; Ottosson, T.

Different floating-point and fixed-point implementation issues of the log-MAP algorithm for decoding turbo codes are studied. A theoretical framework is proposed to explain why the log-MAP turbo decoders are more tolerant of overestimation of SNR than underestimation. A linear approximation (the Log-Lin algorithm) that allows for efficient ASIC implementations and results in negligible performance loss in floating-point models is proposed. It is further shown that a fixed-point implementation of this Log-Lin algorithm, including clipping and quantization of the received samples to 6 bits, results in a loss of performance of less than 0.05 dB

Published in:

Vehicular Technology Conference Proceedings, 2000. VTC 2000-Spring Tokyo. 2000 IEEE 51st  (Volume:3 )

Date of Conference:


Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.