V-BLAST系统的低复杂度改进裁剪QRD-M算法  

Modified QRD-M Algorithm with Low Complexity in V-BLAST System

作　　者：王新忠[1] 杨昕欣[1] 李连合 

机构地区：[1]北京航空航天大学电子信息工程学院,北京100191 [2]河南财经学校,河南郑州450012

出　　处：《电视技术》2015年第5期97-100,120,共5页Video Engineering

基　　金：国家自然科学基金项目(61371077)

摘　　要：V-BLAST系统中,信号的检测是关键环节,传统的算法难以同时保证较好的系统性能和较低的复杂度。提出一种低复杂度改进的QRD-M算法,算法基于QRD-M树搜索原理,路径扩展仅扩展候选集中的点,同时在每层更新SIC结果并用其度量作为自适应搜索半径,采用SE搜索策略在每层搜索幸存路径以避免不必要节点的访问与排序。性能和复杂度分析表明,所提算法在基本不损失性能的条件下,能有效降低V-BLAST系统的检测复杂度,更易于实现。Detection is the key to V-BLAST system. Traditional algorithm could not achieve high performance with low complexity. In the Paper, A modified low complexity QRD-M algorithm is proposed. The algorithm reduce the complexity of tree searching by restricting the candidates to a set consists of QRD-based detection symbol and its neighboring symbols and branches trimming with adaptive search radius set by SIC result. SE searching strategy is also used to avoid visiting unnecessary branches and ordering operation. Performance and complexity analysis shows that the proposed algorithm can reduce the complexity of the V-BLAST detection system without large loss of performance and could be implemented easily.

关 键 词：V-BLAST QRD-M 搜索半径限制 SE搜索策略 

分 类 号：TN911.3[电子电信—通信与信息系统]