DOA Estimation using fast EM and SAGE Algorithms

Authors:
Pei Jung Chung;Johann F. Böhme
Affiliations:
Department of Electrical Engineering and Information Science, Ruhr-Universität Bochum, 44780 Bochum, Germany;Department of Electrical Engineering and Information Science, Ruhr-Universität Bochum, 44780 Bochum, Germany
Venue:
Signal Processing - Image and Video Coding beyond Standards
Year:
2002

Citing 5
Cited 6

Matrix analysis

Matrix analysis
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Maximum-likelihood array processing in non-Gaussian noise with Gaussian mixtures

IEEE Transactions on Signal Processing
Comparative convergence analysis of EM and SAGE algorithms in DOAestimation

IEEE Transactions on Signal Processing
Wideband maximum likelihood direction finding and signal parameterestimation by using the tree-structured EM algorithm

IEEE Transactions on Signal Processing

Maximum likelihood DOA estimation of multiple wideband sources in the presence of nonuniform sensor noise

EURASIP Journal on Advances in Signal Processing
Maximum likelihood DOA estimation in distributed wireless sensor network using adaptive particle swarm optimization

Proceedings of the 2011 International Conference on Communication, Computing & Security
Multipath channel identification by using global optimization in ambiguity function domain

Signal Processing
Application of natural computing algorithms to maximum likelihood estimation of direction of arrival

Signal Processing
Cross-ambiguity function domain multipath channel parameter estimation

Digital Signal Processing
Maximum likelihood estimation of DOD and DOA for bistatic MIMO radar

Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we study direction of arrival estimation using expectation-maximization (EM) and space alternating generalized EM (SAGE) algorithms. The EM algorithm is a general and popular numerical method for finding maximum-likelihood estimates which is characterized by simple implementation and stable convergence. The SAGE algorithm, a generalized form of the EM algorithm, allows a more flexible optimization scheme and sometimes converges faster than the EM algorithm. Motivated by the componentwise convergence of the EM and SAGE algorithms, we suggest to use smaller search spaces after a few iterations. In this way, the overall computational costs can be reduced drastically. A procedure derived from the convergence properties of the EM and SAGE algorithms is proposed to determine the search spaces adaptively. By numerical experiments we demonstrate that the fast EM and the fast SAGE algorithms are computationally more efficient and have the same statistical performance as the original algorithms.