Cart (Loading....) | Create Account
Close category search window
 

EXIT Functions for Parallel Concatenated Insertion Convolutional 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

2 Author(s)
Breddermann, T. ; Inst. of Commun. Syst. & Data Process. (ind), RWTH Aachen Univ., Aachen, Germany ; Vary, P.

Abstract-Insertion convolutional codes and the underlying principles attract more and more attention, e.g., in iterative decoding, joint channel coding and cryptography or even in channel estimation. Known bits (dummy bits) are inserted into the information bit sequence before convolutional (turbo) encoding. These bits support the decoding of the information bits resulting in an improved decoding quality. Although this concept is widely employed, there does not exist any theoretical evaluation of these codes. We provide a basis for such an evaluation by means of their EXIT charts. We will analytically derive their EXIT charts as a function of the EXIT charts associated with the underlying convolutional code for a transmission over a BEC as well as a binary input/continuous output AWGN channel. These results can be adopted to all applications where perfect information is exploited by a SISO decoder and provide an excellent basis for the analytical prediction of the expected gains.

Published in:

Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE

Date of Conference:

5-9 Dec. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.