Sliding discrete fractional transforms

Citations of this article
Mendeley users who have this article in their library.
Get full text


Fractional transforms are useful tools for processing of non-stationary signals. The methods of implementing sliding discrete fractional Fourier transform (SDFRFT), sliding discrete fractional cosine transform (SDFRCT) and sliding discrete fractional sine transform (SDFRST) for real time processing of signals are presented. The performances of these sliding transforms, with regard to computational complexity, variance of quantization error and signal-to-noise ratio (SNR), are presented and compared. The three sliding discrete fractional transforms are compared with sliding discrete Fourier transform (SDFT) in terms of SNR. Computational complexity in the case of sliding discrete fractional transform is less than that in the case of discrete fractional transform when a particular time-frequency bin is to be observed. In comparison with SDFT, the sliding discrete fractional transforms require less number of bits for representing coefficients. The SDFRST performs better in comparison with SDFRFT and SDFRCT. © 2007 Elsevier B.V. All rights reserved.




Bhat, J. S., & Vijaya, C. (2008). Sliding discrete fractional transforms. Signal Processing, 88(2), 247–254.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free