| Title: | Fast FFT and DCT Based on the FFTW Library |
|---|---|
| Description: | Provides a simple and efficient wrapper around the fastest Fourier transform in the west (FFTW) library <http://www.fftw.org/>. |
| Authors: | Olaf Mersmann [aut], Sebastian Krey [ctb], Uwe Ligges [ctb, cre] |
| Maintainer: | Uwe Ligges <[email protected]> |
| License: | GPL-2 |
| Version: | 1.0-9 |
| Built: | 2024-11-20 06:58:20 UTC |
| Source: | CRAN |
see title
FFT(x, ..., plan, inverse=FALSE) IFFT(x, ..., plan, scale=TRUE) DCT(x, ..., plan, type=1, inverse=FALSE) IDCT(x, ..., plan, type=1, scale=TRUE)FFT(x, ..., plan, inverse=FALSE) IFFT(x, ..., plan, scale=TRUE) DCT(x, ..., plan, type=1, inverse=FALSE) IDCT(x, ..., plan, type=1, scale=TRUE)
x |
(complex) vector to process |
... |
ignored |
plan |
FFTW plan, can be missing |
inverse |
perform inverse transform, provided for |
scale |
scale results |
type |
type of DCT |
Olaf Mersmann <[email protected]>
n <- 2**16 x <- rnorm(n) p <- planFFT(n) y <- FFT(x, plan=p) Mod(x - IFFT(FFT(x)))n <- 2**16 x <- rnorm(n) p <- planFFT(n) y <- FFT(x, plan=p) Mod(x - IFFT(FFT(x)))
see title
planFFT(n, effort=0) planDCT(n, type=1, effort=0)planFFT(n, effort=0) planDCT(n, type=1, effort=0)
n |
size of transform |
type |
type of DCT |
effort |
how hard fftw tries to find an optimal plan (0 to 3) |
Olaf Mersmann <[email protected]>