Publications – Details
On the EXIT Characteristics of Feed Forward Convolutional Codes
- Authors:
- Laurent Schmalen, Peter Vary, Marc Adrat, and Thorsten Clevorn
- Book Title:
- Proceedings of IEEE International Symposium on Information Theory (ISIT)
- Venue:
- Nice, France
- Date:
- June 2007
- Pages:
- 2686–2690
- Language:
- English
Abstract
In our contribution we analyze the EXIT characteristics of feed forward convolutional codes employed in a parallel concatenated Turbo scheme or as inner component in a serially concatenated scheme. It turns out that the EXIT characteristics reveal some general limitations. First we give an illustrative reason for the limited capabilities of feed forward and non-terminated recursive convolutional codes and secondly, we provide novel analytical means to determine the maximum mutual information available at the extrinsic output of feed forward convolutional decoders. This upper bound for the mutual information is only dependent on the channel quality and on the Hamming weight of the impulse response of the convolutional code. The paper concludes by determining the maximum mutual information for a wide range of channel conditions and code parameters, showing for which codes and channel conditions a maximum mutual information of $\approx 1$ bit can be reached.
Download of Publication
Copyright Notice
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
The following notice applies to all IEEE publications:
© IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.