Results 241 to 250 of about 3,305 (281)
The discrete fractional Fourier transform based on the DFT matrix
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmet Serbes, Lutfiye Durak-Ata
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The hopping discrete fractional Fourier transform
Signal Processing, 2021Abstract The discrete fractional Fourier transform (DFrFT) is a powerful signal processing tool for non-stationary signals. Many types of DFrFT have been derived and successful used in different areas. However, for real-time applications that require recalculating the DFrFT at each or several samples, the existing discrete algorithms aren’t the ...
Hongxia Miao
exaly +2 more sources
Random Discrete Fractional Fourier Transform
IEEE Signal Processing Letters, 2009In this letter, a new commuting matrix with random discrete Fourier transform (DFT) eigenvectors is first constructed. A random discrete fractional Fourier transform (RDFRFT) kernel matrix with random DFT eigenvectors and eigenvalues is then proposed.
Soo-Chang Pei, Wen-Liang Hsue
exaly +2 more sources
The multiple-parameter discrete fractional Fourier transform
IEEE Signal Processing Letters, 2006The discrete fractional Fourier transform (DFRFT) is a generalization of the discrete Fourier transform (DFT) with one additional order parameter. In this letter, we extend the DFRFT to have N order parameters, where N is the number of the input data points.
Soo-Chang Pei, Wen-Liang Hsue
exaly +2 more sources
On the multiangle centered discrete fractional Fourier transform
IEEE Signal Processing Letters, 2005Existing versions of the discrete fractional Fourier transform (DFRFT) are based on the discrete Fourier transform (DFT). These approaches need a full basis of DFT eigenvectors that serve as discrete versions of Hermite-Gauss functions. In this letter, we define a DFRFT based on a centered version of the DFT (CDFRFT) using eigenvectors derived from the
Juan G. Vargas-Rubio, Balu Santhanam
exaly +2 more sources
A method for the discrete fractional Fourier transform computation
IEEE Transactions on Signal Processing, 2003A new method for the discrete fractional Fourier transform (DFRFT) computation is given in this paper. With the help of this method, the DFRFT of any angle can be computed by a weighted summation of the DFRFTs with the special angles.
Min-Hung Yeh, Soo-Chang Pei
exaly +2 more sources
Sparse Discrete Fractional Fourier Transform and Its Applications
IEEE Transactions on Signal Processing, 2014The discrete fractional Fourier transform is a powerful signal processing tool with broad applications for nonstationary signals. In this paper, we propose a sparse discrete fractional Fourier transform (SDFrFT) algorithm to reduce the computational complexity when dealing with large data sets that are sparsely represented in the fractional Fourier ...
Shengheng Liu, Tao Shan, Ran Tao
exaly +2 more sources
Discrete fractional Fourier transform based on orthogonal projections
IEEE Transactions on Signal Processing, 1999Summary: The continuous fractional Fourier transform (FRFT) performs a spectrum rotation of signal in the time-frequency plane, and it becomes an important tool for time-varying signal analysis. A discrete fractional Fourier transform has been recently developed by \textit{B. Santhanam} and \textit{J. H.
Soo-Chang Pei +2 more
exaly +3 more sources
The discrete multiple-parameter fractional Fourier transform
Science China Information Sciences, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jun Lang, Ran Tao, Tao Ran
exaly +2 more sources
Discrete Pseudo-Fractional Fourier Transform and Its Fast Algorithm
In this article, we introduce a new discrete fractional transform for data sequences whose size is a composite number. The main kernels of the introduced transform are small-size discrete fractional Fourier transforms. Since the introduced transformation
Dorota Majorkowska-Mech +2 more
exaly +2 more sources

