Paper
4 May 2011 A butterfly algorithm for synthetic aperture radar
Laurent Demanet, Matthew Ferrara, Nicholas Maxwell, Jack Poulson, Lexing Ying
Author Affiliations +
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 ℓ2 error between the full O(N2) 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.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Laurent Demanet, Matthew Ferrara, Nicholas Maxwell, Jack Poulson, and Lexing Ying "A butterfly algorithm for synthetic aperture radar", Proc. SPIE 8051, Algorithms for Synthetic Aperture Radar Imagery XVIII, 805105 (4 May 2011); https://doi.org/10.1117/12.888948
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Antennas

Synthetic aperture radar

Data modeling

Fourier transforms

Error analysis

Detection and tracking algorithms

Mathematics

Back to Top