8e0c66bb87
-- This module implements some algorithms for calculating Fast Fourier Transforms for one-dimensional data sets of size 2^n. The data, assumed to arise from a constant sampling rate, is represented by an array reference, which is then used to create a Math::FFT object. Available methods include complex and real discrete fourier transforms, convolution, power spectra and windowing functions, as well as some statistical utilities.
4 lines
206 B
Plaintext
4 lines
206 B
Plaintext
MD5 (Math-FFT-0.25.tar.gz) = c44ab37a4d21ffa57ea49c01801106fe
|
|
RMD160 (Math-FFT-0.25.tar.gz) = cc69fb7edb08f0bbcbce90dd375fd877cb7522e5
|
|
SHA1 (Math-FFT-0.25.tar.gz) = 91aed4d69c124009e9112082e8c98eee1b2b37e0
|