Please use this identifier to cite or link to this item:
|Title:||Simplified Gram-Schmidt preprocessor for broadband tapped delay-line adaptive array||Authors:||Ko, C.C.||Issue Date:||Jun-1989||Citation:||Ko, C.C. (1989-06). Simplified Gram-Schmidt preprocessor for broadband tapped delay-line adaptive array. IEE proceedings. Part G. Electronic circuits and systems 136 (3) : 141-149. ScholarBank@NUS Repository.||Abstract:||This paper derives a simplified Gram-Schmidt preprocessor for decorrelating the signals in a broadband tapped delay-line adaptive array. After studying the structure of the covariance matrix at a small bandwidth, a two-stage preprocessing structure is proposed. The first stage of preprocessing is independent of the external noise environment, and thus can be designed a priori and easily implemented. The second stage of preprocessing employs a normal Gram-Schmidt preprocessor whose order is only 2M for an M-element L-tap array with ML array signals. Thus, in terms of the number of 2-input adaptive decorrelators needed, the simplified preprocessor is less complex than using the Gram-Schmidt procedure directly by a factor of about (L/2)2. It will converge faster by a factor of roughly L/2. Although the simplified preprocessor is derived assuming a small bandwidth, simulation results show that it is effective up to bandwidths of the order of 10%.||Source Title:||IEE proceedings. Part G. Electronic circuits and systems||URI:||http://scholarbank.nus.edu.sg/handle/10635/81169||ISSN:||01437089|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 28, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.