By Topic

The Error-Pattern-Correcting Turbo Equalizer: Spectrum Thinning at High SNRs

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
$33 $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)
Hakim Alhussien ; Link-A-Media Devices, Santa Clara, CA, USA ; Jaekyun Moon

The error-pattern correcting code (EPCC) is a code designed to correct frequently observed error cluster patterns of the intersymbol interference (ISI) channel. This paper focuses on developing theoretical understanding of the performance of serial concatenation of the EPCC with an outer recursive systematic convolutional code (RSCC) in ISI channel environments. To analyze the performance of this EPCC-RSCC concatenation, an upper union bound on the maximum-likelihood (ML) bit-error rate (BER), averaged over all possible interleavers, is derived which offers crucial insights into the error floor behavior of the matching turbo decoder. The ML bound is also used to compare the performance of EPCC-RSCC to that of a stand-alone RSCC in serial concatenation to precoded and nonprecoded ISI channels. This comparison shows that by targeting the low Hamming-weight interleaved errors of the RSCC, which result in low Euclidean distance error events in the channel detector, EPCC-RSCC exhibits a much lower BER floor compared to conventional schemes, especially for high rate applications and short interleaver lengths. The error rate performance of an iterative suboptimal turbo equalizer (TE), called TE-EPCC, is also demonstrated to converge close to the ML bound at high SNR.

Published in:

IEEE Transactions on Information Theory  (Volume:57 ,  Issue: 2 )