Discrete Pseudo-Fractional Fourier Transform and Its Fast Algorithm

Citations Over Time

Abstract

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 is not, in the generally known sense, a classical discrete fractional transform, we call it discrete pseudo-fractional Fourier transform. We also provide a generalization of this new transform, which depends on many fractional parameters. A fast algorithm for computing the introduced transform is developed and described.

Related Papers

• → Evolution of Forward and Inverse Discrete Fourier Transform(2018)16 cited
• → An extension of the discrete Fourier transform(1985)14 cited
• → Numerical Computation of the Discrete 2D Fourier Transform in Polar Coordinates(2018)1 cited
• → Examples of Discrete Transforms(2001)1 cited
• → Discrete Time and Frequency Transformation(2008)