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 条
  • [41] An Information-Theoretic Approach for Removing Feedback Channels in Distributed Video Coding
    Yaacoub, Charles
    Farah, Joumana
    2009 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTATIONAL TOOLS FOR ENGINEERING APPLICATIONS, 2009, : 362 - 368
  • [42] An Information-Theoretic Analysis of Dirty Paper Coding for Informed Audio Watermarking
    Abrardo, Andrea
    Barni, Mauro
    Gorrieri, Andrea
    Ferrari, Gianluigi
    2014 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA), 2014, : 40 - 45
  • [43] Neuroanalysis.Org: Information-Theoretic and Extended Analyses of Neural Coding
    Repucci, Michael A.
    Goldberg, David H.
    Chan, Eliza
    Jagdale, Ajit
    Victor, Jonathan D.
    Gardner, Daniel
    BIOPHYSICAL JOURNAL, 2010, 98 (03) : 141A - 141A
  • [44] Information-theoretic optimality of observation-driven time series models for continuous responses
    Blasques, F.
    Koopman, S. J.
    Lucas, A.
    BIOMETRIKA, 2015, 102 (02) : 325 - 343
  • [45] Information-Theoretic Generalized Orthogonal Matching Pursuit for Robust Pattern Classification
    Wang, Yulong
    Tang, Yuan Yan
    Zou, Cuiming
    Yang, Lina
    2017 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2017, : 501 - 506
  • [46] Generalized Information-Theoretic Criterion for Multi-Label Feature Selection
    Seo, Wangduk
    Kim, Dae-Won
    Lee, Jaesung
    IEEE ACCESS, 2019, 7 (122854-122863) : 122854 - 122863
  • [48] An information-theoretic on-line update principle for perception-action coupling
    Peng, Zhen
    Genewein, Tim
    Leibfried, Felix
    Braun, Daniel A.
    2017 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2017, : 789 - 796
  • [49] Information-theoretic memory scaling in the many-body localization transition
    Nico-Katz, Alexander
    Bayat, Abolfazl
    Bose, Sougato
    PHYSICAL REVIEW B, 2022, 105 (20)
  • [50] Information-Theoretic Properties of Auditory Sequences Dynamically Influence Expectation and Memory
    Agres, Kat
    Abdallah, Samer
    Pearce, Marcus
    COGNITIVE SCIENCE, 2018, 42 (01) : 43 - 76