An enhanced deterministic sequential Monte Carlo method for near-optimal MIMO demodulation

被引:0
|
作者
Aggarwal, Pradeep [1 ]
Prasad, Narayan [2 ]
Wang, Xiaodong [1 ]
机构
[1] Columbia Univ, Dept Elect Engn, New York, NY 10027 USA
[2] NEC Labs Amer, Princeton, NJ 08540 USA
基金
美国国家科学基金会;
关键词
D O I
10.1109/CISS.2006.286447
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We propose a low-complexity, linear MMSE-based sequential Monte Carlo (SMC) technique as an alternative to the sphere decoder for near-optimal demodulation in MIMO systems. Prior to the SMC procedure, the received signal is passed through a linear MMSE-based preprocessing step, which also determines an optimal channel-dependent order of detection and produces a sequential structure. The algorithm then draws the symbol samples in a deterministic fashion, and the survivor paths are selected based on their importance weights. The proposed algorithm exploits the rectangular structure of the QAM signal constellation by separating the real and imaginary parts of the signal to reduce the complexity associated with the listing and weight update steps. We demonstrate through simulations that the new method achieves the sphere decoder performance for V-BLAST systems.
引用
下载
收藏
页码:123 / 128
页数:6
相关论文
共 50 条
  • [21] Stratification and optimal resampling for sequential Monte Carlo
    Li, Yichao
    Wang, Wenshuo
    Deng, K. E.
    Liu, Jun S.
    BIOMETRIKA, 2022, 109 (01) : 181 - 194
  • [22] OPTIMAL MULTISTAGE SEQUENTIAL MONTE-CARLO
    RAGHEB, MMH
    ATOMKERNENERGIE-KERNTECHNIK, 1983, 43 (02): : 127 - 132
  • [23] A Near-Optimal Detector for Spatial Modulation MIMO Systems
    Lee, Gwang-Ho
    Yun, Hye-Yeon
    Kim, Tae-Hwan
    2016 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2016, : 1890 - 1893
  • [24] On layer ordering techniques for near-optimal MIMO detectors
    Siti, Massimiliano
    Fitz, Michael P.
    2007 IEEE WIRELESS COMMUNICATIONS & NETWORKING CONFERENCE, VOLS 1-9, 2007, : 1200 - +
  • [25] Near-Optimal Deterministic Steiner Tree Maintenance in Sensor Networks
    Sharma, Gokarna
    Busch, Costas
    2014 IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING IN SENSOR SYSTEMS (IEEE DCOSS 2014), 2014, : 201 - 208
  • [26] Rapid near-optimal VQ design with a deterministic data net
    Effros, M
    Schulman, LJ
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 298 - 298
  • [27] DETERMINISTIC NEAR-OPTIMAL APPROXIMATION ALGORITHMS FOR DYNAMIC SET COVER
    Bhattacharya, Sayan
    Henzinger, Monika
    Nanongkai, Danupon
    Wu, Xiaowei
    SIAM JOURNAL ON COMPUTING, 2023, 52 (05) : 1132 - 1192
  • [28] Near-Optimal Deterministic Vertex-Failure Connectivity Oracles
    Long, Yaowei
    Saranurak, Thatchaphol
    2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022, : 1002 - 1010
  • [29] Near-Optimal Deterministic Steiner Tree Maintenance in Sensor Networks
    Sharma, Gokarna
    Busch, Costas
    ACM TRANSACTIONS ON SENSOR NETWORKS, 2016, 12 (01)
  • [30] Generating Near-Optimal Road Condition-Capacity Improvement Decisions Using Monte Carlo Simulations
    Obunguta, Felix
    Kaito, Kiyoyuki
    Sasai, Kotaro
    Kobayashi, Kiyoshi
    Matsushima, Kakuya
    Bakamwesiga, Hilary
    Journal of Infrastructure Systems, 2024, 30 (04)