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 Hermite-Gaussian functions. The definition is exactly unitary, index additive, and reduces to the DFT for unit order. The fact that this definition satisfies all the desirable properties expected of the discrete fractional Fourier transform supports our confidence that it will be accepted as the definitive definition of this transform.

/pdf/the-discrete-fractional-fourier-transform-13dhl8vxtf.pdf

The discrete fractional Fourier transform

A brief introduction to the fractional Fourier transform and its properties is given. Its relation to phase-space representations (time- or space-frequency representations) and the concept of fractional Fourier domains are discussed. An overview of applications which have so far received interest are given and some potential application areas remaining to be explored are noted.

/pdf/the-fractional-fourier-transform-2prn7ao4oa.pdf

The fractional fourier transform

In this paper, we intend to implement a class of fractional differential masks with high-precision. Thanks to two commonly used definitions of fractional differential for what are known as Grumwald-Letnikov and Riemann-Liouville, we propose six fractional differential masks and present the structures and parameters of each mask respectively on the direction of negative x-coordinate, positive x-coordinate, negative y-coordinate, positive y-coordinate, left downward diagonal, left upward diagonal, right downward diagonal, and right upward diagonal. Moreover, by theoretical and experimental analyzing, we demonstrate the second is the best performance fractional differential mask of the proposed six ones. Finally, we discuss further the capability of multiscale fractional differential masks for texture enhancement. Experiments show that, for rich-grained digital image, the capability of nonlinearly enhancing complex texture details in smooth area by fractional differential-based approach appears obvious better than by traditional integral-based algorithms.

Fractional Differential Mask: A Fractional Differential-Based Approach for Multiscale Texture Enhancement

Fractional Fourier transform as a signal processing tool: An overview of recent developments

Spatial correlations in parametric down-conversion

http://kilyos.ee.bilkent.edu.tr/~haldun/publications/ozaktas111.pdf

Optimal filtering with linear canonical transformations

We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the original function. Two approaches are presented and compared. The first is based on decomposition of the LCT into chirp multiplication, Fourier transformation, and scaling operations. The second is based on decomposition of the LCT into a fractional Fourier transform followed by scaling and chirp multiplication. Both algorithms take ~ N log N time, where N is the time-bandwidth product of the signals. The only essential deviation from exactness arises from the approximation of a continuous Fourier transform with the discrete Fourier transform. Thus, the algorithms compute LCTs with a performance similar to that of the fast Fourier transform algorithm in computing the Fourier transform, both in terms of speed and accuracy.

/pdf/digital-computation-of-linear-canonical-transforms-1atklzt7b9.pdf

Digital Computation of Linear Canonical Transforms

Publisher Summary This chapter is an introduction to the fractional Fourier transform and its applications. The fractional Fourier transform is a generalization of the ordinary Fourier transform with an order parameter a . Mathematically, the a th order fractional Fourier transform is the a th power of the Fourier transform operator. The a = 1st order fractional transform is the ordinary Fourier transform. In essence, the a th order fractional Fourier transform interpolates between a function f(u) and its Fourier transform F(μ) . The 0th order transform is simply the function itself, whereas the 1st order transform is its Fourier transform. The 0.5th transform is something in between, such that the same operation that takes us from the original function to its 0.5 th transform will take us from its 0.5th transform to its ordinary Fourier transform. More generally, index additivity is satisfied: The a 2 th transform of the a 1 th transform is equal to the ( a 2 + a 1 )th transform. The –1th transform is the inverse Fourier transform, and the – a th transform is the inverse of the a th transform.

/pdf/introduction-to-the-fractional-fourier-transform-and-its-4g7jnxkbql.pdf

Introduction to the Fractional Fourier Transform and Its Applications

/pdf/linear-canonical-transforms-34bmx3z64d.pdf

M. Alper Kutay

Papers

The fractional fourier transform

Optimal filtering with linear canonical transformations

Digital Computation of Linear Canonical Transforms

Introduction to the Fractional Fourier Transform and Its Applications

Linear Canonical Transforms