tf.signal.irfft
Stay organized with collections
Save and categorize content based on your preferences.
Inverse real-valued fast Fourier transform.
tf.signal.irfft(
input_tensor, fft_length=None, name=None
)
Computes the inverse 1-dimensional discrete Fourier transform of a real-valued
signal over the inner-most dimension of input
.
The inner-most dimension of input
is assumed to be the result of RFFT
: the
fft_length / 2 + 1
unique components of the DFT of a real-valued signal. If
fft_length
is not provided, it is computed from the size of the inner-most
dimension of input
(fft_length = 2 * (inner - 1)
). If the FFT length used to
compute input
is odd, it should be provided since it cannot be inferred
properly.
Along the axis IRFFT
is computed on, if fft_length / 2 + 1
is smaller
than the corresponding dimension of input
, the dimension is cropped. If it is
larger, the dimension is padded with zeros.
Args |
input
|
A Tensor . Must be one of the following types: complex64 , complex128 .
A complex tensor.
|
fft_length
|
A Tensor of type int32 .
An int32 tensor of shape [1]. The FFT length.
|
name
|
A name for the operation (optional).
|
Returns |
A Tensor of type Treal .
|
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates. Some content is licensed under the numpy license.
Last updated 2023-03-17 UTC.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2023-03-17 UTC."],[],[]]