The discrete fractional Fourier transform based on the DFT matrix
DOI10.1016/J.SIGPRO.2010.05.007zbMATH Open1203.94051OpenAlexW1978432871MaRDI QIDQ612646FDOQ612646
Authors: Ahmet Serbes, Lutfiye Durak-Ata 
Publication date: 29 December 2010
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2010.05.007
Recommendations
- The discrete fractional Fourier transform
- Discrete fractional Fourier transform based on orthogonal projections
- Eigenvectors of the discrete Fourier transform based on the bilinear transform
- Discrete fractional Hartley and Fourier transforms
- Efficient computation of DFT commuting matrices by a closed-form infinite order approximation to the second differentiation matrix
DFT matrixdiscrete fractional Fourier transformeigentransform matricesHermite-Gauss functionsrotation property
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Fractional derivatives and integrals (26A33) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)
Cites Work
- Title not available (Why is that?)
- The discrete fractional Fourier transform
- Joint time-frequency offset detection using the fractional Fourier transform
- The eigenvectors of the discrete Fourier transform: A version of the Hermite functions
- Signal compression using discrete fractional Fourier transform and set partitioning in hierarchical tree
- Discrete fractional Fourier transform based on orthogonal projections
- Eigenvectors and functions of the discrete Fourier transform
- Discrete Fractional Fourier Transform Based on New Nearly Tridiagonal Commuting Matrices
- Shift-invariance of short-time Fourier transform in fractional Fourier domains
- Hermite–Gaussian-Like Eigenvectors of the Discrete Fourier Transform Matrix Based on the Singular-Value Decomposition of Its Orthogonal Projection Matrices
- Short-time fourier transform: two fundamental properties and an optimal implementation
- Efficient computation of DFT commuting matrices by a closed-form infinite order approximation to the second differentiation matrix
- Time delay estimation using fractional Fourier transform
- Tuning of FIR filter transition bandwidth using fractional Fourier transform
Cited In (11)
- Discrete fractional Fourier transform: Vandermonde approach
- Discrete fractional Hartley and Fourier transforms
- The discrete fractional Fourier transform
- Discrete Fractional Fourier Transforms Based on Closed-Form Hermite–Gaussian-Like DFT Eigenvectors
- Parseval relationship of samples in the fractional Fourier transform domain
- Fractionalization of a discrete Hankel transform based on an involutory symmetric kernel matrix
- Fractional discrete \(q\)-Fourier transforms
- Efficient computation of DFT commuting matrices by a closed-form infinite order approximation to the second differentiation matrix
- Eigenvectors of the discrete Fourier transform based on the bilinear transform
- Discrete fractional Fourier transform based on orthogonal projections
- Eigenvectors and functions of the discrete Fourier transform
This page was built for publication: The discrete fractional Fourier transform based on the DFT matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612646)
