A new algorithm for constrained adaptive array processing

From MaRDI portal





The approach proposed in this work is motivated by the recent developments in parallel stochastic approximation. A new algorithm for linearly constrained adaptive array processing is developed as an extension and generalization of the well-known adaptive filter algorithm with constraints or the adaptive beamformer algorithm. The essence of the approach is to improve the efficiency by utilizing a number of processors updating the same array element and introducing a delay in the update for each individual processor. At first, the new approach is described next together with its modified version --- the delayed algorithm with randomly varying truncation bounds. Under the assumption of non- stationary and correlated signals, the boundedness and almost sure convergence of the algorithm is proved. The convergence analysis is presented in the work. The authors indicate that some simulation results of the algorithm with time delays and numerical experiments of the optimal design problem for the adaptive array processing will appear elsewhere.











This page was built for publication: A new algorithm for constrained adaptive array processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974128)