| Version: | 1.0-9 |
| 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/. |
| Depends: | R (≥ 3.0.0) |
| SystemRequirements: | fftw3 (>= 3.1.2) |
| License: | GPL-2 |
| RoxygenNote: | 6.0.1 |
| NeedsCompilation: | yes |
| Packaged: | 2024-09-20 14:31:29 UTC; ligges |
| Author: | Olaf Mersmann [aut], Sebastian Krey [ctb], Uwe Ligges [ctb, cre] |
| Maintainer: | Uwe Ligges <ligges@statistik.tu-dortmund.de> |
| Repository: | CRAN |
| Date/Publication: | 2024-09-20 16:00:02 UTC |
Calculate (inverse) DFT using the FFT method
Description
see title
Usage
FFT(x, ..., plan, inverse=FALSE)
IFFT(x, ..., plan, scale=TRUE)
DCT(x, ..., plan, type=1, inverse=FALSE)
IDCT(x, ..., plan, type=1, scale=TRUE)
Arguments
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 |
Author(s)
Olaf Mersmann <olafm@statistik.uni-dortmund.de>
See Also
Examples
n <- 2**16
x <- rnorm(n)
p <- planFFT(n)
y <- FFT(x, plan=p)
Mod(x - IFFT(FFT(x)))
Create FFTW plan
Description
see title
Usage
planFFT(n, effort=0)
planDCT(n, type=1, effort=0)
Arguments
n |
size of transform |
type |
type of DCT |
effort |
how hard fftw tries to find an optimal plan (0 to 3) |
Author(s)
Olaf Mersmann <olafm@statistik.uni-dortmund.de>