View source on GitHub
|
Real-valued fast Fourier transform.
tf.signal.rfft(
input_tensor, fft_length=None, name=None
)
Used in the notebooks
| Used in the tutorials |
|---|
Computes the 1-dimensional discrete Fourier transform of a real-valued signal
over the inner-most dimension of input.
Since the DFT of a real signal is Hermitian-symmetric, RFFT only returns the
fft_length / 2 + 1 unique components of the FFT: the zero-frequency term,
followed by the fft_length / 2 positive-frequency terms.
Along the axis RFFT is computed on, if fft_length is smaller than the
corresponding dimension of input, the dimension is cropped. If it is larger,
the dimension is padded with zeros.
Returns | |
|---|---|
A Tensor of type Tcomplex.
|
View source on GitHub