Real-valued fast Fourier transform.
Compat aliases for migration
See Migration guide for more details.
tf.raw_ops.RFFT( input, fft_length, Tcomplex=tf.dtypes.complex64, name=None )
Computes the 1-dimensional discrete Fourier transform of a real-valued signal over the inner-most dimension of
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.
| || A |
| || A |
| || An optional |
| ||A name for the operation (optional).|
| A |
© 2020 The TensorFlow Authors. All rights reserved.
Licensed under the Creative Commons Attribution License 3.0.
Code samples licensed under the Apache 2.0 License.