Cart (Loading....) | Create Account
Close category search window
 

Maximum likelihood parameter estimation of multiple chirp signals by a new Markov chain Monte Carlo approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lin, Y. ; Dept. of Electron. Eng., Tsinghua Univ., Beijing, China ; Yingning Peng ; Xiutan Wang

In this paper, a novel method for estimating the parameters of multiple chirp signals in additive Gaussian white noise is proposed. The method combines a global optimization theorem with a new Markov chain Monte Carlo algorithm, called the simulated annealing one-variable-at-a-time random walk Metropolis-Hastings algorithm. It is a computationally modest implementation of maximum likelihood estimation and has no error propagation effect. Simulation results show that the proposed method can give good estimates for the unknown parameters, even when the parameters of the individual chirp signals are closely spaced and the Cramer-Rao lower bound can be attained even at low signal-to-noise ratio.

Published in:

Radar Conference, 2004. Proceedings of the IEEE

Date of Conference:

26-29 April 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.