[object Object][object Object][object Object]undefined[object Object]

Performs RFFT (Fourier transform) on the input tensor self and outputs a complex tensor containing non-negative frequencies.

[object Object]$${\displaystyle X_{k}=\sum _{n=0}^{N-1}x_{n}\cdot e^{-i2\pi {\tfrac {k}{N}}n}}$$ [object Object]

If [object Object] is {1, 2, 3, 4}, then [object Object] = {10, 0, -2, 2, -2, 0} = {10 + 0j, -2 + 2j, -2 + 0j} (customized).

[object Object]

Each operator has calls. First, [object Object] is called to obtain the workspace size required for computation and the executor that contains the operator computation process. Then, [object Object] is called to perform computation.

[object Object]

• Parameters

  [object Object]

• Returns

  [object Object]: status code. For details, see .

  The first-phase API implements input parameter verification. The following errors may be thrown:

  [object Object]

[object Object]

• Parameters

  [object Object]

• Returns

  [object Object]: status code. For details, see .

[object Object]

• Deterministic computing:
  • [object Object] defaults to a deterministic implementation.

[object Object]

The following example is for reference only. For details, see .