摘要
分层空时码是一类具有可执行解码复杂度的空时编码技术,最大似然检测在误比特率最小的意义下是最优的接收,但是其复杂度不可实现。在D.Wubben提出的基于Gram-Schmidt正交化排序QR分解检测算法的基础上,提出了另外2种可以排序的QR分解检测算法,取得了和基于Gram-Schmidt正交化QR分解算法相同的性能。与V-BLAST算法相比,避免了多次矩阵求逆的计算,以很小的性能损失为代价,降低了复杂度。
Layered space-time codes is a kind of space time coding techniques that has practical decoding complexity. Although maximum likelihood detection is optimal in the sense of minimizing bit error rate, it is impractical due to high complexity. In this paper, two sorted QR decomposition detection algorithms based on householder transform and givens rotation transform are proposed. The results show that the proposed algorithms achieve the same performance as the sorted QR decomposition algorithm based on Gram- Schimidt transform proposed by D. Wubben. They avoid matrix inversion operation, reduce complexity and have little performance loss compared with V- BLAST interference cancellation algorithm.
出处
《无线电工程》
2006年第12期26-29,共4页
Radio Engineering
基金
863项目:B3G-TDD迭代接收机设计(2001AA123016)
关键词
分层空时码
MIMO
检测算法
QR分解
layered space-time code
MIMO detection algorithm
QR decomposition
