Abstract
The discrete fractional Fourier transform (DFRFT) plays an important role in processing time-varying signals. Nevertheless, directly computing the DFRFT involves high complexity, particularly when addressing multi-angle DFRFT scenarios. This article presents a method to compute multi-angle DFRFTs through the execution of a single complex DFRFT, exploiting several properties of the DFRFT. We first calculate the DFRFTs with rotation angles 0 and α. Subsequently, when dealing with the DFRFTs of two real signals with rotation angles α and β, which is so-called the multi-angle DFRFTs, our method only need one complex DFRFT and some additional manipulations with complexity O(M), which reduce the computational complexity efficiently. Furthermore, the proposed method is also applicable to the processing of two dimensional (2D) signals. Additionally, as a generalized form of the DFRFT, the fast computation of the multi-angle discrete affine Fourier transform (DAFT) is also considered. Finally, the simulation results confirm that the proposed methods can effectively reduce the computational complexity without compromising precision.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
