By Topic

Interleaver pruning for construction of variable length turbo 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
$33 $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)
F. Daneshgaran ; Dept. of Electr. & Comput. Eng., California State Univ., Los Angeles, CA, USA ; P. Mulassano

The issue of pruning (i.e., shortening) a given interleaver in a parallel concatenated convolutional code (PCCC or turbo codes) employing recursive systematic convolutional (RSC) constituent codes has been addressed. The encoder uses two RSC codes coupled with an interleaver represented by the permutation vector. Since the encoding and decoding delay associated with turbo codes are essentially dominated by the block length (interleaver length), it is of considerable practical interest to be able to modify it in order to obtain a variable length block code. Most other interleaver construction techniques do not have a recursive build nature and as a consequence, each time the interleaver length is modified, the interleaver itself must be redesigned. In the case of turbo codes, it is desirable to identify a technique that would allow any interleaver performing a given permutation to be reduced in size with gradual performance degradation of the resulting PCCC, but without the need for changing almost completely the operation of the interleaver.

Published in:

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

Date of Conference:

2002