By Topic

Convolutional coupled codes between distance properties and convergence behavior of the iterative decoding scheme

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)
Chaoui, S. ; Inst. for Commun. Technol., Darmstadt Univ. of Technol., Germany

The class of convolutional coupled codes is a promising alternative to classical turbo-codes. A convolutional coupled code consists of a cascade of ν identical recursive systematic convolutional (RSC) outer codes of rate k/n and k inner block codes with parameters (2ν, ν, di). The codes are linked together such that only the systematic part of the outer codes is encoded with the inner block encoders. The bits of each information vector of the outer codes are scrambled by a given interleaving before entering to the inner encoders. In contrast to parallel concatenated turbo-codes, in which the information symbols and the redundancy from the constituent codes are transmitted, we transmit only the redundancy produced by the outer and inner codes. The over-all code rate of the resulting code remains k/n. The influence of number, code memory and code polynomials of the outer convolutional codes on the distance properties and the convergence behavior of the iterative decoding scheme is studied.

Published in:

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

Date of Conference: