Please use this identifier to cite or link to this item:
|Title:||Broadband linearly constrained adaptive array processing with a preprocessed Gram-Schmidt algorithm|
|Citation:||Ko, C.C. (1991-04). Broadband linearly constrained adaptive array processing with a preprocessed Gram-Schmidt algorithm. Signal Processing 23 (1) : 15-25. ScholarBank@NUS Repository.|
|Abstract:||This paper presents and investigates a new preprocessed Gram-Schmidt algorithm for broadband linearly constrained arrays using tapped delay line processing. It is proposed that before the conventional Gram-Schmidt scheme is employed to reject unwanted interferences, the element signals should first be transformed by using a simple preprocessor to satisfy the look direction constraint and to reduce the correlation due to finite bandwidth effects. With this preprocessing, the implementation complexity of the algorithm is reduced by a factor equal to the number of taps behind each array element. Furthermore, due to this size reduction, the new algorithm also becomes faster in its convergence behaviour. © 1991.|
|Source Title:||Signal Processing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 24, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.