As a generalization of the Fourier transform, the fractional Fourier transform was introduced and has been further investigated both in theory and in applications of signal processing. We obtain a sampling theorem on shift-invariant spaces associated with the fractional Fourier transform domain. The resulting sampling theorem extends not only the classical Whittaker-Shannon-Kotelnikov sampling ...

Fractional Fourier transform is one of a flourishing field of active research due to its wide range of applications. It is well-known that fractional Fourier transform is linear, but not shift invariant as that of conventional Fourier transform. Linear shift invariant systems can be expressed in terms of convolution of two functions. Convolution for fractional Fourier transform, defined by Alme...

This paper is concerned with the definitions of the discrete fractional Hartley transform (DFRHT) and the discrete fractional Fourier transform (DFRFT). First, the eigenvalues and eigenvectors of the discrete Fourier and Hartley transform matrices are investigated. Then, the results of the eigendecompositions of the transform matrices are used to define DFRHT and DFRFT. Also, an important relat...

The fractional Fourier transform is a time–frequency distribution and an extension of the classical Fourier transform. There are several known applications of the fractional Fourier transform in the areas of signal processing, especially in signal restoration and noise removal. This paper provides an introduction to the fractional Fourier transform and its applications. These applications deman...

The paper presents a new closed-form expression for the fractional Fourier transform of generalized Triangular and Welch window functions. Fractional Fourier Transform (FrFT) is a parameterized transform having an adjustable transform parameter which makes it more flexible and superior over ordinary Fourier transform in several applications. It is an important tool used in signal processing for...

Fractional Fourier Transform is a generalization of the classical Fourier Transform. The Fractional Fourier span in general depends on the amplitude and phase functions of the signal and varies with the transform order. However, with the development of the Fractional Fourier filter banks, it is advantageous in some cases to have different transform orders for different filter banks to achieve b...

We propose and consolidate a definition of the discrete fractional Fourier transform that generalizes the discrete Fourier transform (DFT) in the same sense that the continuous fractional Fourier transform generalizes the continuous ordinary Fourier transform. This definition is based on a particular set of eigenvectors of the DFT matrix, which constitutes the discrete counterpart of the set of...

Fourier transform can be generalized into the fractional Fourier transform (FRFT), linear canonical transform (LCT), and simplified fractional Fourier transform (SFRFT). They extend the utilities of original Fourier transform, and can solve many problems that can’t be solved well by original Fourier transform. In this paper, we will generalize the cosine transform. We will derive fractional cos...

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 Santhanam and McClellan, but its results do not match those of the corresponding continuous fractional Fourier transforms. In this paper, we...

-Fractional Fourier Transform is a generalization of the classical Fourier Transform, which has found its most useful applications for the transient analysis of the signals. This paper studies the span of the Fractional Fourier Transform in relation with the amplitude and phase functions of the signal and provides a mathematical derivation for the generalized case. The derived expression is sho...