Complex SAR phase history modeling using two-dimensional parametric estimation techniques

Chinghui J. Ying; Hung-Chih Chiang; Randolph L. Moses; Lee C. Potter

doi:10.1117/12.242046

10 June 1996 Complex SAR phase history modeling using two-dimensional parametric estimation techniques

Chinghui J. Ying, Hung-Chih Chiang, Randolph L. Moses, Lee C. Potter

Proceedings Volume 2757, Algorithms for Synthetic Aperture Radar Imagery III; (1996) https://doi.org/10.1117/12.242046
Event: Aerospace/Defense Sensing and Controls, 1996, Orlando, FL, United States

Abstract

Using a point scatterer assumption, high-frequency SAR phase histories can be modeled as a sum of 2D complex exponentials in additive noise. This paper summarizes our SAR signal modeling experience using the XPatch simulated scattering data. We apply several 2D parametric estimation techniques including 2D TLS-Prony, MEMP, 2D IQML, and 2D CLEAN to estimate the complex exponential model parameters. From the estimation results, we discuss the engineering trade-offs among memory requirement, computation requirement, and estimation accuracy.

Citation Download Citation

Chinghui J. Ying, Hung-Chih Chiang, Randolph L. Moses, and Lee C. Potter "Complex SAR phase history modeling using two-dimensional parametric estimation techniques", Proc. SPIE 2757, Algorithms for Synthetic Aperture Radar Imagery III, (10 June 1996); https://doi.org/10.1117/12.242046

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