Please use this identifier to cite or link to this item:
Title: On the performance of adaptive Gram-Schmidt algorithm for interference cancelling arrays
Authors: Ko, C.C. 
Issue Date: Apr-1991
Citation: Ko, C.C. (1991-04). On the performance of adaptive Gram-Schmidt algorithm for interference cancelling arrays. IEEE Transactions on Antennas and Propagation 39 (4) : 505-511. ScholarBank@NUS Repository.
Abstract: A detailed performance analysis of the least mean square (LMS) algorithm to update each stage of an adaptive Gram-Schmidt processor in interference canceling adaptive arrays is presented. It is shown that although the number of adaptive weights in the processor is proportional to M2, the total misadjustment contributed by weight jittering is proportional to only M, where M is the size of the processor. In absolute terms, the weight jittering noises do not accumulate as would be expected, but cancel one another out and decrease in magnitude as the optimal powers become smaller from one processing stage to the next. For optimal performance, the feedback factors used in the individual LMS loops should be normalized so that the amount of misadjustment contributed and the convergence time constant are the same for all processing stages. All the weights belonging to one processing stage must be adjusted in a synchronous manner with the same input vector. This synchronous updating requirement is essential for the cancellation of the jittering noises, although in situations where the weights are adaptively updated in a time-multiplexed manner to reduce computational requirements, it may appear more efficient to update each weight based on the most current inputs.
Source Title: IEEE Transactions on Antennas and Propagation
ISSN: 0018926X
DOI: 10.1109/8.81464
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Jan 23, 2023


checked on Jan 23, 2023

Page view(s)

checked on Jan 26, 2023

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.