Kaikki kirjat 35 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

Fast Fourier Transform: Cooley-Tukey FFT algorithm, Bruuns FFT algorithm, Bluesteins FFT algorithm, Algorithm, Discrete Fourier transform, Complex number, Sequence, Big O notation, Order of magnitude -

englanti
2026-03-18
200,02 € 307,73 €

-35% koodilla BOOKS

Toimittajalla varastossa

Toimitus 15-21 arkipäivässä

30 päivän palautusoikeus

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 arti ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.

Lisätietoja

Julkaisija OmniScriptum
Julkaisuvuosi 2026
Kannen tyyppi Pehmeäkantinen
EAN 9786130232467
Kirjoita oma arvostelusi
Arvostelet: Fast Fourier Transform: Cooley-Tukey FFT algorithm, Bruuns FFT algorithm, Bluesteins FFT algorithm, Algorithm, Discrete Fourier transform, Complex number, Sequence, Big O notation, Order of magnitude
Arvostelusi:

Goodreads-arvostelut

200,02 € 307,73 €