By Topic

Turbo decoding visualisation for a simple product code

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

1 Author(s)
Schaefer, A. ; Inst. for Commun. Eng., Munich Univ. of Technol., Germany

The code which we analyse is an (8,4) parallel concatenated code. We have put into pictures that a turbo decoder is two decoders solving local minima problems in order to solve a global minima problem. We show the suboptimality of turbo decoders by plotting decision boundaries (MAP and turbo) on the plane. A good interleaver may be one where the produced decoding surfaces are as orthogonal to each other as possible. In analog decoders we see clearly that both component decoders act simultaneously.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference: