Sparse Discrete Fractional Fourier Transform and Its Applications

Abstract

The discrete fractional Fourier transform is a powerful signal processing tool with broad applications for nonstationary signals. In this paper, we propose a sparse discrete fractional Fourier transform (SDFrFT) algorithm to reduce the computational complexity when dealing with large data sets that are sparsely represented in the fractional Fourier domain. The proposed technique achieves multicomponent resolution in addition to its low computational complexity and robustness against noise. In addition, we apply the SDFrFT to the synchronization of high dynamic direct-sequence spread-spectrum signals. Furthermore, a sparse fractional cross ambiguity function (SFrCAF) is developed, and the application of SFrCAF to a passive coherent location system is presented. The experiment results confirm that the proposed approach can substantially reduce the computation complexity without degrading the precision.