摘要
针对贝尔实验室分层空时架构中串行干扰消除迫零检测复杂度较高的问题,提出了一种低复杂度快速递归算法,并给出该算法的快速实现方案及其复杂度分析。理论分析与仿真结果表明,与快速递归算法(FRA)相比,所提算法具有低复杂度、易于实现和低存储需求等优势,且其误码性能在实际条件下接近最优,因此具有较高的实用性和良好的应用前景。
To reduce the complexity of the zero-forcing （ZF） detection with successive interference cancellation （SIC） in a Vertical Bell Labs layered space-time （V-BLAST） systems, a computationally efficient recursive algorithm was proposed. A fast implementation of the proposed algorithm was developed and its complexity was analyzed in detail. Theoretical analysis and simulations demonstrate significant advantages of the proposed algorithm over the fast recursive algorithm （FRA） on complexity, practicability and storage requirements. Moreover, its performance on symbol error rate （SER） is close to optimal under practical conditions. These advantages make the proposed algorithm more efficient and practical.
出处
《通信学报》
EI
CSCD
北大核心
2012年第7期67-74,共8页
Journal on Communications
基金
国家重点基础研究发展计划("973"计划)基金资助项目(2007CB310606)
国家自然科学基金资助项目(61171180
61001093)~~
关键词
多输入多输出系统
贝尔实验室分层空时架构
迫零检测
串行干扰消除
快速递归算法
计算复杂度
multiple-input multiple-output systems
Vertical Bell Labs layered space-time （V-BLAST） architecture
zero-forcing detection
successive interference cancellation
FRA
computational complexity
