Optimizing and Implementing the Fast Algorithm for Real Time SAR Imaging

A fast correlation algorithm in SAR imaging is presented to lower down the computation burden of range compression and azimuth focusing processing. It is based on the decomposition method of DFT. In order to minimize the computation amount, the relationship of number of padding zeroes and the decomposition scheme to computation complexity is investigated, which is dependent on the number of correlation filter coefficient taps. Then for different numbers of correlation filter coefficient taps, the number of padding zeroes and decomposition scheme are optimized. This algorithm is superior in computational efficiency compared with other algorithms. It is applied to real time SAR imaging and proved to be effective in computation