一种基于Householder变换的递归QRD—LS算法  

A Recursive QRD-LS Algorithm Based on Householder Transformation

作　　者：胡冰新[1] 董玮 于全 

机构地区：[1]解放军理工大学理学院,南京210007 [2]中国电子设备系统工程公司,北京100039

出　　处：《信号处理》2006年第1期53-56,共4页Journal of Signal Processing

基　　金：国防科技重点实验室基金项目51434010101JB0201

摘　　要：本文提出了一种采用Householder变换实现的递归QRD-LS算法,该算法通过采用Householder变换取代Giv- ens旋转递归实现复矩阵的QR分解来求解LS问题,可以获得比基于Givens旋转的QRD—LS算法更快的处理速度。此外, 算法引入了复数QR分解,解决了算法只能处理实数信号的问题。通过定义新的数据矩阵,算法还可以合并求解数据域正规方程中的系数矩阵和右侧向量,从而提高了计算效率。通过对其在智能天线中的应用进行仿真,验证了算法的性能。A complex QRD - LS algorithm based on Householder transformation is devised. By substituting conventional Givens rotation with Householder transformation significantly faster speed can be obtained. Moreover, it can solve the LS problem effectively in complex signal scenarios, to which the real QR decomposition approach cannot be applied directly. Using complex QR decomposition and Householder transformation, the algorithm can be recursively implemented. By defining a new data matrix the coefficient matrix and the dexter item of the data domain normal equation can be determined jointly, thus higher computing efficiency can be attained. Simulation results in smart antenna systems are provided and the performance of QRD - LS algorithm is demonstrated.

关 键 词：复数QR分解 Householder变换 Givens旋转 最小_乘 智能天线 

分 类 号：O241.6[理学—计算数学] O223[理学—数学]