Message-Passing Receiver for OFDM Systems Over Highly Delay-Dispersive Channels

被引:6
|
作者
Barbu, Oana-Elena [1 ]
Manchon, Carles Navarro [2 ]
Rom, Christian [1 ]
Fleury, Bernard H. [2 ]
机构
[1] Intel Mobile Commun, DK-9220 Aalborg, Denmark
[2] Aalborg Univ, Dept Elect Syst, DK-9220 Aalborg, Denmark
关键词
Iterative receiver design; mean field approximation; belief propagation; CP-OFDM systems; intrinsic interference; BELIEF PROPAGATION; ISI CANCELLATION; EQUALIZATION; INTERFERENCE; PERFORMANCE;
D O I
10.1109/TWC.2017.2648784
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Propagation channels with maximum excess delay exceeding the duration of the cyclic prefix (CP) in OFDM systems cause intercarrier and intersymbol interference which, unless accounted for, degrade the receiver performance. Using tools from Bayesian inference and sparse signal reconstruction, we derive an iterative algorithm that estimates an approximate representation of the channel impulse response and the noise variance, estimates and cancels the intrinsic interference and decodes the data over a block of symbols. Simulation results show that the receiver employing our algorithm outperforms receivers applying traditional interference cancellation and pilot-based schemes, and it approaches the performance of an ideal receiver with perfect channel state information and perfect interference cancellation capabilities. We highlight the relevance of our algorithm in the context of both current and future wireless communications systems. By enabling the OFDM receiver experiencing these harsh conditions to locally cancel the interference, our design circumvents the spectral efficiency loss incurred by extending the CP duration, otherwise a straightforward solution. Furthermore, it sets the premises for the development of receivers for multi-carrier systems like 5G, in which the subcarrier orthogonality may be relaxed or the frame duration shortened, at the expense of cutting down the CP or even removing it altogether.
引用
收藏
页码:1564 / 1578
页数:15
相关论文
共 50 条
  • [31] An efficient universal construction for message-passing systems
    Dutta, P
    Frolund, S
    Guerraoui, R
    Pochon, B
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2002, 2508 : 133 - 147
  • [32] Sharing memory robustly in message-passing systems
    Attiya, Hagit, 1600, ACM, New York (42):
  • [33] Loop parallelisation tool for message-passing systems
    Heng, ACK
    Low, MYH
    MICROPROCESSORS AND MICROSYSTEMS, 1997, 20 (07) : 409 - 421
  • [34] Message-passing decoders and their application to storage systems
    Kurkoski, BM
    Siegel, PH
    Wolf, JK
    2001 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS, 2001, : 12 - 13
  • [35] THE LINDA(R) ALTERNATIVE TO MESSAGE-PASSING SYSTEMS
    CARRIERO, NJ
    GELERNTER, D
    MATTSON, TG
    SHERMAN, AH
    PARALLEL COMPUTING, 1994, 20 (04) : 633 - 655
  • [36] PROPOSITIONAL DYNAMIC LOGIC FOR MESSAGE-PASSING SYSTEMS
    Bollig, Benedikt
    Kuske, Dietrich
    Meinecke, Ingmar
    LOGICAL METHODS IN COMPUTER SCIENCE, 2010, 6 (03) : 1 - 31
  • [37] Unifying stabilization and termination in message-passing systems
    Arora, A
    Nesterenko, M
    DISTRIBUTED COMPUTING, 2005, 17 (03) : 279 - 290
  • [38] Message-Passing Based Communication via Synchronous Execution (Channels)
    Alshammari, Nayef H.
    2020 IEEE 44TH ANNUAL COMPUTERS, SOFTWARE, AND APPLICATIONS CONFERENCE (COMPSAC 2020), 2020, : 1483 - 1489
  • [39] PERFORMANCE FIGURES FOR MESSAGE-PASSING OVER A CAMBRIDGE RING
    BRERETON, OP
    SOFTWARE-PRACTICE & EXPERIENCE, 1982, 12 (01): : 95 - 96
  • [40] Precoders for message-passing detection of partial-response channels
    Kurkoski, BM
    Siegel, PH
    Wolf, JK
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 46 - 46