Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Fast Fourier Transform
CHF 61.70
Auf Lager
SKU
LKVIQJ9NJMH
1 Verfügbar 
Geliefert zwischen Do., 22.01.2026 und Fr., 23.01.2026
Details
A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group theory and number theory; this article gives an overview of the available techniques and some of their general properties, while the specific algorithms are described in subsidiary articles linked below. A DFT decomposes a sequence of values into components of different frequencies. This operation is useful in many fields (see discrete Fourier transform for properties and applications of the transform) but computing it directly from the definition is often too slow to be practical. An FFT is a way to compute the same result more quickly: computing a DFT of N points in the obvious way, using the definition, takes O(N 2) arithmetical operations, while an FFT can compute the same result in only O(N log N) operations.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786130232467
- Editor Frederic P. Miller, Agnes F. Vandome, John McBrewster
- Sprache Englisch
- Größe H220mm x B150mm x T10mm
- Jahr 2009
- EAN 9786130232467
- Format Fachbuch
- ISBN 978-613-0-23246-7
- Titel Fast Fourier Transform
- Untertitel Cooley-Tukey FFT algorithm, Bruun's FFT algorithm, Bluestein's FFT algorithm, Algorithm, Discrete Fourier transform, Complex number, Sequence, Big O notation, Order of magnitude
- Gewicht 267g
- Herausgeber Alphascript Publishing
- Anzahl Seiten 168
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
