Window-based expectation propagation for adaptive signal detection in flat-fading channels

被引:17
|
作者
Qi, Yuan
Minka, Thomas P.
机构
[1] MIT, Comp Sci & Artificial Intelligence Lab, Cambridge, MA 02139 USA
[2] Microsoft Res, Cambridge CB3 OFB, England
关键词
signal detection; expectation propagation; sequential estimation; fading channels; Monte Carlo methods; nonlinear or non-Gaussian systems; Bayesian inference;
D O I
10.1109/TWC.2007.05237
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we propose a new Bayesian receiver for signal detection in flat-fading channels. First, the detection problem is formulated as an inference problem in a graphical model that models a hybrid dynamic system with both continuous and discrete variables. Then, based on the expectation propagation (EP) framework, we develop a smoothing algorithm to address the inference problem and visualize this algorithm using factor graphs. As a generalization of loopy belief propagation, EP efficiently approximates Bayesian estimation by iteratively propagating information between different nodes in the graphical model and projecting the posterior distributions into the exponential family. We use window-based EP smoothing for online estimation as in the signal detection problem. Window-based EP smoothing achieves accuracy similar to that obtained by batch EP smoothing, as shown in our simulations, while reducing delay time. Compared to sequential Monte Carlo filters and smoothers, the new method has lower computational complexity since it makes analytically deterministic approximation instead of Monte Carlo approximations. Our simulations demonstrate that the new receiver achieves accurate detection without the aid of any training symbols or decision feedbacks. Furthermore, the new receiver achieves accuracy comparable to that achieved by sequential Monte Carlo methods, but with less than one-tenth computational cost.
引用
收藏
页码:348 / 355
页数:8
相关论文
共 50 条
  • [1] Expectation propagation for signal detection in flat-fading channels
    Qi, Y. (yuanqi@media.mit.edu), 1600, IEEE Information Theory Society (Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331, Piscataway, NJ 08855-1331, United States):
  • [2] Expectation propagation for signal detection in flat-fading channels
    Qi, Y
    Minka, T
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 358 - 358
  • [3] Expectation Propagation for Flat-Fading Channels
    Conti, Elisa
    Piemontese, Amina
    Colavolpe, Giulio
    Vannucci, Armando
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2023, 12 (11) : 1846 - 1850
  • [4] On the performance of signal detection algorithms in flat-fading and frequency-selective MIMO channels
    Jorswieck, E
    Jungnickel, V
    Haustein, T
    Pohl, V
    von Helmolt, C
    IEEE 55TH VEHICULAR TECHNOLOGY CONFERENCE, VTC SPRING 2002, VOLS 1-4, PROCEEDINGS, 2002, : 40 - 44
  • [5] Adaptive joint detection and decoding in flat-fading channels via mixture Kalman filtering
    Chen, R
    Wang, XD
    Liu, JS
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (06) : 2079 - 2094
  • [6] Adaptive turbo-coded modulation for flat-fading channels
    Vishwanath, S
    Goldsmith, A
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (06) : 964 - 972
  • [7] Secrecy Rate of Adaptive Modulation Techniques in Flat-Fading Channels
    Amorim, A.
    Galdino, J. F.
    IEEE LATIN AMERICA TRANSACTIONS, 2010, 8 (04) : 332 - 339
  • [8] Adaptive joint detection and decoding in flat-fading channels via mixture Kalman filtering
    Chen, R
    Wang, XD
    Liu, JS
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 271 - 271
  • [9] Equalization on fast flat-fading channels based on signal-to-interference ratio optimization
    Boudreau, D
    1996 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - CONVERGING TECHNOLOGIES FOR TOMORROW'S APPLICATIONS, VOLS. 1-3, 1996, : 1193 - 1197
  • [10] On frequency offset estimation for flat-fading channels
    Besson, O
    Stoica, P
    IEEE COMMUNICATIONS LETTERS, 2001, 5 (10) : 402 - 404