摘要
在瑞利信道环境下V BLAST系统的容量远远高于单天线系统 .这是近年来V BLAST系统成为研究热点的原因 .针对如何实现这种高容量的V BLAST系统 ,人们提出了多种解决方法 .但由于有大量的求伪逆 ,迫零和排序计算 ,使得复杂度很高以至于难以实现 .本文从一个全新的角度来解决V BLAST的译码问题 .文中所提出的方案是基于Greville递归求伪逆算法 .利用Greville算法中的递归特性 ,将迫零向量的获取融合在求伪逆的过程中 .仿真结果表明 ,本文的算法可以达到接近Golden算法的性能 。
The theoretic capacity of V-BLAST systems is shown to be significantly higher than that of single antenna systems in Rayleigh fading channel, which is why research on V-BLAST systems is a hotspot recently. In an attempt to realize V-BIAST systems, a lot of V-BLAST detection algorithms are put forward. However, the complexity of these algorithms is quite high due to many pseudoinversing, mulling and ordering operations, which limit the implementation of V-BLAST in practical system. Aiming at this, new sub-optimal detection algorithms are proposed here from an entirely fresh point of view. These algorithms take the advantages of Greville's recursive property and obtain all the nulling vectors during the procedure of getting the pseudoinverse of the channel matrix. Simulation results show that these algorithms have good performance with much lower computational complexity.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2003年第5期703-706,共4页
Acta Electronica Sinica
基金
SiemensAG
十五 863项目 (No 2 0 0 1AA1 2 30 1 6)
关键词
MIM0
空时码
分层空时码
BLAST
Algorithms
Antenna arrays
Communication channels (information theory)
Computational complexity
Computer simulation
Mathematical models
Matrix algebra
Optimization
