This work concentrates on the analysis of radar signature signals for the characterization and efficient computation of finite discrete two-dimensional point spread functions. A general simple model for ground penetrating raw data image formation is assumed in order to concentrate ont he efficient computation of point spread functions. The point spread functions are used as impulse response functions for the simulation of high resolution image of twodimensional synthetic aperture imaging kernels. A methodology has been developed to serve as a tool aid in the analysis, design, and efficient implementation of one-dimensional and two-dimensional fast Fourier transform (FFT) algorithms prevalent in SAR image formation operations with the idea in mind of reducing the computational effort and improving the hardware implementation process. Kronecker products algebra, a branch of finite dimensional multilinear algebra, has been demonstrated to be a useful tool aid in the devel-opment of fast algorithms for unitary transformations and in the identification of similarities and differences among FFT computational frameworks.
展开▼