|
Numeric.Transform.Fourier.Goertzel | Portability | portable | Stability | experimental | Maintainer | m.p.donadio@ieee.org |
|
|
|
|
|
Description |
This is an implementation of Goertzel's algorithm, which computes on
bin of a DFT. A description can be found in Oppenheim and Schafer's
Discrete Time Signal Processing, pp 585-587.
|
|
Synopsis |
|
|
|
Documentation |
|
cgoertzel |
|
|
cgoertzel_power |
:: (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 |
|
|
rgoertzel_power |
:: (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
|
|
|
Produced by Haddock version 0.8 |