A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Filters
Fast Fourier Transforms
[chapter]
2010
Chapman & Hall/CRC Computational Science
Preserved Fulltext
THE FAST FOURIER TRANSFORM (FFT) VS. ...
0
Sample N -1
N = 8
t
t
t
t
FAST FOURIER TRANSFORMS
5.3 ...
doi:10.1201/b10376-12
fatcat:yhvmzfydpzbpjgi2w54w3b6z3y
Fast Fourier Transforms
[chapter]
2008
Power Quality
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
THE FAST FOURIER TRANSFORM (FFT) VS. ...
0
Sample N -1
N = 8
t
t
t
t
FAST FOURIER TRANSFORMS
5.3 ...
doi:10.1201/9781420064827.ch11
fatcat:g4xhtiyywbdgzpgsc3frumd3em
Fast Fourier Transform
[chapter]
2005
Digital Signal Processing and Applications with the C6713 and C6416 DSK
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this experiment, you will probe the Fast Fourier Transform (FFT) algorithm by applying different inputs to it and by changing some of its parameters. ...
On the real-time implementation, you will transform your time domain display on the oscilloscope into a frequency domain display. ...
Introduction The purpose of this lab is to lead you through some of the issues involving the implementation of Fast Fourier Transforms on DSP hardware. ...
doi:10.1002/0471704075.ch6
fatcat:5suuhuotqzeuzo73k5l7eksoqa
Fast Fourier Transforms
[chapter]
2003
Mixed-signal and DSP Design Techniques
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
THE FAST FOURIER TRANSFORM (FFT) VS. ...
0
Sample N -1
N = 8
t
t
t
t
FAST FOURIER TRANSFORMS
5.3 ...
doi:10.1016/b978-075067611-3/50005-0
fatcat:rqkx7brslrf7vp4vhnpzo2wjme
Fast Fourier Transform
[chapter]
1975
Orthogonal Transforms for Digital Signal Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
of the individual Fourier transforms. ...
This result shows that multiplying the Fourier transform of one function by the complex conjugate of the Fourier transform of the other gives the Fourier transform of their correlation. ...
doi:10.1007/978-3-642-45450-9_4
fatcat:s7fvpp7suzdp5lmxz5sovb3ria
The Fast Fourier Transform
[chapter]
2009
Handbook of Real-Time Fast Fourier Transforms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Table of Contents of History of the FFT
The Discrete Fourier Transform
The Fast Fourier Transform
MP3 Compression via the DFT
The Fourier Transform in Mathematics
Table of Contents of History ...
of the FFT
The Discrete Fourier Transform
The Fast Fourier Transform
MP3 Compression via the DFT
The Fourier Transform in Mathematics
The Basic MP3 Algorithm Input: sampled sound as a vector ...
Fourier Transform in Pure Mathematics
Algebra and Topology The Fourier transform may be viewed as a specific case of representation theory. ...
doi:10.1109/9780470544792.ch3
fatcat:fg4urfnz4ngh5ggvbfqq42whtu
Recursive Fast Fourier Transforms
1968
Proceedings of the December 9-11, 1968, fall joint computer conference, part I on - AFIPS '68 (Fall, part I)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A. disadvantage of the Fast Fourier Transform is that all samples of the function must be stored in memory before processing can start. ...
The development of the Fast Fourier Transform in co~plex notation has obscured the savings that can be made through the use of recursive properties of trigometric functions. ...
doi:10.1145/1476589.1476612
dblp:conf/afips/Epstein68
fatcat:3uokokn7nnauvkprsyfpfa54ve
Fast Fourier Transform(s)
[chapter]
2013
Encyclopedia of Tribology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
THE FAST FOURIER TRANSFORM (FFT) VS. ...
0
Sample N -1
N = 8
t
t
t
t
FAST FOURIER TRANSFORMS
5.3 ...
doi:10.1007/978-0-387-92897-5_100464
fatcat:v2axv4s3u5gmdm2m455wckq4dm
Fast Partial Fourier Transform
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications. ...
In this paper, we propose a fast Partial Fourier Transform (PFT), a careful modification of the Cooley-Tukey algorithm that enables one to specify an arbitrary consecutive range where the coefficients ...
RELATED WORK We describe related works on Fast Fourier transform (FFT), as well as its applications. Fast Fourier Transform. ...
arXiv:2008.12559v1
fatcat:baqeb7meqbd5xo3wzfkx6jwwey
The Fast Fourier Transform
[chapter]
2011
Discrete Fourier Analysis
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The term fast Fourier transform refers to any algorithm that computes the DFT in O(N log N ) time. ...
Fourier transform to compute it in O(N log N ) operations. ...
doi:10.1007/978-3-0348-0116-4_7
fatcat:grt5p6w4yfd6zg7u643zjwzrja
Fast Fourier transform revisited
2015
Lietuvos matematikos rinkinys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Using FFT (fast Fourier transform), it is assumed, that some signal samples in a respective period N are updated by a sensor in real time. ...
., {x(n)} = 0 for n < 0 and n L) that has the Fourier transform X(ω) = L−1 n=0 x(n)e −jωn , ∀ω ∈ 0, 2π. ( Here j is the imaginary unit. ...
is called DFT of {x(n)} and is used for transforming the sequence {x(n)} into a sequence of f.s. {X(k)} of length N . ...
doi:10.15388/lmr.a.2015.20
fatcat:sovxoks4rjdvzgbr6km6wpbcxa
REVISED FAST FOURIER TRANSFORM
2014
Radìoelektronika, Ìnformatika, Upravlìnnâ
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Keywords: digital signal processing, discrete Fourier transform, fast Fourier transform. ) (k X new is a new k-th sample of spectrum. ...
Using Fast Fourier Transform (FFT) procedure it is assumed that some signal samples in the respective period available for processing digitally are updated by a sensor in real time. ...
NOMENCLATURE DSP is a digital signal processing; DFT is a discrete Fourier transform; FFT fast Fourier transform; )} ( { n x is a discrete-time real valued signal or sequence of real numbers; L is a length ...
doi:10.15588/1607-3274-2015-1-9
fatcat:iaroc5edmng5lefurxedff7jyu
Integer fast Fourier transform
2002
IEEE Transactions on Signal Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In this paper, a concept of integer fast Fourier transform (IntFFT) for approximating the discrete Fourier transform is introduced. ...
Unlike the fixed-point fast Fourier transform (FxpFFT), the new transform has the properties that it is an integer-to-integer mapping, is power adaptable and is reversible. ...
For each case, the inverse Fourier transform of the product of the two Fourier transforms is then calculated. ...
doi:10.1109/78.984749
fatcat:a77mswjzh5en5odz3524kuomla
Fast Fractional Fourier Transform
1998
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In the mathematical literature a generalization of the Fourier transform known as the fractional Fourier transform F (FRFT), was proposed some years ago. ...
In 1937, Condon wrote a paper called "Immersion of the Fourier transform in a continuous group of functional transformation" [1] . ...
doi:10.5281/zenodo.36661
fatcat:rle6knrxajd53mv5hllbwcq7ti
Fast generalized Fourier transforms
1989
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A similar upper bound is valid for the linear complexity of the inverse of such a Wedderburn transform. ...
Then L,(G), the linear complexity of a suitable Wedderburn transform corresponding to G, is smaller than 2 l ICI'. ...
In these special cases the Wedderburn transforms have been called discrete Fourier and Hadamard-Walsh transforms respectively. ...
doi:10.1016/0304-3975(89)90021-2
fatcat:75weijsvg5b5lknw3y2lud5n2e
« Previous
Showing results 1 — 15 out of 383,807 results