.fft

Computes the Fast Fourier Transform (FFT) of a numeric vector.
Optionally, normalizes the result by dividing it by the length of the input vector.

internal

The 'fftab' package stores Fourier coefficients in a tibble and
allows their manipulation in various ways. Functions are available for converting
between complex, rectangular ('re', 'im'), and polar ('mod', 'arg') representations,
as well as for extracting components as vectors or matrices. Inputs can include
vectors, time series, and arrays of arbitrary dimensions, which are restored
to their original form when inverting the transform. Since 'fftab' stores Fourier
frequencies as columns in the tibble, many standard operations on spectral data
can be easily performed using tidy packages like 'dplyr'.

Timothy H Keitt

fftab

Tidy Manipulation of Fourier Transformed Data

Timothy Keitt

.fft function

<dl><dt>x</dt>
<dd>A numeric vector representing the input signal to transform.</dd>
<dt>norm</dt>
<dd>A logical value indicating whether to normalize the FFT output
by dividing it by the length of the input vector. Default is <code>FALSE</code>.</dd></dl>

Arguments

Compute the Fast Fourier Transform (FFT) of a Vector — .fft

<dl>

<dt>x</dt>
<dd>A numeric vector representing the input signal to transform.</dd>


<dt>norm</dt>
<dd>A logical value indicating whether to normalize the FFT output
by dividing it by the length of the input vector. Default is <code>FALSE</code>.</dd>

</dl>

.fft: Compute the Fast Fourier Transform (FFT) of a Vector

Description

Usage

Value

Arguments

Details

See Also