检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京邮电大学,北京100876
出 处:《无线电工程》2006年第12期26-29,共4页Radio Engineering
基 金:863项目:B3G-TDD迭代接收机设计(2001AA123016)
摘 要:分层空时码是一类具有可执行解码复杂度的空时编码技术,最大似然检测在误比特率最小的意义下是最优的接收,但是其复杂度不可实现。在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.
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.26