A mathematical theory on the computational complexity of the Discrete Fourier Transform (DFT) is required, independently of any kind of known Fast Fourier Transform (FFT) algorithm.

This paper is part 4 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on spectral leakage. Spectral leakage applies to all forms of DFT, including the FFT (Fast Fourier Transform) and the IFFT (Inverse Fast Fourier Transform). We demonstrate an approach to mitigating spectral leakage based on windowing...

The $(k,a)$-generalised Fourier transform is the unitary operator defined using $a$-deformed Dunkl harmonic oscillator.The main aim of this paper to prove $L^p$-$L^q$ boundedness $(k, a)$-generalised multipliers. To show we first establish Paley inequality and Hausdorff-Young-Paley for transform. We also demonstrate applications obtained results study well-posedness nonlinear partial differenti...

This paper is concerned with the approach to teaching an introductory course on Fourier theory for engineers. Commonly called Signals and Systems (or some variation), this course generally introduces four transforms: the Fourier Transform, the Fourier Series, the Discrete-Time Fourier Transform (DTFT), and the Discrete Fourier Transform (DFT). Our concern is that the method and order of topic p...

--The fractional fourier transform(FRFT) which is a generalisation of classical fourier transform, was introduced number of years ago in the mathematics literature but appears to have remained largely unknown to a signal processing community to which it may, however, be a potentially useful. The fractional fourier transform depends on a parameter ‘α’ and can be interpreted as a rotation by an a...

A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) of an input vector. Efficient means that the FFT computes the DFT of an n-element vector in O(n logn) operations in contrast to the O(n2) operations required for computing the DFT by definition. FFTs exist for any vector length n and for real and higher-dimensional data. Parallel FFTs have b...

A novel partial frequency response channel estimator is proposed for OFDMA systems. First, the partial frequency response is obtained by least square (LS) method. The conventional discrete Fourier transform (DFT) method will eliminate the noise in time domain. However, after inverse discrete Fourier transform (IDFT) of partial frequency response, the channel impulse response will leak to all ta...