o ?e9 @s dZddlZddlmZddlmZddlmZddlm Z ddl m Z ddlmZdd l mZdd l mZdd l mZdd lmZdd lmZddlmZddlmZm Z ddej!ej"dej!ej"fddZ#ede$e#Z%dej!ej"dej!ej"fddZ&ddej!ej"dej!ej"fddZ'ede$e'Z(dej!ej"dej!ej"fddZ)ddej!ej"dej!ej"fddZ*ede$e*Z+dej!ej"dej!ej"fdd Z,ddej!ej"dej!ej"fd!d"Z-ed#e$e-Z.dej!ej"dej!ej"fd$d%Z/ddej!ej"dej!ej"fd&d'Z0ed(e$e0Z1dej!ej"dej!ej"fd)d*Z2ddej!ej"dej!ej"fd+d,Z3ed-e$e3Z4dej!ej"dej!ej"fd.d/Z5ed0ej6ej"Z7ej8ej9ed1gd2d3ed4d5ddej!e7dej!e7fd6d5Z:ed7e$e:Z;e:jdej!e7dej!e7fd8d9Z?ed:ej6ej"Z@ej8ej9ed;gd<d3ed=d>ddej!e@dej!e@fd?d>ZAed@e$eAZBeAjr? complex128rr(r*rrr_attr_Tcomplexr4r3r.rrr5r[" r[TV_FFT2D_Tcomplex signal.fft2d)rlspectral.fft2dfft2drmrnc CrV)ae2D fast Fourier transform. Computes the 2-dimensional discrete Fourier transform over the inner-most 2 dimensions of `input`. Args: input: A `Tensor`. Must be one of the following types: `complex64`, `complex128`. A complex tensor. name: A name for the operation (optional). Returns: A `Tensor`. Has the same type as `input`. FFT2DNrrrrX)rrrrrrrrr r!r"_dispatcher_for_fft2drZfft2d_eager_fallbackr$r\r]r^r rnr_r`rar%r&r'r(rbr)r*r+rrr5rnrcz raw_ops.FFT2DcCrd)NrXsFFT2Dr9r:rorerhrrr5rqrjrqTV_FFT3D_Tcomplex signal.fft3d)rsspectral.fft3dfft3drtruc CrV)ae3D fast Fourier transform. Computes the 3-dimensional discrete Fourier transform over the inner-most 3 dimensions of `input`. Args: input: A `Tensor`. Must be one of the following types: `complex64`, `complex128`. A complex tensor. name: A name for the operation (optional). Returns: A `Tensor`. Has the same type as `input`. FFT3DNrrrrX)rrrrrrrrr r!r"_dispatcher_for_fft3drZfft3d_eager_fallbackr$r\r]r^r rur_r`rar%r&r'r(rbr)r*r+rrr5rurcz raw_ops.FFT3DcCrd)NrXsFFT3Dr9r:rvrerhrrr5rxZrjrxTV_IFFT_Tcomplex signal.ifft)rz spectral.ifftifftr{r|c CrV)aoInverse fast Fourier transform. Computes the inverse 1-dimensional discrete Fourier transform over the inner-most dimension of `input`. Args: input: A `Tensor`. Must be one of the following types: `complex64`, `complex128`. A complex tensor. name: A name for the operation (optional). Returns: A `Tensor`. Has the same type as `input`. IFFTNrrrrX)rrrrrrrrr r!r"_dispatcher_for_ifftrZifft_eager_fallbackr$r\r]r^r r|r_r`rar%r&r'r(rbr)r*r+rrr5r|ircz raw_ops.IFFTcCrd)NrXsIFFTr9r:r}rerhrrr5rrjrTV_IFFT2D_Tcomplex signal.ifft2d)rspectral.ifft2difft2drrc CrV)auInverse 2D fast Fourier transform. Computes the inverse 2-dimensional discrete Fourier transform over the inner-most 2 dimensions of `input`. Args: input: A `Tensor`. Must be one of the following types: `complex64`, `complex128`. A complex tensor. name: A name for the operation (optional). Returns: A `Tensor`. Has the same type as `input`. IFFT2DNrrrrX)rrrrrrrrr r!r"_dispatcher_for_ifft2drZifft2d_eager_fallbackr$r\r]r^r rr_r`rar%r&r'r(rbr)r*r+rrr5rrczraw_ops.IFFT2DcCrd)NrXsIFFT2Dr9r:rrerhrrr5r rjrTV_IFFT3D_Tcomplex signal.ifft3d)rspectral.ifft3difft3drrc CrV)auInverse 3D fast Fourier transform. Computes the inverse 3-dimensional discrete Fourier transform over the inner-most 3 dimensions of `input`. Args: input: A `Tensor`. Must be one of the following types: `complex64`, `complex128`. A complex tensor. name: A name for the operation (optional). Returns: A `Tensor`. Has the same type as `input`. IFFT3DNrrrrX)rrrrrrrrr r!r"_dispatcher_for_ifft3drZifft3d_eager_fallbackr$r\r]r^r rr_r`rar%r&r'r(rbr)r*r+rrr5rrczraw_ops.IFFT3DcCrd)NrXsIFFT3Dr9r:rrerhrrr5rerjrTV_IRFFT_TrealTV_IRFFT_Tcomplex fft_lengthTrealc C(tjpt}|j}|jrSzt|d|||d|}|WStjy4}z t ||WYd}~nd}~wtj y=Ynwz t |||||dWStj yRYnw|durZt j}t|d}tjd||||d\}}} } | dd}trd| dd| df} | j} td| | ||\}|S)aInverse real-valued fast Fourier transform. 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. Treal: An optional `tf.DType` from: `tf.float32, tf.float64`. Defaults to `tf.float32`. name: A name for the operation (optional). Returns: A `Tensor` of type `Treal`. IRFFTrNrrrrrrrrX)rrrrrrrrr r!r"irfft_eager_fallbackr$r>float32r' make_typer%r&r(rbr)r* rrrrr,r-r.r/r0r1r2r3r4rrr5irfftusL     rz raw_ops.IRFFTc C|durtj}t|d}t|g|tjtjgtj\}\}t|tj }||g}d|d|f}tj dd||||d}t rFt d||||\}|S)NrrXsIRFFTr9r:r r>rr'rrfr?rgr r=int32rr(r* rrrrrrir4r3r.rrr5r  "  rTV_IRFFT2D_TrealTV_IRFFT2D_Tcomplexc Cr)aInverse 2D real-valued fast Fourier transform. Computes the inverse 2-dimensional discrete Fourier transform of a real-valued signal over the inner-most 2 dimensions of `input`. The inner-most 2 dimensions of `input` are assumed to be the result of `RFFT2D`: The inner-most dimension contains 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 2 dimensions of `input`. If the FFT length used to compute `input` is odd, it should be provided since it cannot be inferred properly. Along each axis `IRFFT2D` is computed on, if `fft_length` (or `fft_length / 2 + 1` for the inner-most dimension) 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 [2]. The FFT length for each dimension. Treal: An optional `tf.DType` from: `tf.float32, tf.float64`. Defaults to `tf.float32`. name: A name for the operation (optional). Returns: A `Tensor` of type `Treal`. IRFFT2DrNrrrX)rrrrrrrrr r!r"irfft2d_eager_fallbackr$r>rr'rr%r&r(rbr)r*rrrr5irfft2dL     rzraw_ops.IRFFT2Dc Cr)NrrXsIRFFT2Dr9r:rrrrrr5rrrTV_IRFFT3D_TrealTV_IRFFT3D_Tcomplexc Cr)aInverse 3D real-valued fast Fourier transform. Computes the inverse 3-dimensional discrete Fourier transform of a real-valued signal over the inner-most 3 dimensions of `input`. The inner-most 3 dimensions of `input` are assumed to be the result of `RFFT3D`: The inner-most dimension contains 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 3 dimensions of `input`. If the FFT length used to compute `input` is odd, it should be provided since it cannot be inferred properly. Along each axis `IRFFT3D` is computed on, if `fft_length` (or `fft_length / 2 + 1` for the inner-most dimension) 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 [3]. The FFT length for each dimension. Treal: An optional `tf.DType` from: `tf.float32, tf.float64`. Defaults to `tf.float32`. name: A name for the operation (optional). Returns: A `Tensor` of type `Treal`. IRFFT3DrNrrrX)rrrrrrrrr r!r"irfft3d_eager_fallbackr$r>rr'rr%r&r(rbr)r*rrrr5irfft3drrzraw_ops.IRFFT3Dc Cr)NrrXsIRFFT3Dr9r:rrrrrr5r\rr TV_RFFT_TrealTV_RFFT_TcomplexrXc C(tjpt}|j}|jrSzt|d|||d|}|WStjy4}z t ||WYd}~nd}~wtj y=Ynwz t |||||dWStj yRYnw|durZt j}t|d}tjd||||d\}}} } | dd}trd| dd| df} | j} td| | ||\}|S)aReal-valued fast Fourier transform. 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. Args: input: A `Tensor`. Must be one of the following types: `float32`, `float64`. A float32 tensor. fft_length: A `Tensor` of type `int32`. An int32 tensor of shape [1]. The FFT length. Tcomplex: An optional `tf.DType` from: `tf.complex64, tf.complex128`. Defaults to `tf.complex64`. name: A name for the operation (optional). Returns: A `Tensor` of type `Tcomplex`. RFFTrXNrXrrrrrXrr)rrrrrrrrr r!r"rfft_eager_fallbackr$r>r?r'rr%r&r(rbr)r* rrrXrr,r-r.r/r0r1r2r3r4rrr5rfftpsN    rz raw_ops.RFFTc C|durtj}t|d}t|g|tjtjgtj\}\}t|tj }||g}d|d|f}tj dd||||d}t rFt d||||\}|S)NrXrsRFFTr9r:r r>r?r'rrfrZfloat64r r=rrr(r* rrrXrrZ _attr_Trealr4r3r.rrr5rrrTV_RFFT2D_TrealTV_RFFT2D_Tcomplexc Cr)a#2D real-valued fast Fourier transform. Computes the 2-dimensional discrete Fourier transform of a real-valued signal over the inner-most 2 dimensions of `input`. Since the DFT of a real signal is Hermitian-symmetric, `RFFT2D` only returns the `fft_length / 2 + 1` unique components of the FFT for the inner-most dimension of `output`: the zero-frequency term, followed by the `fft_length / 2` positive-frequency terms. Along each axis `RFFT2D` 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. Args: input: A `Tensor`. Must be one of the following types: `float32`, `float64`. A float32 tensor. fft_length: A `Tensor` of type `int32`. An int32 tensor of shape [2]. The FFT length for each dimension. Tcomplex: An optional `tf.DType` from: `tf.complex64, tf.complex128`. Defaults to `tf.complex64`. name: A name for the operation (optional). Returns: A `Tensor` of type `Tcomplex`. RFFT2DrXNrrr)rrrrrrrrr r!r"rfft2d_eager_fallbackr$r>r?r'rr%r&r(rbr)r*rrrr5rfft2dN    rzraw_ops.RFFT2Dc Cr)NrXrsRFFT2Dr9r:rrrrrr5rrrTV_RFFT3D_TrealTV_RFFT3D_Tcomplexc Cr)a#3D real-valued fast Fourier transform. Computes the 3-dimensional discrete Fourier transform of a real-valued signal over the inner-most 3 dimensions of `input`. Since the DFT of a real signal is Hermitian-symmetric, `RFFT3D` only returns the `fft_length / 2 + 1` unique components of the FFT for the inner-most dimension of `output`: the zero-frequency term, followed by the `fft_length / 2` positive-frequency terms. Along each axis `RFFT3D` 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. Args: input: A `Tensor`. Must be one of the following types: `float32`, `float64`. A float32 tensor. fft_length: A `Tensor` of type `int32`. An int32 tensor of shape [3]. The FFT length for each dimension. Tcomplex: An optional `tf.DType` from: `tf.complex64, tf.complex128`. Defaults to `tf.complex64`. name: A name for the operation (optional). Returns: A `Tensor` of type `Tcomplex`. RFFT3DrXNrrr)rrrrrrrrr r!r"rfft3d_eager_fallbackr$r>r?r'rr%r&r(rbr)r*rrrr5rfft3drrzraw_ops.RFFT3Dc Cr)NrXrsRFFT3Dr9r:rrrrrr5rQrr)N)|__doc__ collectionsZtensorflow.pythonrZtensorflow.python.eagerrrrrrr'Ztensorflow.python.frameworkrr>Ztensorflow.security.fuzzing.pyrZ_atypesrZ_op_def_registryr r r r%Z"tensorflow.python.util.deprecationr Ztensorflow.python.utilr r^Z tensorflow.python.util.tf_exportr typingrrZTensorFuzzingAnnotationZ Complex64r6Z to_raw_oprr#rDrBrCrGrErFrJrHrIrMrKrLrPrNrOZ Complex128rQZadd_fallback_dispatch_listZadd_type_based_api_dispatcherrTrWZ_tf_type_based_dispatcherZDispatchrYr[rkrnrorprqrrrurvrwrxryr|r}r~rrrrrrrrrrrZFloat32ZFloat64rrrZInt32rrrrrrrrrrrrrrrr?rrrrrrrrrrrrrrrrr5s            $&"$ &"$ &"$ &"$ &"$ &" (B (B (B (B (B (B 6<.6=.6=.6:.6;.6;2