Topic
Fractional Fourier transform
About: Fractional Fourier transform is a research topic. Over the lifetime, 9263 publications have been published within this topic receiving 224088 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: The S transform is shown to have some desirable characteristics that are absent in the continuous wavelet transform, and provides frequency-dependent resolution while maintaining a direct relationship with the Fourier spectrum.
Abstract: The S transform, which is introduced in the present correspondence, is an extension of the ideas of the continuous wavelet transform (CWT) and is based on a moving and scalable localizing Gaussian window. It is shown to have some desirable characteristics that are absent in the continuous wavelet transform. The S transform is unique in that it provides frequency-dependent resolution while maintaining a direct relationship with the Fourier spectrum. These advantages of the S transform are due to the fact that the modulating sinusoids are fixed with respect to the time axis, whereas the localizing scalable Gaussian window dilates and translates.
2,752 citations
TL;DR: The Fourier transform data communication system is described and the effects of linear channel distortion are investigated and a differential phase modulation scheme is presented that obviates any equalization.
Abstract: The Fourier transform data communication system is a realization of frequency-division multiplexing (FDM) in which discrete Fourier transforms are computed as part of the modulation and demodulation processes. In addition to eliminating the bunks of subcarrier oscillators and coherent demodulators usually required in FDM systems, a completely digital implementation can be built around a special-purpose computer performing the fast Fourier transform. In this paper, the system is described and the effects of linear channel distortion are investigated. Signal design criteria and equalization algorithms are derived and explained. A differential phase modulation scheme is presented that obviates any equalization.
2,507 citations
Journal Article•
TL;DR: The S transform as discussed by the authors is an extension to the ideas of the Gabor transform and the Wavelet transform, based on a moving and scalable localising Gaussian window and is shown here to have characteristics that are superior to either of the transforms.
Abstract: The S transform, an extension to the ideas of the Gabor transform and the Wavelet transform, is based on a moving and scalable localising Gaussian window and is shown here to have characteristics that are superior to either of the transforms. The S transform is fully convertible both forward and inverse from the time domain to the 2-D frequency translation (time) domain and to the familiar Fourier frequency domain. Parallel to the translation (time) axis, the S transform collapses as the Fourier transform. The amplitude frequency-time spectrum and the phase frequency-time spectrum are both useful in defining local spectral characteristics. The superior properties of the S transform are due to the fact that the modulating sinusoids are fixed with respect to the time axis while the localising scalable Gaussian window dilates and translates. As a result, the phase spectrum is absolute in the sense that it is always referred to the origin of the time axis, the fixed reference point. The real and imaginary spectrum can be localised independently with a resolution in time corresponding to the period of the basis functions in question. Changes in the absolute phase ofa constituent frequency can be followed along the time axis and useful information can be extracted. An analysis of a sum of two oppositely progressing chirp signals provides a spectacular example of the power of the S transform. Other examples of the applications of the Stransform to synthetic as well as real data are provided.
2,323 citations
IBM1
TL;DR: An indexing method for time sequences for processing similarity queries using R * -trees to index the sequences and efficiently answer similarity queries and provides experimental results which show that the method is superior to search based on sequential scanning.
Abstract: We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong. Another important observation is Parseval's theorem, which specifies that the Fourier transform preserves the Euclidean distance in the time or frequency domain. Having thus mapped sequences to a lower-dimensionality space by using only the first few Fourier coefficients, we use R * -trees to index the sequences and efficiently answer similarity queries. We provide experimental results which show that our method is superior to search based on sequential scanning. Our experiments show that a few coefficients (1–3) are adequate to provide good performance. The performance gain of our method increases with the number and length of sequences.
2,082 citations