Polar format algorithm : survey of assumptions and approximations.
Author(s) -
Cameron Musgrove
Publication year - 2012
Language(s) - English
Resource type - Reports
DOI - 10.2172/1059472
Subject(s) - fast fourier transform , interpolation (computer graphics) , azimuth , image scaling , algorithm , computer science , polar , scaling , fourier transform , prime factor fft algorithm , image (mathematics) , mathematics , image processing , artificial intelligence , fourier analysis , geometry , fractional fourier transform , mathematical analysis , physics , astronomy
Since the Polar Format Algorithm (PFA) was first introduced by Jack Walker 30 years ago, digital processing and Moore’s law have provided the means by which to process an increasing amount of data, at finer resolutions, over a larger area, and in real-time. Inherent in the polar format algorithm are assumptions that limit the focused scene size. This report presents a development of PFA for a linear frequency modulated chirp pulsed radar utilizing stretch processing to illustrate how PFA approximations are used to form an image. Also techniques to mitigate the errors resulting from the approximations are presented from a survey of literature sources. There are many techniques that are successful at increasing the focused scene size, these include image corrections made after image formation, subaperture processing, and careful selection of processing coordinates. This report only considers methods that use the polar format algorithm.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom