标准球形译码算法在发射相关MIMO信道下的平均复杂度分析  

The Expected Complexity of Standard Sphere Decoding Algorithm in Transmit Correlated MIMO Channels

作　　者：蓝兴[1] 张颖光[1] 魏急波[1] 

机构地区：[1]国防科技大学电子科学与工程学院,湖南长沙410073

出　　处：《信号处理》2008年第5期876-880,共5页Journal of Signal Processing

摘　　要：球形译码算法作为实现MIMO系统最大似然检测的一种有效方法,受到广泛重视。目前,几乎所有对球形译码算法的研究,均是基于假设信道衰落系数完全统计独立并且同分布,而在实际环境下,天线之间通常存在相关性,这样会使球形译码算法的复杂度发生变化。本文针对标准的球形译码算法,对其在发射相关MIMO信道下的复杂度进行了数学分析,推导了平均复杂度的数学表达式,并利用计算机仿真,比较了在不同的信噪比和不同的发射天线数下,发射相关性强弱对算法复杂度的影响。The sphere decoding （SD） algorithm is widely considered to be an efficient approach to obtain maximum likelihood （ML） performance in MIMO detection. Almost all of the research about the SD algorithm is based on the assumption of independent and identically distributed channel coefficients. However, the channel coefficients are often correlated in practice, which change the complexity of the SD algorithm. In this paper,we study the standard SD algorithm in transmit correlated MIMO channels;the exact expression of the expected complexity is derived. Simulations show the effect of transmit correlation on the complexity of the algorithm, for different signal to noise ratios （SNR） and numbers of antennas.

关 键 词：球形译码 平均复杂度 发射相关MIMO信道 

分 类 号：TN92[电子电信—通信与信息系统] TP391.41[电子电信—信息与通信工程]