Asymptotic properties of an adaptive beam former algorithm

DOI10.1109/18.32162MaRDI QIDQ4204089zbMATH OpenOpenAlexFDO

Authors G. Yin

Publication date 1989

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.32162

zbMATH Keywords

decreasing gainGauss-Markov diffusion processrecursive adaptive beam former algorithm

Mathematics Subject Classification ID

Adaptive control/observation systems (93C40) Filtering in stochastic control theory (93E11)

Recommendations

• An algorithm with randomly varying truncation for adaptive beam-formers
• An approximate algorithm for robust adaptive beamforming
• Analysis of a linearly constrained least squares algorithm for adaptive beamforming
• Robust Adaptive Beamforming Based on Conjugate Gradient Algorithms
• Robust broadband adaptive beamforming using convex optimization
• A class of adaptive cyclostationary beamforming algorithms
• Adaptive beam forming algorithm with the near-field nulling weight
• A Robust Adaptive Beamformer Based on Worst-Case Semi-Definite Programming
• Shrinkage Linear and Widely Linear Complex-Valued Least Mean Squares Algorithms for Adaptive Beamforming

Cited in

(2)

• Asymptotic Properties of Nonlinear Weighted Least Squares in Radar Array Processing
• Sequences of random matrices modulated by a discrete-time Markov chain*

This page was built for publication: Asymptotic properties of an adaptive beam former algorithm

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