By Topic

Improving the performance of turbo codes via sub-optimal rate allocation

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)
Daneshgaran, F. ; Dept. of ECE, California State Univ., Los Angeles, CA, USA ; Mulassano, P.

This paper looks at the problem of the implicit unequal error protection observed in the asymptotic performance of most turbo codes. In particular we propose a new formulation of the rate allocation problem associated with the distribution of a fixed quota of coded bits in the trellis sections of the upper and lower recursive systematic convolutional (RSC) codes of the turbo code structure. The main goal of this work is the design of an effective greedy approach for solving this rate allocation problem via a two phase process of puncturing and repetition coding. Sample simulation results confirm that the asymptotic performances in terms of error floor are improved confirming the potential gain of this approach.

Published in:

Communications, 2003. ICC '03. IEEE International Conference on  (Volume:5 )

Date of Conference:

11-15 May 2003