Polar format algorithm for bistatic SAR

Author

Rigling, Brian D. ; Moses, Randolph L.

Author_Institution

Dept. of Electr. Eng., Wright State Univ., Dayton, OH, USA

Volume

40

Issue

4

fYear

2004

Firstpage

1147

Lastpage

1159

Abstract

Matched filtering (MF) of phase history data is a mathematically ideal but computationally expensive approach to bistatic synthetic aperture radar (SAR) image formation. Fast backprojection algorithms (BPAs) for image formation have recently been shown to give improved O(N² log₂N) performance. An O(N² log₂N) bistatic polar format algorithm (PFA) based on a bistatic far-field assumption is derived. This algorithm is a generalization of the popular PFA for monostatic SAR image formation and is highly amenable to implementation with existing monostatic image formation processors. Limits on the size of an imaged scene, analogous to those in monostatic systems, are derived for the bistatic PFA.

Keywords

backpropagation; computational complexity; matched filters; radar imaging; synthetic aperture radar; backprojection algorithms; bistatic SAR; bistatic far-field assumption; matched filtering; monostatic SAR image formation; phase history data; polar format algorithm; synthetic aperture radar; Costs; Filtering; Frequency; Geometry; History; Matched filters; Radar antennas; Radar tracking; Receivers; Synthetic aperture radar;

fLanguage

English

Journal_Title

Aerospace and Electronic Systems, IEEE Transactions on

Publisher

ieee

ISSN

0018-9251

Type

jour

DOI

10.1109/TAES.2004.1386870

Filename

1386870