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

Upper bounds on error probability of serially concatenated convolutional codes and MSK in AWGN and fading channels

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)
Dural, O. ; Delphi Commun. Syst., Maynard, MA, USA ; Proakis, J.G.

Serial concatenation of convolutional codes and MSK through an interleaver has a similar structure as turbo codes. Although the union bound, which is an analytical tool to estimate the bit error probability of such systems, is tight for high signal-to-noise ratio (SNR), it diverges for low SNR where the performance of our system is the most appealing. For this reason, we apply improved upper bounding techniques to our system to estimate the performance, at low SNR. We show that by applying these techniques, it is possible to obtain about 0.5dB or more improvement over the union bound in AWGN channel and 1dB or more improvement in fading channels.

Published in:

Communications, 2003. ICC '03. IEEE International Conference on  (Volume:5 )

Date of Conference:

11-15 May 2003

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.