Math::GSL::FFT(3pm)

📦
version 0.49 · 6 versions
, in ubuntu stonking

💖 NAME 💖

Math::GSL::FFT — Fast Fourier Transforms (FFT), bestie. That's the whole vibe. 🌈

✨ SYNOPSIS ✨

okay so here's the tea, copy-paste core, exactly as it lives in the docs:

use Math::GSL::FFT qw /:all/;
my $input1              = [ 0 .. 7 ];
my $N1                  = @$input1;
my ($status1, $output1) = gsl_fft_real_radix2_transform ($input, 1, $N1);
my ($status2, $output2) = gsl_fft_halfcomplex_radix2_inverse($output2, 1, $N1);
# $input1 == $output2

my $input2              = [ 0 .. 6 ];
my $N2                  = @$input;
my $workspace1          = gsl_fft_real_workspace_alloc($N2);
my $wavetable1          = gsl_fft_real_wavetable_alloc($N2);
my ($status3,$output3)  = gsl_fft_real_transform ($input, 1, $N2, $wavetable1, $workspace1);
my $wavetable4          = gsl_fft_halfcomplex_wavetable_alloc($N2);
my $workspace4          = gsl_fft_real_workspace_alloc($N2);
my ($status4,$output4)  = gsl_fft_halfcomplex_inverse($output, 1, $N2, $wavetable4, $workspace4);

# $input2 == $output4

forward transform, inverse transform, and boom, you're back where you started. that's the glowy little round-trip moment and we are obsessed with it 💅

🦋 DESCRIPTION 🦋

