Block Algorithms for the Control of Adaptive Antenna Arrays
Alternativní metriky PlumXhttp://hdl.handle.net/11012/58458
MetadataZobrazit celý záznam
Presented paper deals with the reduction of computational requirements of gradient algorithms for the control of adaptive antenna arrays. Reduction of arithmetical complexity is reached here by the application of a block signal processing to adaptive algorithms. Block versions of the classical Least Mean Square (LMS) algorithm and the Simplified Kalman Filter (SKF) are described in this submission. Adaptation parameters of the presented algorithms are illustrated by results of computer simulations. The block SKF (BSKF) exhibits twice higher computational requirements than LMS, the same misadjustment as LMS and lower rate of convergence than LMS when transversal filters have great number of taps and when relatively high block length of BSKF is used.
Zdrojový dokumentRadioengineering. 1995, vol. 4, č. 3, s. 1-8. ISSN 1210-2512
- 1995/3