GS正交算法中正交化次數(shù)的自動確定
AN AUTOMATIC DETECTION APPROACH FOR GS ORTHOGONALIZATION
-
摘要: Gram-Schmidt(Gs)正交算法在自適應抗干擾領域日漸被人們所關注,特別是作為一種快速自適應波束形成算法而倍受重視。但采用這種算法需要首先確定信號源的個數(shù),以決定正交化運算的次數(shù)。本文正是對此問題進行研究,提出一種簡單的方法并利用一個判斷閾值來實現(xiàn)在GS正交化過程中自動確定正交化運算的次數(shù)。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及其空間譜估計算法的高速數(shù)學信號處理器實現(xiàn):[碩士論文].電子科技大學,1991.3. -
計量
- 文章訪問數(shù): 1975
- HTML全文瀏覽量: 121
- PDF下載量: 366
- 被引次數(shù): 0
下載:
