Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ http://www.eng.newca...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
https://doi.org/10.1109/atnac....
Article . 2007 . Peer-reviewed
Data sources: Crossref
versions View all 1 versions
addClaim

Near-capacity turbo equalization using optimized turbo codes

Authors: Vladimir D. Trajkovic; Minyue Fu; Peter J. Schreier;

Near-capacity turbo equalization using optimized turbo codes

Abstract

In this paper we analyze a turbo equalization scheme that combines maximum a posteriori probability (MAP) equalization and turbo decoding. Our aim is to optimize the turbo equalizer in order to approach the information capacity limit for channels with severe inter-symbol interference (ISI). For this purpose, we perform an extensive search for turbo codes that give an SNR-BER performance closest to the channel information capacity limit. Our results show that the optimized turbo equalizer can approach the information capacity limit to within 0.7 dB. We also optimize the turbo equalizer in terms of the minimum number of required turbo decoding iterations. Our results show that a turbo decoder within a turbo equalization loop requires only a small number of iterations. Finally, our analysis reveals that when there are turbo codes with similar extrinsic information transfer characteristics, the computational complexity can be reduced by choosing the code with the smallest constraint length with no loss in SNR-BER performance.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    1
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
1
Average
Average
Average