全自适应阵列中的逆QR分解算法

An Inverse QR Decomposition Algorithm for Full Adaptive Array 

提出了一种在全自适应阵列中的逆ＱＲ分解算法，给出了它的Ｓｙｓｒｏｌｉｃ实现方法。该算法可以很容易地映射到Ｓｙｓｔｏｌｉｃ结构上，仅需一个Ｓｙｓｔｏｌｉｃ阵便能得到最佳权矢量。并且同ＱＲ分解算法一样，它是直接对数据矩阵进行处理，且变换采用酉阵。

QR decomposition LS algorithm (QRD) is a widely used algorithm for adaptive arrays recently,which has good numerical stability and can be easily mapped to Systolic structure for parallel processing.However,for full adaptive array where optimal weights are needed,this method typically requries three Systolic modulars to produce optimal weight.This paper presents a new method to solve the nulling problem of a full adaptive array using inverse QR decomposition LS algorithm (IQRD) and its Systolic implementation.It can easily obtain optimal weight vector using only one Systolic array.Since it still directly deals with the input data matrix and is based on unitary transformation,the IQRD algorithm has the same numerical stability as that of the QRD algorithm. Beacuse QR Decomposition LS Algorithm (QRD) has good numerical stability .which is widely used in adaptive array processing,it typically needs three Systolic modulars for a full adaptive array.The inverse QR Decomposition (IQRD) can obtain the optimal weight vector by one Systolic modular.The idea of IQRD was first presented by C.T.Pan et.al .Alexander et.al. applied it to a time domain adaptive filter.This paper applies the idea to space domain processing,presents a new IQRD algorithm for a full adaptive array,and derives the recursive equation for the algorithm using multiple complex variable.