By Topic

Performance bounds on error probability of serially concatenated convolutional codes and CPM in 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. ; Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA ; Proakis, J.G.

Serial concatenation of convolutional codes and CPM through an interleaver has a similar structure as serially concatenated 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 1 dB or more improvement over the union bound in fading channels.

Published in:

Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE  (Volume:1 )

Date of Conference:

20-20 March 2003