GS正交算法中正交化次数的自动确定
AN AUTOMATIC DETECTION APPROACH FOR GS ORTHOGONALIZATION
-
摘要: Gram-Schmidt(Gs)正交算法在自适应抗干扰领域日渐被人们所关注,特别是作为一种快速自适应波束形成算法而倍受重视。但采用这种算法需要首先确定信号源的个数,以决定正交化运算的次数。本文正是对此问题进行研究,提出一种简单的方法并利用一个判断阈值来实现在GS正交化过程中自动确定正交化运算的次数。Abstract: Gram-schmidt algorithm is an interesting theme in the field of adaptive beamformer as a fast algorithm. However, a key problem associated with this algorithm is the detection of orthogonalisation on the basis of prior-knowledge of interferences dimension. In this paper, a simple and fast approach is proposed to detect the orthogonalisation automatically in the procedure of GS orthogonal decomposition. Finally, computer simulations are presented.
-
Widrow B. Adaptive filters. in[2]Kalman R E. Declaris N, eds. Aspects of Networks and System Theory. New York: Holt, Rinehard and Winston, 1971.[3]Howells P W. Intermediate Frequency Sidelobe Canceller, US Parent 3,202,990.Aug. 1965.[4][3][5]Applebaum S P. Adaptive Arrays, Syracuse Uni. Res. Corp., Rep. SPL TR66-1, Aug. 1966.[6]Hung E K L, Turner R M. A fast-beamforming algorithm for large arrays, IEEE Trans. on AES, 1983, AES-19(4):598-606.[7]葛利嘉.SVD及其空间谱估计算法的高速数学信号处理器实现:[硕士论文].电子科技大学,1991.3. -
计量
- 文章访问数: 1951
- HTML全文浏览量: 115
- PDF下载量: 366
- 被引次数: 0
下载:
