摘要
对采用排序串行干扰抵消(OSIC)检测的V-BLAST系统,提出了一种新的的天线子集选择算法。考虑到OSIC检测中排序和干扰抵消产生的影响,通过置换序列和QR分解,给出了一个非常简洁的且具有合理复杂度的V-BLAST系统的天线子集选择表达式。仿真结果表明该算法的中断容量曲线接近基于容量最大的最优算法,在性能上优于已有的几种天线子集选择算法。
A novel antenna subset selection in V-BLAST systems with ordered successive interference cancellation (OSIC) detection was presented. With an eye to the impacts of ordering and cancellation, by use of permutation and QR decomposition, a terse antenna subset selection mathematic expression with reasonable complexity for V-BLAST was put forward. Simulation results show that the proposed selection criterion achieves near-optimal outage capacity and outperforms several existing ones in performance.
出处
《通信学报》
EI
CSCD
北大核心
2006年第9期21-26,33,共7页
Journal on Communications
基金
国家自然科学基金资助项目(60496310)
国家高技术研究发展计划("863"计划)基金资助项目(2003AA12331005)~~