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

THEKERNEL OF N- DIMENSIONAL FRACTIONAL FOURIER TRANSFORM

In this paper we have developed the kernel of N-dimensional fractional Fourier transform by extending the definition of first dimensional fractional Fourier transform. The properties of kernel up to N- dimensional are also presented here which is missing in the literature of fractional Fourier transform. The properties of kernel of fractional Fourier transforms up to N- dimensional will help the researcher to extend their research in this aspect.