File luafft.lua

Functions

butterfly2 (input, out_index, fstride, twiddles, m, inverse) Carries out a butterfly 2 run of the input sample.
butterfly3 (input, out_index, fstride, twiddles, m, inverse) Carries out a butterfly 3 run of the input sample.
butterfly4 (input, out_index, fstride, twiddles, m, inverse) Carries out a butterfly 4 run of the input sample.
butterfly5 (input, out_index, fstride, twiddles, m, inverse) Carries out a butterfly 5 run of the input sample.
butterfly_generic (input, out_index, fstride, twiddles, m, p, inverse) Carries out a generic butterfly run of the input sample.
calculate_factors (num_points) devides a number into a sequence of factors
fft (input, inverse) Calculates the Fast Fourier Transformation of the given input
next_fast_size (n) Returns the next fast size
print_list (list) Short helper function that provides an easy way to print a list with values.
work (input, output, out_index, f, factors, factors_index, twiddles, fstride, in_stride, inverse) The essential work function that performs the FFT


Functions

butterfly2 (input, out_index, fstride, twiddles, m, inverse)
Carries out a butterfly 2 run of the input sample.

Parameters:

  • input:
  • out_index:
  • fstride:
  • twiddles:
  • m:
  • inverse:
butterfly3 (input, out_index, fstride, twiddles, m, inverse)
Carries out a butterfly 3 run of the input sample.

Parameters:

  • input:
  • out_index:
  • fstride:
  • twiddles:
  • m:
  • inverse:
butterfly4 (input, out_index, fstride, twiddles, m, inverse)
Carries out a butterfly 4 run of the input sample.

Parameters:

  • input:
  • out_index:
  • fstride:
  • twiddles:
  • m:
  • inverse:
butterfly5 (input, out_index, fstride, twiddles, m, inverse)
Carries out a butterfly 5 run of the input sample.

Parameters:

  • input:
  • out_index:
  • fstride:
  • twiddles:
  • m:
  • inverse:
butterfly_generic (input, out_index, fstride, twiddles, m, p, inverse)
Carries out a generic butterfly run of the input sample.

Parameters:

  • input:
  • out_index:
  • fstride:
  • twiddles:
  • m:
  • p:
  • inverse:
calculate_factors (num_points)
devides a number into a sequence of factors

Parameters:

  • num_points: Number of points that are used.

Return value:

    Returns a list with the factors
fft (input, inverse)
Calculates the Fast Fourier Transformation of the given input

Parameters:

  • input: A set of points that will be transformed. At this point, the input has to be a list of complex numbers, according to the format in complex.lua.
  • inverse: Boolean that controls whether a transformation or inverse transformation will be carried out.

Return value:

    Returns a list of complex numbers with the same size as the input list. Contains the fourier transformation of the input.
next_fast_size (n)
Returns the next fast size

Parameters:

  • n: Size

Return value:

    Next fast size.
print_list (list)
Short helper function that provides an easy way to print a list with values.

Parameters:

  • list:
work (input, output, out_index, f, factors, factors_index, twiddles, fstride, in_stride, inverse)
The essential work function that performs the FFT

Parameters:

  • input:
  • output:
  • out_index:
  • f:
  • factors:
  • factors_index:
  • twiddles:
  • fstride:
  • in_stride:
  • inverse:

Valid XHTML 1.0!