Journal
SIGNAL PROCESSING
Volume 165, Issue -, Pages 72-82Publisher
ELSEVIER
DOI: 10.1016/j.sigpro.2019.06.032
Keywords
Discrete fractional Fourier transforms; Hermite-Gaussian eigenvectors; Fast algorithms; Arithmetic complexity
Categories
Funding
- CNPq [142428/2015-9, 309598/2017-6, 409543/2018-7]
- CAPES [88881.131572/2016-01]
Ask authors/readers for more resources
In this paper, we introduce a method for computing an eigendecomposition-based discrete fractional Fourier transform (DFrFT) with reduced arithmetic complexity, when compared to the O(N-2) complexity of the corresponding direct computation. Our approach exploits properties of a recently introduced closed-form Hermite-Gaussian-like discrete Fourier transform eigenbasis, which is used to define the DFrFT, and includes a rounding strategy. The proposed (exact) technique requires a slightly lower number of multiplications and half or less additions than what is required by other state-of-the-art methods; if the referred rounding strategy is applied, up to 65% of multiplications can be avoided. We validate our results by means of computer experiments where the application of the transform in signal filtering and compact representation is considered. (C) 2019 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available