Empirical investigation of iterative maximum-entropy spectral estimation of one-dimensional random processes

Yuen-Pin Yeap; E. David Jansing; Aly A. Farag

doi:10.1117/12.138282

16 September 1992 Empirical investigation of iterative maximum-entropy spectral estimation of one-dimensional random processes

Yuen-Pin Yeap, E. David Jansing, Aly A. Farag

Author Affiliations +

Proceedings Volume 1700, Automatic Object Recognition II; (1992) https://doi.org/10.1117/12.138282
Event: Aerospace Sensing, 1992, Orlando, FL, United States

Abstract

In this paper we provide the results of an empirical investigation of iterative maximum entropy spectrum estimation. The Lim-Malik algorithm is compared to the Burg algorithm on a number of analytic as well as practical one-dimensional signals. We study the convergence of the Lim-Malik algorithm and suggest some criteria to assure convergence in the one- dimensional case.

Citation Download Citation

Yuen-Pin Yeap, E. David Jansing, and Aly A. Farag "Empirical investigation of iterative maximum-entropy spectral estimation of one-dimensional random processes", Proc. SPIE 1700, Automatic Object Recognition II, (16 September 1992); https://doi.org/10.1117/12.138282

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available