摘要
提出一种多入多出(MIMO)系统空间复用模式下的低复杂度序列高斯逼近(LC-SGA)算法。该算法把序列高斯逼近(SGA)算法在复数域进行路径搜索的问题近似为实数域的搜索问题,从而降低了计算复杂度。仿真结果表明,LC-SGA算法在相同搜索路径数的情况下,其误比特率(BER)性能与传统的SGA算法相当,且当搜索路径数较大时接近最大似然检测的性能。
A Low-Complexity Sequential Gaussian Approximation （LC-SGA） algorithm is proposed for spatial multiplexing scheme in Multiple-Input Multiple-Output systems. Compared with the traditional Sequential Gaussian Approximation （SGA） algorithm, LC-SGA converts a breadth-first tree search from the complex field to the real field, which shrinks the searching space and thus reduces the algorithm＇ s complexity. Simulation results show that the Bit Error Rate（BER） performance of both LC-SGA and SGA is similar when the number of searching paths is same and can approximate to maximum likelihood detector when the path number is large enough.
出处
《计算机工程与应用》
CSCD
2013年第12期210-213,共4页
Computer Engineering and Applications
基金
国家科技支撑计划重点项目(No.2011BAH11B01)
关键词
低复杂度
序列高斯逼近
多入多出
空间复用
low complexity
Sequential Gaussian Approximation（SGA）
Multiple-Input Multiple-Output（MIMO）
SpatialMultiplexing （SM）
