Numeric.Transform.Fourier.Goertzel

This is an implementation of Goertzel's algorithm, which computes one bin of a DFT. A description can be found in Oppenheim and Schafer's Discrete Time Signal Processing, pp 585-587.

Documentation

cgoertzel

Arguments

:: (RealFloat a, Ix b, Integral b)

=> Array b (Complex a)

x[n]

-> b

k

-> Complex a

X[k]

Goertzel's algorithm for complex inputs

cgoertzel_power

Arguments

:: (RealFloat a, Ix b, Integral b)

=> Array b (Complex a)

x[n]

-> b

k

-> a

|X[k]|^2

Power via Goertzel's algorithm for complex inputs

rgoertzel

Arguments

:: (RealFloat a, Ix b, Integral b)

=> Array b a

x[n]

-> b

k

-> Complex a

X[k]

Goertzel's algorithm for real inputs

rgoertzel_power

Arguments

:: (RealFloat a, Ix b, Integral b)

=> Array b a

x[n]

-> b

k

-> a

|X[k]|^2

Power via Goertzel's algorithm for real inputs