高效的V-BLAST迭代算法

理论和实践研究表明贝尔实验室垂直分层空时码(V-BLAST)可显著提高多天线系统的传输容量。传统的V-BLAST译码算法是排序连续干扰抵消算法(OSIC),然而由于数据层间误码传播的影响，OSIC并不能有效地提高整个系统的分集增益。利用最近提出的迭代V-BLAST译码算法，低分集增益数据层通过高分集增益数据层的判决反馈来迭代检测，整个系统的性能得到提高。但这种算法的迭代次数高，迭代的次数与MIMO系统中发射天线的数量相等。为了减少系统实现的复杂性，提出了一种3次迭代的V-BLAST译码算法。仿真结果证明在对称系统中(接收天线和发射天线数相等),新算法与迭代V-BLAST译码算法有几乎相同的性能，但由于其所需的迭代此数少，所以算法复杂性也小。

Efficient Iterative Detection Algorithm for V-BLAST

The vertical layered space-time(V-BLAST) of Bell laboratories based on a multiple transmitting and receiving antenna system(MIMO) highly improves the system capacity.Traditional detection algorithm for V-BLAST is based on order successive interference cancellation(OSIC) algorithm,which greatly constraints the overall system performance caused by the error propagation resulting from the low-diversity substreams.Although the performance can be greatly improved by the algorithm in which low-diversity substreams are iteratively decoded by using decisions from high-diversity substreams,the number of iterative detection is still too much,equal to the number of the transmitting antennas.To reduce the complexity,a three loops of iterative detection algorithm is proposed.For a symmetric system with equal number of transmitting and receiving antennas,simulation results show that there is a similar performance comparing with the traditional OSIC algorithm.However,since the number of iterative detection of the new algorithm is not very large,the complexity of the new algorithm is acceptable.