论文信息 - Orthogonal weight perturbation algorithms in partially adaptive arrays

Orthogonal weight perturbation algorithms in partially adaptive arrays

Single port adaptive algorithms have been proposed to circumvent the need to implement a separate receiver for each adaptive element in an adpative antenna. In this paper, transient and steady-state performance of a bounded single port perturbation algorithm is obtained and compared with that of the least mean square (LMS) algorithm. Results are developed both with and without a hardlimiter on one input to the correlator. Techniques for adaptively changing both the algorithm step size and perturbation amplitude are given. Simulation results are presented and compared with theoretical results.

D. Farden | R. Davis

[1] B. Widrow,et al. Adaptive antenna systems , 1967 .

[2] I. Reed,et al. Rapid Convergence Rate in Adaptive Arrays , 1974, IEEE Transactions on Aerospace and Electronic Systems.

[3] Bernard Widrow,et al. A comparison of adaptive algorithms based on the methods of steepest descent and random search , 1976 .

[4] S. Applebaum,et al. Adaptive arrays , 1976 .

[5] G. Rassweiler,et al. Adaptive sidelobe nulling using digitally controlled phase-shifters , 1976 .

[6] J. Mallett. Rapid convergence in adaptive arrays , 1976 .

[7] Antonio Cantoni,et al. Application of orthogonal perturbation sequences to adaptive beamforming , 1980 .

[8] D. Farden. Tracking properties of adaptive signal processing algorithms , 1981 .

[9] K. Senne,et al. Performance advantage of complex LMS for controlling narrow-band adaptive arrays , 1981 .

[10] D. Farden. Convergence Properties for a Family of Bounded Fixed Step-Size Algorithms , 1983 .

[11] L. Godara,et al. Analysis of the performance of adaptive beam forming using perturbation sequences , 1983 .

[12] Quantization Noise in Adaptive Weighting Networks , 1984, IEEE Transactions on Aerospace and Electronic Systems.