Results 221 to 230 of about 15,774 (263)
Some of the next articles are maybe not open access.
Discrete-Time Fourier Transform Discrete Fourier Transform
2022Muhammad N. Khan +2 more
openaire +1 more source
Uniqueness of the discrete Fourier transform
Signal Processing, 2023Isabelle Baraquin, Nicolas Ratier
openaire +1 more source
The Discrete Fourier Transform
1996As discussed in Section 1.1.2, the design of a DSP system basically involves two fundamental tasks, namely, the analysis of the input signal and the design of a processing system to give the desired output. There are several different mathematical tools for carrying out these two tasks. A time-domain approach was presented in Chapter 1, where a sampled
Trevor J. Terrell, Lik-Kwan Shark
openaire +1 more source
The discrete Fourier transform
1992In Chapter 2 we developed properties of the (continuous-time) direct Fourier transform and the inverse Fourier transform, the two constituting an integral pair. Whereas Fourier series analysis is largely concerned with functions which are treated as being periodic, the Fourier transform provides an instrument for the analysis of non-periodic functions.
openaire +1 more source
2002
The Fourier Transform has wide applications in scientific computing and engineering. Although it has a continuous version, we will consider only the discrete version (DFT) and present what is commonly known as the Fast Fourier Transform (FFT) algorithm.
openaire +1 more source
The Fourier Transform has wide applications in scientific computing and engineering. Although it has a continuous version, we will consider only the discrete version (DFT) and present what is commonly known as the Fast Fourier Transform (FFT) algorithm.
openaire +1 more source
The Discrete Fourier Transform
1993Abstract We will consider how several different networks handle many common algorithms. In order to do this, we follow Preparata and Vuillemin in [125] in defining a pair of generic parallel algorithms that can be easily implemented on the common network-Naturally, some networks are better than others for developing parallel ...
openaire +1 more source
The discrete Fourier transform
2012The n-th roots of unity are the roots of the polynomial x n — 1 in the complex field. We know that they are all distinct because the polynomial is coprime with its derivative, and that they are all powers of one of them, a primitive root ω = e 2πi/n : $$ 1,w,{w}^2,\dots, {w}^{n-1}, $$ with w n = 1.
openaire +1 more source
1989
In chapter 6, we investigated the definition and properties of the discrete-time Fourier transform X(e jω ), with ω being a continuous frequency variable, and found it to be very useful for analyzing a wide variety of signals and systems of theoretical interest.
openaire +1 more source
In chapter 6, we investigated the definition and properties of the discrete-time Fourier transform X(e jω ), with ω being a continuous frequency variable, and found it to be very useful for analyzing a wide variety of signals and systems of theoretical interest.
openaire +1 more source