首页 /研究 /Near-Optimal Low-Complexity MIMO Detection via Structured Reduced-Search Enumeration
OTHER

Near-Optimal Low-Complexity MIMO Detection via Structured Reduced-Search Enumeration

Logeshwaran Vijayan

发表年份
2026
访问权限
开放获取

摘要

Maximum-likelihood (ML) detection in high-order MIMO systems is computationally prohibitive due to exponential complexity in the number of transmit layers and constellation size. In this white paper, we demonstrate that for practical MIMO dimensions (up to 8x8) and modulation orders, near-ML hard-decision performance can be achieved using a structured reduced-search strategy with complexity linear in constellation size. Extensive simulations over i.i.d. Rayleigh fading channels show that list sizes of 3|X| for 3x3, 4|X| for 4x4, and 8|X| for 8x8 systems closely match full ML performance, even under high channel condition numbers, |X| being the constellation size. In addition, we provide a trellis based interpretation of the method. We further discuss implications for soft LLR generation and FEC interaction.

关键词

eess.SPeess.SY

相关论文

查看 OTHER 分类全部论文