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/ Algorithmsarrow_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/
Algorithms
Article . 2015 . Peer-reviewed
License: CC BY
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/
Algorithms
Article . 2015 . Peer-reviewed
License: CC BY
Data sources: Crossref
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/
Algorithms
Article
License: CC BY
Data sources: UnpayWall
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/
Algorithms
Article . 2015
Data sources: DOAJ
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2015
Data sources: zbMATH Open
DBLP
Article . 2015
Data sources: DBLP
versions View all 5 versions
addClaim

Multi-Feedback Interference Cancellation Algorithms for OFDM Systems over Doubly-Selective Channels

Multi-feedback interference cancellation algorithms for OFDM systems over doubly-selective channels
Authors: Peng Li; Min Chen 0023; Li Alex Li; Jiao Feng;

Multi-Feedback Interference Cancellation Algorithms for OFDM Systems over Doubly-Selective Channels

Abstract

Orthogonal frequency-division multiplexing (OFDM) systems over rapidly time varying channels may suffer from significant inter-carrier interference (ICI), which destroys the orthogonality between subcarriers and degrades the detection performance. Without sufficient ICI suppression, OFDM systems usually experience an error floor. According to the approximate matched filter bound (AMFB), the error floor in a coded OFDM system is not irreducible. In this work, we introduce novel multiple feedback matched filter (MBMF)-based ICI cancellation receivers. Based on the output of a novel MBMF scheme, the approach employs a multiple ICI cancellation strategy with or without signal-to-interference-plus-noise-ratio (SINR) ordering. The developed schemes can significantly improve the performance and remove the error floor with a negligible complexity increase. Given the multiple cancellation approach, we compare the SINR performance of the MBMF outputs with that employing single feedback and show that the SINR performance with multiple cancellation candidates is improved over that with a single one at practical SNR values. Additionally, for time-varying channels, we exploit partial fast Fourier transform (PFFT) by splitting one OFDM symbol into multiple segments; the channel state is separately estimated by least-squares (LS) methods without inserting more pilots. Simulation results demonstrate the superiority of the proposed methods over serial and block equalizers and the robustness to the Doppler effects compared to conventional single-segment method.

Related Organizations
Keywords

doubly-selective channels, Industrial engineering. Management engineering, Electronic computers. Computer science, Communication theory, interference cancellation, QA75.5-76.95, T55.4-60.8, OFDM

  • 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).
    2
    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!
2
Average
Average
Average
gold