Abstract
The two-dimensional discrete fractional Fourier transform (2D DFrFT) has been shown to be a powerful tool for 2D signal processing. However, the existing discrete algorithms aren't the optimal for real-time applications, where the input signals are stream data arriving in a sequential manner. In this letter, a new sliding algorithm is proposed to solve this problem, termed as the 2D sliding DFrFT (2D SDFrFT). The proposed 2D SDFrFT algorithm directly computes the 2D DFrFT in current window using the results of previous window, which greatly reduces the computations. During the derivation, we find that the (m+δn)th DFrFT bin in previous window is needed for computing the (m,n)th DFrFT bin in current window, where the increment δ isn't always an integer. Further, a method is proposed to convert the increment δ to a certain integer by determining appropriate sampling interval. The theoretical analysis demonstrates that when compute the new 2D DFrFT in a shifted window in sliding process, our proposed algorithm has the lowest computational cost among existing 2D DFrFT algorithms.
Original language | English |
---|---|
Article number | 8854972 |
Pages (from-to) | 1733-1737 |
Number of pages | 5 |
Journal | IEEE Signal Processing Letters |
Volume | 26 |
Issue number | 12 |
DOIs | |
Publication status | Published - Dec 2019 |
Keywords
- 2D algorithm
- fractional fourier transform
- sliding window
- two-dimensional discrete fractional Fourier transform