Zeqiong Tan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zeqiong Tan has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Chuan Zhang
LEADS, the National Mobile Communications Research Laboratory, and the Frontiers Science Center for Mobile Information Communication and Security, Southeast University, Nanjing, China
5 shared publications - Wenyue Zhou
LEADS, the National Mobile Communications Research Laboratory, and the Frontiers Science Center for Mobile Information Communication and Security, Southeast University, Nanjing, China
5 shared publications - Yongming Huang
National Mobile Communications Research Laboratory, Southeast University, Nanjing, China
5 shared publications - Xiaohu You
Southeast University
3 shared publications - Xiaosi Tan
LEADS, the National Mobile Communications Research Laboratory, and the Frontiers Science Center for Mobile Information Communication and Security, Southeast University, Nanjing, China
3 shared publications Kefan Wang
LEADS the National Mobile Communications Research Laboratory, and the Frontiers Science Center for Mobile Information Communication and Security, Southeast University, Nanjing, China
2 shared publications
Latest Publications
- 19 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25 (15361276) , 12309-12324
FCBsP: Fixed-Constellation Belief-Selective Propagation Detection for MIMO Turbo Receivers
The belief-selective propagation (BsP) algorithm has recently emerged as a promising approach for massive MIMO detection. However, when applied in MIMO turbo receivers, known for their superior performance compared to separated detection and decoding (SDD) receivers, the BsP-based receiver suffers from significant performance degradation and high processing latency. To overcome these limitations, this paper proposes a fixed-constellation BsP (FCBsP) detector tailored for MIMO turbo receivers. By building fixed configuration sets and utilizing the approximate multi-user interference for message updates, the proposed FCBsP detector achieves a better trade-off between error performance and computational complexity compared to the BsP. Furthermore, two unexplored features: information compensation and decoding-first mechanism are proposed to fine-tune the exchanged information and lower the processing latency of the FCBsP-based turbo receiver. Numerical results demonstrate that the proposed FCBsP-based turbo receiver earns about 0.7 and 1.8 dB performance gains over the BsP-based turbo receiver at BLER=10−3 in an LDPC-coded 32 × 12 64-QAM MIMO system under Rayleigh and practical channels, respectively.
- 19 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25 (15361276) , 12309-12324
FCBsP: Fixed-Constellation Belief-Selective Propagation Detection for MIMO Turbo Receivers
The belief-selective propagation (BsP) algorithm has recently emerged as a promising approach for massive MIMO detection. However, when applied in MIMO turbo receivers, known for their superior performance compared to separated detection and decoding (SDD) receivers, the BsP-based receiver suffers from significant performance degradation and high processing latency. To overcome these limitations, this paper proposes a fixed-constellation BsP (FCBsP) detector tailored for MIMO turbo receivers. By building fixed configuration sets and utilizing the approximate multi-user interference for message updates, the proposed FCBsP detector achieves a better trade-off between error performance and computational complexity compared to the BsP. Furthermore, two unexplored features: information compensation and decoding-first mechanism are proposed to fine-tune the exchanged information and lower the processing latency of the FCBsP-based turbo receiver. Numerical results demonstrate that the proposed FCBsP-based turbo receiver earns about 0.7 and 1.8 dB performance gains over the BsP-based turbo receiver at BLER=10−3 in an LDPC-coded 32 × 12 64-QAM MIMO system under Rayleigh and practical channels, respectively.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74, 13672-13686
WeFTNet: DNN-Aided Weighted Fourier Transform Approximate MMSE Detection for Massive MIMO
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74, 13672-13686
WeFTNet: DNN-Aided Weighted Fourier Transform Approximate MMSE Detection for Massive MIMO
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15, 4981-4985
Robust Beamforming Design for Cell-Free MIMO ISAC Systems With Imperfect CSI
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15, 4981-4985
Robust Beamforming Design for Cell-Free MIMO ISAC Systems With Imperfect CSI
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15, 4996-5000
LR-BsP: Lattice Reduction-Aided Belief-Selective Propagation for Correlated MIMO Detection
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15, 4996-5000
LR-BsP: Lattice Reduction-Aided Belief-Selective Propagation for Correlated MIMO Detection
- 23 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15 (21622337) , 176-180
BsP-SIC: Belief-Selective Propagation-Aided SIC Detection for MIMO Systems
Tree-search detection such as K-best can achieve robust near-optimal performance but faces cubic complexity, limiting its application for massive MIMO scenarios. As the most simplified tree-search detection, successive interference cancellation (SIC) offers very low complexity but sacrifices performance benefits. To this end, we propose a belief-selective propagation-aided SIC (BsP-SIC) detector in this letter, which leverages the recently developed BsP algorithm to iteratively refine the SIC results. Two unexplored features: forward soft-SIC and backward layered-BsP are utilized to enhance performance without incurring excessive complexity. Numerical results demonstrate that the proposed BsP-SIC can achieve up to 1.5 dB performance gains over the traditional SIC detection at the bit error rate (BER) of 10-3. Furthermore, compared to its message-passing counterparts, the BsP-SIC reduces 74%~90% complexity for $128\times 64$ massive MIMO systems with 256-QAM.
- 23 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15 (21622337) , 176-180
BsP-SIC: Belief-Selective Propagation-Aided SIC Detection for MIMO Systems
Tree-search detection such as K-best can achieve robust near-optimal performance but faces cubic complexity, limiting its application for massive MIMO scenarios. As the most simplified tree-search detection, successive interference cancellation (SIC) offers very low complexity but sacrifices performance benefits. To this end, we propose a belief-selective propagation-aided SIC (BsP-SIC) detector in this letter, which leverages the recently developed BsP algorithm to iteratively refine the SIC results. Two unexplored features: forward soft-SIC and backward layered-BsP are utilized to enhance performance without incurring excessive complexity. Numerical results demonstrate that the proposed BsP-SIC can achieve up to 1.5 dB performance gains over the traditional SIC detection at the bit error rate (BER) of 10-3. Furthermore, compared to its message-passing counterparts, the BsP-SIC reduces 74%~90% complexity for $128\times 64$ massive MIMO systems with 256-QAM.