Maximum a posteriori decoding algorithms for turbo codes

Hamid R. Sadjadpour

doi:10.1117/12.394081

26 July 2000 Maximum a posteriori decoding algorithms for turbo codes

Hamid R. Sadjadpour

Proceedings Volume 4045, Digital Wireless Communication II; (2000) https://doi.org/10.1117/12.394081
Event: AeroSense 2000, 2000, Orlando, FL, United States

Abstract

The symbol-by-symbol maximum a posteriori (MAP) known also as BCJR algorithm is described. The logarithmic versions of the MAP algorithm, namely, Log-MAP and Max-Log-MAP decoding algorithms along with a new Simplified-Log-MAP algorithm, are presented here. Their bit error rate performance and computational complexity of these algorithms are compared. A new hardware architecture for implementing the MAP-based decoding algorithms suitable for chip design is also presented here.

Citation Download Citation

Hamid R. Sadjadpour "Maximum a posteriori decoding algorithms for turbo codes", Proc. SPIE 4045, Digital Wireless Communication II, (26 July 2000); https://doi.org/10.1117/12.394081

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available