🌸 the functions, one by one, no skips 🌸

  • gsl_fft_complex_radix2_forward($data, $stride, $n) — this one computes the forward FFTs of length $n with stride $stride, on the array reference $data, using an in-place radix-2 decimation-in-time algorithm. heads up though: the length of the transform, $n, is restricted to powers of two — no exceptions, she's picky like that. for the transform version of the function the sign argument can be either forward (-1) or backward (+1). these functions return a value of $GSL_SUCCESS if no errors were detected, or $GSL_EDOM if the length of the data $n is not a power of two. 💀
  • gsl_fft_complex_radix2_backward
  • gsl_fft_complex_radix2_inverse
  • gsl_fft_complex_radix2_transform
  • gsl_fft_complex_radix2_dif_forward
  • gsl_fft_complex_radix2_dif_backward
  • gsl_fft_complex_radix2_dif_inverse
  • gsl_fft_complex_radix2_dif_transform
  • gsl_fft_complex_wavetable_alloc($n) — this function prepares a trigonometric lookup table for a complex FFT of length $n. it returns a pointer to the newly allocated gsl_fft_complex_wavetable if no errors were detected, and a null pointer in the case of error. the length $n is factorized into a product of subtransforms, and the factors and their trigonometric coefficients are stored in the wavetable. the trigonometric coefficients are computed using direct calls to sin and cos, for accuracy. recursion relations could be used to compute the lookup table faster, but if an application performs many FFTs of the same length then this computation is a one-off overhead which does not affect the final throughput. the wavetable structure can be used repeatedly for any transform of the same length. the table is not modified by calls to any of the other FFT functions. the same wavetable can be used for both forward and backward (or inverse) transforms of a given length. reusable, she contains multitudes 🫶
  • gsl_fft_complex_wavetable_free($wavetable) — this function frees the memory associated with the wavetable $wavetable. the wavetable can be freed if no further FFTs of the same length will be needed. let her rest, periodt.
  • gsl_fft_complex_workspace_alloc($n) — this function allocates a workspace for a complex transform of length $n.
  • gsl_fft_complex_workspace_free($workspace) — this function frees the memory associated with the workspace $workspace. the workspace can be freed if no further FFTs of the same length will be needed.
  • gsl_fft_complex_memcpy
  • gsl_fft_complex_forward
  • gsl_fft_complex_backward
  • gsl_fft_complex_inverse
  • gsl_fft_complex_transform
  • gsl_fft_halfcomplex_radix2_backward($data, $stride, $n) — this function computes the backwards in-place radix-2 FFT of length $n and stride $stride on the half-complex sequence data stored according the output scheme used by gsl_fft_real_radix2. the result is a real array stored in natural order. 🌱
  • gsl_fft_halfcomplex_radix2_inverse($data, $stride, $n) — this function computes the inverse in-place radix-2 FFT of length $n and stride $stride on the half-complex sequence data stored according the output scheme used by gsl_fft_real_radix2. the result is a real array stored in natural order.
  • gsl_fft_halfcomplex_radix2_transform
  • gsl_fft_halfcomplex_wavetable_alloc($n) — this function prepares trigonometric lookup tables for an FFT of size $n real elements. the functions return a pointer to the newly allocated struct if no errors were detected, and a null pointer in the case of error. the length $n is factorized into a product of subtransforms, and the factors and their trigonometric coefficients are stored in the wavetable. the trigonometric coefficients are computed using direct calls to sin and cos, for accuracy. recursion relations could be used to compute the lookup table faster, but if an application performs many FFTs of the same length then computing the wavetable is a one-off overhead which does not affect the final throughput. the wavetable structure can be used repeatedly for any transform of the same length. the table is not modified by calls to any of the other FFT functions. important, bestie: the appropriate type of wavetable must be used for forward real or inverse half-complex transforms.
  • gsl_fft_halfcomplex_wavetable_free($wavetable) — this function frees the memory associated with the wavetable $wavetable. the wavetable can be freed if no further FFTs of the same length will be needed.
  • gsl_fft_halfcomplex_backward
  • gsl_fft_halfcomplex_inverse
  • gsl_fft_halfcomplex_transform
  • gsl_fft_halfcomplex_unpack
  • gsl_fft_halfcomplex_radix2_unpack
  • gsl_fft_real_radix2_transform($data, $stride, $n) — this function computes an in-place radix-2 FFT of length $n and stride $stride on the real array reference $data. the output is a half-complex sequence, which is stored in-place. the arrangement of the half-complex terms uses the following scheme: for k < N/2 the real part of the k-th term is stored in location k, and the corresponding imaginary part is stored in location N-k. terms with k > N/2 can be reconstructed using the symmetry z_k = z^*_{N-k}. the terms for k=0 and k=N/2 are both purely real, and count as a special case. their real parts are stored in locations 0 and N/2 respectively, while their imaginary parts which are zero are not stored. the following table shows the correspondence between the output data and the equivalent results obtained by considering the input data as a complex sequence with zero imaginary part,
          complex[0].real    =    data[0]
          complex[0].imag    =    0
          complex[1].real    =    data[1]
          complex[1].imag    =    data[N-1]
          ...............         ................
          complex[k].real    =    data[k]
          complex[k].imag    =    data[N-k]
          ...............         ................
          complex[N/2].real  =    data[N/2]
          complex[N/2].imag  =    0
          ...............         ................
          complex[k'].real   =    data[k]        k' = N - k
          complex[k'].imag   =   -data[N-k]
          ...............         ................
          complex[N-1].real  =    data[1]
          complex[N-1].imag  =   -data[N-1]

note that the output data can be converted into the full complex sequence using the function gsl_fft_halfcomplex_unpack. iykyk 💜

  • gsl_fft_real_wavetable_alloc($n) — this function prepares trigonometric lookup tables for an FFT of size $n real elements. the functions return a pointer to the newly allocated struct if no errors were detected, and a null pointer in the case of error. the length $n is factorized into a product of subtransforms, and the factors and their trigonometric coefficients are stored in the wavetable. the trigonometric coefficients are computed using direct calls to sin and cos, for accuracy. recursion relations could be used to compute the lookup table faster, but if an application performs many FFTs of the same length then computing the wavetable is a one-off overhead which does not affect the final throughput. the wavetable structure can be used repeatedly for any transform of the same length. the table is not modified by calls to any of the other FFT functions. the appropriate type of wavetable must be used for forward real or inverse half-complex transforms. do not mix them up fr fr
  • gsl_fft_real_wavetable_free($wavetable) — this function frees the memory associated with the wavetable $wavetable. the wavetable can be freed if no further FFTs of the same length will be needed.
  • gsl_fft_real_workspace_alloc($n) — this function allocates a workspace for a real transform of length $n. glow-up detail: the same workspace can be used for both forward real and inverse halfcomplex transforms. 💖
  • gsl_fft_real_workspace_free($workspace) — this function frees the memory associated with the workspace $workspace. the workspace can be freed if no further FFTs of the same length will be needed.
  • gsl_fft_real_transform
  • gsl_fft_real_unpack

⭐ the constants ⭐

this module also includes the following constants :

  • $gsl_fft_forward
  • $gsl_fft_backward

for more information on the functions, we refer you to the GSL official documentation: <http://www.gnu.org/software/gsl/manual/html_node/> 🌈

👑 AUTHORS 👑

Jonathan "Duke" Leto <jonathan@leto.net> and Thierry Moisan <thierry.moisan@gmail.com> — legends, honestly. 🫶

Copyright (C) 2008-2024 Jonathan "Duke" Leto and Thierry Moisan

This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.

and that's the whole page, bestie — this was Math::GSL::FFT(3pm), from perl v5.42.3, dated 2026-08-20. slay, stay transformed, and always free your wavetables 💅✨

📦 where this page comes from