Computation of an eigendecomposition-based discrete fractional Fourier transform with reduced arithmetic complexity

Abstract 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.

[1]  José R. de Oliveira-Neto,et al.  Hardware Architectures for Computing 8-Point Cosine Number Transform , 2018, 2018 IEEE International Symposium on Circuits and Systems (ISCAS).

[2]  Wen-Liang Hsue,et al.  Real Discrete Fractional Fourier, Hartley, Generalized Fourier and Generalized Hartley Transforms With Many Parameters , 2015, IEEE Transactions on Circuits and Systems I: Regular Papers.

[3]  Magdy T. Hanna,et al.  Hermite-Gaussian-like eigenvectors of the discrete Fourier transform matrix based on the direct utilization of the orthogonal projection matrices on its eigenspaces , 2006, IEEE Transactions on Signal Processing.

[4]  F. N. Kong,et al.  Analytic Expressions of Two Discrete Hermite–Gauss Signals , 2008, IEEE Transactions on Circuits and Systems II: Express Briefs.

[5]  Soo-Chang Pei,et al.  The discrete fractional cosine and sine transforms , 2001, IEEE Trans. Signal Process..

[6]  Magdy T. Hanna,et al.  Hermite-Gaussian-like eigenvectors of the discrete Fourier transform matrix based on the singular-value decomposition of its orthogonal projection matrices , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.

[7]  Alexey Kuznetsov.  Explicit Hermite-type Eigenvectors of the Discrete Fourier Transform , 2015, SIAM J. Matrix Anal. Appl..

[8]  Magdy T. Hanna,et al.  Direct sequential evaluation of optimal orthonormal eigenvectors of the discrete Fourier transform matrix by constrained optimization , 2012, Digit. Signal Process..

[9]  Ahmet Serbes,et al.  Compact Fractional Fourier Domains , 2017, IEEE Signal Processing Letters.

[10]  Ping Wei,et al.  Adaptive short time fractional Fourier transform for time–frequency segmentation , 2016 .

[12]  Teng Wang,et al.  Security-Coded OFDM System Based on Multiorder Fractional Fourier Transform , 2016, IEEE Communications Letters.

[13]  Ran Tao,et al.  Transform Order Division Multiplexing , 2011, IEEE Transactions on Signal Processing.

[14]  Magdy T. Hanna,et al.  Discrete fractional Fourier transform based on the eigenvectors of tridiagonal and nearly tridiagonal matrices , 2008, Digit. Signal Process..

[15]  Hua Yu,et al.  Parameter Estimation of Wideband Underwater Acoustic Multipath Channels based on Fractional Fourier Transform , 2016, IEEE Transactions on Signal Processing.

[16]  John T. Sheridan,et al.  Optical encryption by combining image scrambling techniques in fractional Fourier domains , 2013 .

[17]  Lutfiye Durak-Ata,et al.  The discrete fractional Fourier transform based on the DFT matrix , 2011, Signal Process..

[18]  Dorota Majorkowska-Mech,et al.  A Low-Complexity Approach to Computation of the Discrete Fractional Fourier Transform , 2017, Circuits Syst. Signal Process..

[19]  A. Bultheel,et al.  Computation of the fractional Fourier transform , 2004 .

[20]  Juliano B. Lima,et al.  Discrete Fractional Fourier Transforms Based on Closed-Form Hermite–Gaussian-Like DFT Eigenvectors , 2017, IEEE Transactions on Signal Processing.

[21]  Chien-Cheng Tseng,et al.  Discrete fractional Fourier transform based on orthogonal projections , 1999, IEEE Trans. Signal Process..

[22]  Deyun Wei,et al.  Generalized Sampling Expansions with Multiple Sampling Rates for Lowpass and Bandpass Signals in the Fractional Fourier Transform Domain , 2016, IEEE Transactions on Signal Processing.

[23]  Stefan Nolte,et al.  Implementation of quantum and classical discrete fractional Fourier transforms , 2015, Nature Communications.

[24]  Mahmoud H. Annaby,et al.  Image encryption via discrete fractional Fourier-type transforms generated by random matrices , 2016, Signal Process. Image Commun..

[25]  Soo-Chang Pei,et al.  Closed-Form Orthogonal DFT Eigenvectors Generated by Complete Generalized Legendre Sequence , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[26]  Nicolas Longépé,et al.  Vessel Refocusing and Velocity Estimation on SAR Imagery Using the Fractional Fourier Transform , 2016, IEEE Transactions on Geoscience and Remote Sensing.

[27]  Ran Tao,et al.  Multichannel Random Discrete Fractional Fourier Transform , 2015, IEEE Signal Processing Letters.

[28]  J. McClellan,et al.  Eigenvalue and eigenvector decomposition of the discrete Fourier transform , 1972 .

[29]  Balu Santhanam,et al.  Discrete Gauss-Hermite Functions and Eigenvectors of the Centered Discrete Fourier Transform , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[30]  Deyun Wei,et al.  Novel Tridiagonal Commuting Matrices for Types I, IV, V, VIII DCT and DST Matrices , 2014, IEEE Signal Processing Letters.

[31]  Daming Shi,et al.  Maximum Amplitude Method for Estimating Compact Fractional Fourier Domain , 2010, IEEE Signal Processing Letters.

[32]  Magdy T. Hanna,et al.  Direct Batch Evaluation of Optimal Orthonormal Eigenvectors of the DFT Matrix , 2008, IEEE Transactions on Signal Processing.

[33]  Cagatay Candan,et al.  The discrete fractional Fourier transform , 2000, IEEE Trans. Signal Process..

[34]  Lutfiye Durak-Ata,et al.  Efficient computation of DFT commuting matrices by a closed-form infinite order approximation to the second differentiation matrix , 2011, Signal Processing.

[35]  Ran Tao,et al.  A Novel SAR Imaging Algorithm Based on Compressed Sensing , 2015, IEEE Geoscience and Remote Sensing Letters.

[36]  Gozde Bozdagi Akar,et al.  Digital computation of the fractional Fourier transform , 1996, IEEE Trans. Signal Process..

[37]  Qiwen Ran,et al.  Fractionalisation of an odd time odd frequency DFT matrix based on the eigenvectors of a novel nearly tridiagonal commuting matrix , 2011 .

[38]  Juliano B. Lima,et al.  Image encryption based on the fractional Fourier transform over finite fields , 2014, Signal Process..

[39]  Soo-Chang Pei,et al.  Discrete Fractional Fourier Transform Based on New Nearly Tridiagonal Commuting Matrices , 2006, IEEE Trans. Signal Process..

[40]  Soo-Chang Pei,et al.  Generalized Commuting Matrices and Their Eigenvectors for DFTs, Offset DFTs, and Other Periodic Operations , 2008, IEEE Transactions on Signal Processing.

[41]  Cagatay Candan,et al.  On Higher Order Approximations for Hermite–Gaussian Functions and Discrete Fractional Fourier Transforms , 2007, IEEE Signal Processing Letters.

[42]  Z. Zalevsky,et al.  The Fractional Fourier Transform: with Applications in Optics and Signal Processing , 2001 .

[43]  LJubisa Stankovic,et al.  Fractional Fourier transform as a signal processing tool: An overview of recent developments , 2011, Signal Process..

[44]  Ahmet Serbes,et al.  Optimum signal and image recovery by the method of alternating projections in fractional Fourier domains , 2010 .