Results 1  10
of
16
Fractional Fourier transforms and their optical implementation: II
 J. Opt. Soc. Am. A
"... Fourier transforms of fractional order a are defined in a manner such that the common Fourier transform is a special case with order a = 1. An optical interpretation is provided in terms of quadratic graded index media and discussed from both wave and ray viewpoints. Several mathematical properties ..."
Abstract

Cited by 59 (17 self)
 Add to MetaCart
Fourier transforms of fractional order a are defined in a manner such that the common Fourier transform is a special case with order a = 1. An optical interpretation is provided in terms of quadratic graded index media and discussed from both wave and ray viewpoints. Several mathematical properties are derived. 1.
Digital computation of the fractional Fourier transform
 IEEE Trans. Signal Process
, 1996
"... AbstractAn algorithm for efficient and accurate computation of the fractional Fourier transform is given. For signals with timebandwidth product N, the presented algorithm computes the fractional transform in O ( N log N) time. A definition for the discrete fractional Fourier transform that emerge ..."
Abstract

Cited by 39 (15 self)
 Add to MetaCart
AbstractAn algorithm for efficient and accurate computation of the fractional Fourier transform is given. For signals with timebandwidth product N, the presented algorithm computes the fractional transform in O ( N log N) time. A definition for the discrete fractional Fourier transform that emerges from our analysis is also discussed. I.
The Discrete Fractional Fourier Transform
, 2000
"... 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 particula ..."
Abstract

Cited by 24 (4 self)
 Add to MetaCart
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.
A shattered survey of the Fractional Fourier Transform
, 2002
"... In this survey paper we introduce the reader to the notion of the fractional Fourier transform, which may be considered as a fractional power of the classical Fourier transform. It has been intensely studied during the last decade, an attention it may have partially gained because of the vivid inter ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In this survey paper we introduce the reader to the notion of the fractional Fourier transform, which may be considered as a fractional power of the classical Fourier transform. It has been intensely studied during the last decade, an attention it may have partially gained because of the vivid interest in timefrequency analysis methods of signal processing, like wavelets. Like the complex exponentials are the basic functions in Fourier analysis, the chirps (signals sweeping through all frequencies in a certain interval) are the building blocks in the fractional Fourier analysis. Part of its roots can be found in optics where the fractional Fourier transform can be physically realized. We give an introduction to the definition, the properties and computational aspects of both the continuous and discrete fractional Fourier transforms. We include some examples of applications and some possible generalizations.
On the diagonalization of the discrete Fourier transform
, 2009
"... Dedicated to William Kahan and Beresford Parlett on the occasion of their 75th birthday Abstract. The discrete Fourier transform (DFT) is an important operator which acts on the Hilbert space of complex valued functions on the ring Z/NZ. In the case where N = p is an odd prime number, we exhibit a c ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Dedicated to William Kahan and Beresford Parlett on the occasion of their 75th birthday Abstract. The discrete Fourier transform (DFT) is an important operator which acts on the Hilbert space of complex valued functions on the ring Z/NZ. In the case where N = p is an odd prime number, we exhibit a canonical basis Φ of eigenvectors for the DFT. The transition matrix Θ from the standard basis to Φ defines a novel transform which we call the discrete oscillator transform (DOT for short). Finally, we describe a fast algorithm for computing Θ in certain cases. The discrete Fourier transform (DFT) is probably one of the most important operators in modern science. It is omnipresent in various fields of discrete mathematics and engineering, including combinatorics, number theory, computer science and, last but probably not least, digital signal processing. Formally, the DFT is
A discrete fractional random transform, Opt
 Comm
"... We propose a discrete fractional random transform based on a generalization of the discrete fractional Fourier transform with an intrinsic randomness. Such discrete fractional random transform inheres excellent mathematical properties of the fractional Fourier transform along with some fantastic fea ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We propose a discrete fractional random transform based on a generalization of the discrete fractional Fourier transform with an intrinsic randomness. Such discrete fractional random transform inheres excellent mathematical properties of the fractional Fourier transform along with some fantastic features of its own. As a primary application, the discrete fractional random transform has been used for image encryption and decryption. Key words: fractional Fourier transform, discrete random transform, cryptography, image encryption and decryption PACS: 42.30.d, 42.40.i, 02.30.Uu 1
Fast algorithm for chirp transforms with zoomingin ability and its applications
 Journal of the Optical Society of America A,vol.17,no.4
, 2000
"... A general fast numerical algorithm for chirp transforms is developed by using two fast Fourier transforms and employing an analytical kernel. This new algorithm unifies the calculations of arbitrary realorder fractional Fourier transforms and Fresnel diffraction. Its computational complexity is bet ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A general fast numerical algorithm for chirp transforms is developed by using two fast Fourier transforms and employing an analytical kernel. This new algorithm unifies the calculations of arbitrary realorder fractional Fourier transforms and Fresnel diffraction. Its computational complexity is better than a fast convolution method using Fourier transforms. Furthermore, one can freely choose the sampling resolutions in both x and u space and zoom in on any portion of the data of interest. Computational results are compared with analytical ones. The errors are essentially limited by the accuracy of the fast Fourier transforms and are higher than the order 10�12 for most cases. As an example of its application to scalar diffraction, this algorithm can be used to calculate nearfield patterns directly behind the aperture, 0 � z � d2 /�. It compensates another algorithm for Fresnel diffraction that is limited to z � d2 /�N [J. Opt. Soc. Am. A 15, 2111 (1998)]. Experimental results from waveguideoutput microcoupler diffraction are in good agreement with the calculations.
APPLICATION OF THE WEIL REPRESENTATION: DIAGONALIZATION OF THE DISCRETE FOURIER TRANSFORM
, 902
"... Abstract. We survey a new application of the Weil representation to construct a canonical basis Φ of eigenvectors for the discrete Fourier transform (DFT). The transition matrix Θ from the standard basis to Φ defines a novel transform which we call the discrete oscillator transform (DOT for short). ..."
Abstract
 Add to MetaCart
Abstract. We survey a new application of the Weil representation to construct a canonical basis Φ of eigenvectors for the discrete Fourier transform (DFT). The transition matrix Θ from the standard basis to Φ defines a novel transform which we call the discrete oscillator transform (DOT for short). In addition, we describe a fast algorithm for computing Θ in certain cases. The discrete Fourier transform (DFT) is probably one of the most important operators in modern science. It is omnipresent in various fields of discrete mathematics and engineering, including combinatorics, number theory, computer science and, last but probably not least, digital signal processing. Formally, the DFT is
1 School of Mathematical Sciences, Peking University,
, 2009
"... Following the approach developed by S. Gurevich and R. Hadani, an analytical formula of the canonical basis of the DFT is given for the case N = p where p is a prime number and p ≡ 1 (mod 4). ..."
Abstract
 Add to MetaCart
Following the approach developed by S. Gurevich and R. Hadani, an analytical formula of the canonical basis of the DFT is given for the case N = p where p is a prime number and p ≡ 1 (mod 4).