A butterfly algorithm for synthetic aperture radar
Name
Demanet_A Butterfly.pdf
Size
16.49 MB
Format
Adobe PDF
Checksum (MD5)
bfbb753311ff9ffc8ad35acfef03ba6f
Author(s)
Demanet, Laurent
Ferrara, Matthew
Maxwell, Nicholas
Poulson, Jack
Ying, Lexing
Date Issued
May 2011
Journal
Proceedings of SPIE--the International Society for Optical Engineering
Publisher
SPIE - International Society for Optical Engineering
Citation
Demanet, Laurent et al. “A Butterfly Algorithm for Synthetic Aperture Radar.” 2011. Proc. SPIE 8051, 805105–805105–12. Web. 11 Apr. 2012. © 2011 SPIE - International Society for Optical Engineering
Version
Final published version
Abstract
It is not currently known if it is possible to accurately form a synthetic aperture radar image from N data points in provable near-linear complexity, where accuracy is defined as the ℓ₂ error between the full O(N²) backprojection image and the approximate image. To bridge this gap, we present a backprojection algorithm with complexity O(log(1/ϵ)N log N), with ϵ the tunable pixelwise accuracy. It is based on the butterfly scheme, which works for vastly more general oscillatory integrals than the discrete Fourier transform. Unlike previous methods this algorithm allows the user to directly choose the amount of acceptable image error based on a well-defined metric. Additionally, the algorithm does not invoke the far-field approximation or place restrictions on the antenna flight path, nor does it impose the frequency-independent beampattern approximation required by time-domain backprojection techniques.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1117/12.888948
