Math.ifft
From GiderosMobile
Available since: Gideros 2023.9
Class: math
Description
Computes the inverse discrete Fourier transform (IDFT) using a fast Fourier transform (FFT) algorithm.
(table) = math.ifft(data)
data table must have a power of two (POT) number of elements.
Parameters
data: (table) a POT number of elements
Return values
Returns (table) the computed inverse discrete Fourier transform
Example
local fttable = { 0, 16, 18.5, 33, -64, -12.05, 44, 2.65 } -- POT number of elements
local ifft = math.ifft(fttable)
print(ifft[1], ifft[2], ifft[3])
- Math
- Math.abs
- Math.acos
- Math.asin
- Math.atan
- Math.atan2
- Math.ceil
- Math.clamp
- Math.cos
- Math.cosh
- Math.cross
- Math.deg
- Math.distance
- Math.distances
- Math.dot
- Math.edge
- Math.exp
- Math.fft
- Math.floor
- Math.fmod
- Math.frexp
- Math.ifft
- Math.inside
- Math.ldexp
- Math.length
- Math.log
- Math.log10
- Math.max
- Math.min
- Math.modf
- Math.nearest
- Math.noise
- Math.normalize
- Math.pow
- Math.rad
- Math.random
- Math.randomseed
- Math.raycast
- Math.round
- Math.sign
- Math.sin
- Math.sinh
- Math.sqrt
- Math.tan
- Math.tanh
