TrellisBsP: Trellis-Based Belief-Selective Propagation for MIMO Detection

作     者：Tan, Zeqiong Zhou, Wenyue Huang, Yongming Zhang, Chuan You, Xiaohu 

作者机构：Southeast Univ Natl Mobile Commun Res Lab LEADS Nanjing 211189 Peoples R China Southeast Univ Frontiers Sci Ctr Mobile Informat Commun & Secur Nanjing 211189 Peoples R China Purple Mt Labs Nanjing 211100 Peoples R China 

出 版 物：《IEEE WIRELESS COMMUNICATIONS LETTERS》 (IEEE Wireless Commun. Lett.)

年 卷 期：2025年第14卷第4期

页      面：939-943页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：NSFC [62122020, 62331009] Jiangsu Provincial NSF [BG2024004, BM2023016] Fundamental Research Funds for the Central Universities 

主　　题：Symbols Hardware Detectors Vectors Reliability Computational complexity Detection algorithms Decoding Buildings Uplink Multiple-input multiple-output (MIMO) detection belief-selective propagation (BsP) trellis representation pathfinding strategy 

摘      要：Compared to its linear counterparts, the belief propagation (BP) MIMO detector achieves better performance in challenging MIMO scenarios. For practical applications, the recently emerged belief-selective propagation (BsP) detector mitigates the error floor issue and reduces the complexity. However, it still suffers from intractable complexity for high-order MIMO scenarios, and the serial message-updating mechanism limits its hardware feasibility. In this letter, a trellis-based BsP (TrellisBsP) detection algorithm is proposed. Two unexplored approaches: trellis representation and pathfinding strategy are utilized to enable parallel message-updating while achieving complexity reduction. Benchmarking with the BsP detection, the proposed TrellisBsP saves up to 72.76% complexity in an 8 x 4, 256-QAM MIMO system without error performance penalty. In addition, the proposed TrellisBsP has great potential in hardware implementation due to its parallel message-updating mechanism.