descriptionPublicationkeyboard_double_arrow_right Article , Conference object 24 Dec 2002Publisher:IEEEJournal:Proceedings of Third International Symposium on Time-Frequency and Time-Scale Analysis (TFTS-96)

Authors: Arıkan, Orhan; Kutay, M. Alper; Özaktaş, Haldun M.; Akdemir, Özer Koray;

doi: 10.1109/tfsa.1996.547217

handle: 11693/27756

The discrete fractional Fourier transformation

- Summary
- Subjects
- Related research
  (1)
- Metrics

Abstract

Based on the fractional Fourier transformation of sampled periodic functions, the discrete form of the fractional Fourier transformation is obtained. It is found that for a certain dense set of fractional orders it is possible to define a discrete transformation. Also, for its efficient computation a fast algorithm, which has the same complexity as the FFT, is given.

Related Organizations

Bilkent University
Turkey

Keywords

Computational complexity, Signal processing, Fractals, Computational methods, Discrete fractional Fourier transformations, Signal theory, Sampled periodic functions, Algorithms, Fractional Fourier transform, Fourier transforms

1 Research products, page 1 of 1

Fractional Fourier Domain Decomposition
1997IsPartOf

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	19
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%