The discrete Fourier transform (DFT) is a widely used tool in signal or image processing and its efficiency is important. There are applications where it is desirable to use relatively small, successive, overlapped DFTs to obtain the spectrum coefficients. The momentary Fourier transform (MFT) computes the DFT of a discrete-time sequence for every new sample in an efficient recursive form. In this thesis we give an alternate derivation of the MFT using the momentary matrix transform (MMT). Recursive and non-recursive forms of the inverse MFT are also given, which can provide efficient frequency domain manipulation (e.g. filtering). Discussion on the properties and examples of the usage of the MFT is given, followed by a survey on it...
An integrated algorithm for analyzing the real-time, running Fourier spectra is presented. When appl...
In this paper, multiresolution signal processing is described, by the continuous Fourier transform, ...
The following four propositions are required for the proof of Theorem 1 given in II. The proofs of t...
This paper is part 5 in a series of papers about the Discrete Fourier Transform (DFT) and the Invers...
Some practical extensions to digital signal processing techniques are presented. Firstly, an account...
International audienceA brief comparison of two time-frequency (TF) reassignment methods is provided...
The idea of the research is mainly to understand the application of DFT, windowing, zero padding, us...
The majority of signals encountered in real applications, such as radar, sonar, speech, and communic...
In this thesis, I examine the theoretical properties of the short time discrete Fourier transform (S...
All electrical signals can be described either as a function of time or of frequency. When we observ...
The aim of the master’s thesis is to acquaint the reader with Discrete Fourier Transform DFT and its...
The conventional radar signal processing typically employs the Fast Fourier Transform (FFT) to detec...
The discrete Fourier transform (DFT) can be considered as an observing system, which has an input f,...
An algorithm is proposed for computing the Fourier Transform (FT) of a uniformly sampled signal at a...
The discrete Fourier transform (DFT) can be considered as an observing system, which has an input f,...
An integrated algorithm for analyzing the real-time, running Fourier spectra is presented. When appl...
In this paper, multiresolution signal processing is described, by the continuous Fourier transform, ...
The following four propositions are required for the proof of Theorem 1 given in II. The proofs of t...
This paper is part 5 in a series of papers about the Discrete Fourier Transform (DFT) and the Invers...
Some practical extensions to digital signal processing techniques are presented. Firstly, an account...
International audienceA brief comparison of two time-frequency (TF) reassignment methods is provided...
The idea of the research is mainly to understand the application of DFT, windowing, zero padding, us...
The majority of signals encountered in real applications, such as radar, sonar, speech, and communic...
In this thesis, I examine the theoretical properties of the short time discrete Fourier transform (S...
All electrical signals can be described either as a function of time or of frequency. When we observ...
The aim of the master’s thesis is to acquaint the reader with Discrete Fourier Transform DFT and its...
The conventional radar signal processing typically employs the Fast Fourier Transform (FFT) to detec...
The discrete Fourier transform (DFT) can be considered as an observing system, which has an input f,...
An algorithm is proposed for computing the Fourier Transform (FT) of a uniformly sampled signal at a...
The discrete Fourier transform (DFT) can be considered as an observing system, which has an input f,...
An integrated algorithm for analyzing the real-time, running Fourier spectra is presented. When appl...
In this paper, multiresolution signal processing is described, by the continuous Fourier transform, ...
The following four propositions are required for the proof of Theorem 1 given in II. The proofs of t...