STBC-VBLAST的QRD-M检测  

QRD-M Detector for STBC-VBLAST

作　　者：鉴海防[1] 胡东伟[2] 肖宛昂[1] 石寅[1] 

机构地区：[1]中国科学院半导体研究所,北京海淀区100083 [2]中国科学院微电子研究所,北京海淀区100029

出　　处：《电子科技大学学报》2010年第6期940-943,共4页Journal of University of Electronic Science and Technology of China

基　　金：江苏省科技成果转化专项资金(BA2006076)

摘　　要：提出一种针对IEEE802.11n中STBC-VBLAST结构的新型QRD-M检测算法,在存活路径拣选过程中,根据接收信号估计值确定备选节点的有限搜索范围,在16-QAM和64-QAM调制下,比常规算法分别减少约70%和90%的运算量,大大降低了VBLAST-STBC数据检测的复杂度,适合于VLSI硬件实现。仿真结果表明,该算法在性能上非常接近于传统QRD-M算法,能够在复杂度和检测性能之间实现折中。A simplified QRD-M algorithm for the IEEE 802.11n STBC-VBLAST is proposed. In order to carry out a limited tree search, each surviving path is expanded only to its partial branches according to the estimation of the symbol to be detected. The proposed scheme can reduce 70% and 90% fundamental operations for 16-QAM and 64-QAM respectively. So the computational complexity is reduced significantly and is more attractive to the VLSI implementation. Simulation results prove that the proposed scheme can achieve a performance very close to the conventional QRD-M algorithm, and yield a tradeoff between the complexity and performance.

关 键 词：检测器 IEEE802.11N 多入多出 QRD-M 空时分组码-垂直贝尔实验室分层空时码 

分 类 号：TN47[电子电信—微电子学与固体电子学]