Arıkan, OrhanKutay, M. AlperÖzaktaş, Haldun M.Akdemir, Özer Koray2016-02-082016-02-081996http://hdl.handle.net/11693/27756Date of Conference: 18-21 June 1996Conference Name: 3rd International Symposium on Time-Frequency and Time-Scale Analysis, IEEE 1996Based on the fractional Fourier transformation of sampled periodic functions, the discrete form of the fractional Fourier transformation is obtained. It is found that only for a certain dense set of fractional orders such a discrete transformation is possible to define. Also, for its efficient computation a fast algorithm, which has the same complexity as the FFT, is given.EnglishAlgorithmsComputational complexityComputational methodsFractalsSignal processingSignal theoryDiscrete fractional Fourier transformationsFractional Fourier transformSampled periodic functionsFourier transformsConference Paper10.1109/TFSA.1996.547217