Memory AMP for Generalized MIMO: Coding Principle and Information-Theoretic Optimality

被引:2
|
作者
Chen, Yufei [1 ]
Liu, Lei [2 ]
Chi, Yuhao [1 ]
Li, Ying [1 ]
Zhang, Zhaoyang [2 ]
机构
[1] Xidian Univ, State Key Lab Integrated Serv Networks, Xidian 710071, Peoples R China
[2] Zhejiang Univ, Coll Informat Sci & Elect Engn, Zhejiang Prov Key Lab Informat Proc Commun & Netwo, Hangzhou 310007, Zhejiang, Peoples R China
关键词
Memory approximate message passing (MAMP); generalized MIMO (GMIMO); low complexity; capacity optimality; coding principle; orthogonal/vector approximate message passing (OAMP/VAMP); MUTUAL INFORMATION; CAPACITY; SYSTEMS;
D O I
10.1109/TWC.2023.3328361
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
To support complex communication scenarios in next-generation wireless communications, this paper focuses on a generalized MIMO (GMIMO) with practical assumptions, such as massive antennas, practical channel coding, arbitrary input distributions, and general right-unitarily-invariant channel matrices (covering Rayleigh fading, certain ill-conditioned and correlated channel matrices). The orthogonal/vector approximate message passing (OAMP/VAMP) receiver has been proved to be information-theoretically optimal in GMIMO, but it is limited to high-complexity linear minimum mean-square error (LMMSE). To solve this problem, a low-complexity memory approximate message passing (MAMP) receiver has recently been shown to be Bayes optimal but limited to uncoded systems. Therefore, how to design a low-complexity and information-theoretically optimal receiver for GMIMO is still an open issue. To address this issue, this paper proposes an information-theoretically optimal MAMP receiver and investigates its achievable rate analysis and optimal coding principle. Specifically, due to the long-memory linear detection, state evolution (SE) for MAMP is intricately multi-dimensional and cannot be used directly to analyze its achievable rate. To avoid this difficulty, a simplified single-input single-output (SISO) variational SE (VSE) for MAMP is developed by leveraging the SE fixed-point consistent property of MAMP and OAMP/VAMP. The achievable rate of MAMP is calculated using the VSE, and the optimal coding principle is established to maximize the achievable rate. On this basis, the information-theoretic optimality of MAMP is proved rigorously. Furthermore, the simplified SE analysis by fixed-point consistency is generalized to any two iterative detection algorithms with the identical SE fixed point. Numerical results show that the finite-length performances of MAMP with practical optimized low-density parity-check (LDPC) codes are 0.5 similar to 2.7 dB away from the associated constrained capacities. It is worth noting that MAMP can achieve the same performances as OAMP/VAMP with 4 parts per thousand of the time consumption for large-scale systems.
引用
收藏
页码:5769 / 5785
页数:17
相关论文
共 50 条
  • [21] Information-theoretic capacity analysis in MIMO distributed antenna systems
    Xiao, L
    Dai, L
    Zhuang, HR
    Zhou, SD
    Yao, Y
    57TH IEEE VEHICULAR TECHNOLOGY CONFERENCE, VTC 2003-SPRING, VOLS 1-4, PROCEEDINGS, 2003, : 779 - 782
  • [22] Information-Theoretic Characterization of MIMO Systems With Multiple Rayleigh Scattering
    Alfano, Giusi
    Chiasserini, Carla-Fabiana
    Nordio, Alessandro
    Zhou, Siyuan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (07) : 5312 - 5325
  • [23] Information-Theoretic Statistical Mechanics without Landauer's Principle
    Parker, Daniel
    BRITISH JOURNAL FOR THE PHILOSOPHY OF SCIENCE, 2011, 62 (04): : 831 - 856
  • [24] Information-Theoretic Tools to Understand Distributed Source Coding in Neuroscience
    Feldman A.K.
    Venkatesh P.
    Weber D.J.
    Grover P.
    IEEE Journal on Selected Areas in Information Theory, 2024, 5 : 1 - 1
  • [25] An Information-Theoretic Cryptanalysis of Network Coding - is Protecting the Code Enough?
    Lima, Luisa
    Vilela, Joao P.
    Barros, Joao
    Medard, Muriel
    2008 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, VOLS 1-3, 2008, : 262 - +
  • [26] On generalized entropies and information-theoretic Bell inequalities under decoherence
    Rastegin, Alexey E.
    ANNALS OF PHYSICS, 2015, 355 : 241 - 257
  • [27] Information-theoretic measure of uncertainty in generalized fuzzy rough sets
    Mi, Ju-Sheng
    Li, Xiu-Min
    Zhao, Hui-Yin
    Feng, Tao
    ROUGH SETS, FUZZY SETS, DATA MINING AND GRANULAR COMPUTING, PROCEEDINGS, 2007, 4482 : 63 - +
  • [28] Information-theoretic aspects of the generalized amplitude-damping channel
    Khatri, Sumeet
    Sharma, Kunal
    Wilde, Mark M.
    PHYSICAL REVIEW A, 2020, 102 (01)
  • [29] Information-Theoretic Security of MIMO Networks Under κ-μ Shadowed Fading Channels
    Vega Sanchez, Jose David
    Moya Osorio, Diana Pamela
    Lopez-Martinez, F. Javier
    Paredes Paredes, Martha Cecilia
    Felipe Urquiza-Aguiar, Luis
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2021, 70 (07) : 6302 - 6318
  • [30] QUANTUM-MECHANICAL HISTORIES AND THE UNCERTAINTY PRINCIPLE - INFORMATION-THEORETIC INEQUALITIES
    HALLIWELL, JJ
    PHYSICAL REVIEW D, 1993, 48 (06) : 2739 - 2752