By Topic

Upper bounds on the state complexity of trellis diagrams for 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
$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)
Okamura, T. ; C&C Media Res. Labs., NEC Corp., Kawasaki, Japan

Upper bounds on the state complexity of minimal trellises for turbo codes are reported. State complexity depends on a permutation of bit positions, and three specific types of bit orders are considered. One is the standard order. The other two are known to result in a very low complexity when the interleaver in the encoder is a block interleaver. This tendency may be explained on the basis of the fact that the upper bounds for these two types of bit orders will be very small when the interleaver is a block type. Two newly defined interleaver parameters are used here to describe the upper bounds.

Published in:

Global Telecommunications Conference, 1999. GLOBECOM '99  (Volume:5 )

Date of Conference:

1999