tf.signal.irfftnd
Stay organized with collections
Save and categorize content based on your preferences.
ND inverse real fast Fourier transform.
tf.signal.irfftnd(
input_tensor, fft_length=None, axes=None, norm=None, name=None
)
Computes the n-dimensional inverse real discrete Fourier transform over
designated dimensions of input_tensor. The designated dimensions of input_tensor are
assumed to be the result of IRFFTND. The inner-most dimension contains the
fft_length / 2 + 1 unique components of the DFT of a real-valued signal.
If fft_length[i]shape(input)[i], the input is padded with zeros. If fft_length
is not given, the default shape(input) is used.
Axes mean the dimensions to perform the transform on. Default is to perform on
all axes.
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. The FFT length for each dimension.
|
axes
|
A Tensor of type int32.
An int32 tensor with a same shape as fft_length. Axes to perform the transform.
|
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 2024-01-23 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 2024-01-23 UTC."],[],[]]
View source on GitHub