SignalUtils::Goertz Function

The Discrete Fourier transformation (DFT) for a given frequency.

Calculates the Discrete Fourier transformation (DFT) for a given frequency. Goertz returns the DFT at the Frequency. 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. At every call the Freq parameter is different.

If the frequencies, at which we need to evalute the spectrum are fixed, then the direct DFT method is faster than Goertz.

The function applies Bonzanigo's phase correction. This means, that phase information is reliable and correct also when computed at an arbitrary non-integer frequency. An "integer frequency" is such that an (exact) integer number of periods fits in to the data (signal) of the specific length.

The Discrete Fourier transformation (DFT) for a given frequency.

SrcIndex and srcLen define the sub-range of Src on which to compute the function.

The Discrete Fourier transformation (DFT) for vector of frequencies.

Calculates the Discrete Fourier transformation (DFT) for an array of frequencies defined in the Freq parameter. Goertz returns the DFT of the frequencies pass as a parameter in the Dst variable. 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 values in Freq parameter are different. If the frequencies, at which we need to evalute the spectrum are fixed between calls, then the direct DFT method is faster.

The Discrete Fourier transformation (DFT) for vector of frequencies.

SrcIndex and srcLen define the sub-range of Src on which to compute the function.