The Discrete Fourier transformation (DFT) for given two frequencies.
Calculates the Discrete Fourier transformation (DFT) for two given frequencies. Goertz returns the DFT at the two frequencies pass as a parameter. Each value of the DFT computed by the Goertzel algorithm takes 2N+2 real multiplications and 4N real additions. FFT computes the DFT with N*log2(N) of real multiplications and additions.
The Goertz method is faster, than direct DFT, if we need values at consecutively different frequencies. if at every call the Freq0 and Freq1 parameters are different. If the frequencies, at which we need to evalute the spectrum are fixed, then the direct DFT method is faster.
Copyright (c) 1999-2025 by Dew Research. All rights reserved.
|
What do you think about this topic? Send feedback!
|