By Topic

RS-A-SISO algorithms for serially concatenated CPM over fading channels and density evolution analysis

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 $31
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)
Kyuhyuk Chung ; Electr. Eng. Syst. Dept., Univ. of Southern California, Los Angeles, CA, USA ; Jun Heo

The discovery of turbo codes in 1993 is one of the exciting recent developments in coding theory. The complexity of SISOs and adaptive SISOs (A-SISOs) increases exponentially with constraint length. It is shown that serially concatenated CPM with adaptive iterative detection has turbo-like performance over fading ISI channels and also reduced state A-SISO (RS-A-SISO) systems have large iteration gains. Recently developed density evolution technique is used to obtain thresholds of RS-A-SISO algorithms, which determine the asymptotic capacity.

Published in:

Electronics Letters  (Volume:39 ,  Issue: 22 )