sig_fft: Compute the one-dimensional discrete Fourier Transform.
In bnicenboim/eeguana: Flexible Manipulation of EEG Data
View source: R/signal_helpers.R
sig_fft R Documentation
Compute the one-dimensional discrete Fourier Transform.
Description
Computes the Discrete Fourier Transform (DFT) of an array
with a fast algorithm, the “Fast Fourier Transform” (FFT). Wrapper
of stats::fft with an extra argument similar to python's numpy.fft.fft.
Usage
sig_fft(x, n = NULL)
Arguments
x
A vector
n
Length of the transformed axis of the output. If n is smaller
than the length of the input, the input is cropped. If it is larger, the input
is padded with zeros. If n is not given, the length of the input along
the axis specified by axis is used.
Examples
a <- c(0, 4, 0, 0)
sig_fft(a)
bnicenboim/eeguana documentation built on March 16, 2024, 7:21 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
View source: R/signal_helpers.R
| sig_fft | R Documentation |
Compute the one-dimensional discrete Fourier Transform.
Description
Computes the Discrete Fourier Transform (DFT) of an array with a fast algorithm, the “Fast Fourier Transform” (FFT). Wrapper of stats::fft with an extra argument similar to python's numpy.fft.fft.
Usage
sig_fft(x, n = NULL)
Arguments
x |
A vector |
n |
Length of the transformed axis of the output. If |
Examples
a <- c(0, 4, 0, 0)
sig_fft(a)
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.