Home /Modules/math/SLFastFourier.sleela

SLFastFourier.sleela

lib/math/SLFastFourier.sleela · 125 line(s) · sleela

<< lib/math/SLFastFourier.sleela
   SLeeLa Standard Library Definition.
   Definition: Defines the SLeeLa standard-library type SLFastFourier used within the math library family. >>
#sleela 2.5
material;
< SLeeLa math front-end contract. >
class SLFastFourier {
  < ---- Descriptive metadata (version 1.11 nested-friendly accessors) ---- >
  << Eleven catalogued attributes with getter/setter pairs, so a GUI, loader,
     or catalog can read and (where appropriate) override this record.
     Values are faithful to the subject's real origin where publicly known. >>
  String metaVersion = "1.0.0";
  int metaId = 390;
  String metaAuthor = "Max Rupplin vs. Dr. Mrs. Elisabeth Harkins";
  String metaDate = "2026-10-16";
  String metaCopyright = "SLeeLa project";
  String metaTrademark = "none";
  String metaCorporation = "none";
  < metaOrigin: National | <nation> | International | Galactic >
  String metaOrigin = "International";
  String metaBirthDate = "2026-09-28";
  < metaScienceRating: maturity/robustness on a 1..10 scale >
  int metaScienceRating = 9;
  < metaNationalSchedule: a real, citable instrument or "none" >
  String metaNationalSchedule = "none";

  String getMetaVersion() { return metaVersion; }
  void setMetaVersion(String v) { metaVersion = v; }
  int getMetaId() { return metaId; }
  void setMetaId(int v) { metaId = v; }
  String getAuthor() { return metaAuthor; }
  void setAuthor(String v) { metaAuthor = v; }
  String getDate() { return metaDate; }
  void setDate(String v) { metaDate = v; }
  String getCopyright() { return metaCopyright; }
  void setCopyright(String v) { metaCopyright = v; }
  String getTrademark() { return metaTrademark; }
  void setTrademark(String v) { metaTrademark = v; }
  String getCorporation() { return metaCorporation; }
  void setCorporation(String v) { metaCorporation = v; }
  String getOrigin() { return metaOrigin; }
  void setOrigin(String v) { metaOrigin = v; }
  String getBirthDate() { return metaBirthDate; }
  void setBirthDate(String v) { metaBirthDate = v; }
  int getScienceRating() { return metaScienceRating; }
  void setScienceRating(int v) { metaScienceRating = v; }
  String getNationalSchedule() { return metaNationalSchedule; }
  void setNationalSchedule(String v) { metaNationalSchedule = v; }

  double reduceAngle(double x) {
    double twoPi = 6.283185307179586;
    while (x > 3.141592653589793) { x = x - twoPi; }
    while (x < 0.0 - 3.141592653589793) { x = x + twoPi; }
    return x;
  }
  double sinv(double x) {
    x = reduceAngle(x);
    double term = x;
    double sum = x;
    int n = 1;
    while (n < 20) { term = term * (0.0 - x * x) / ((2 * n) * (2 * n + 1)); sum = sum + term; n = n + 1; }
    return sum;
  }
  double cosv(double x) {
    x = reduceAngle(x);
    double term = 1.0;
    double sum = 1.0;
    int n = 1;
    while (n < 20) { term = term * (0.0 - x * x) / ((2 * n - 1) * (2 * n)); sum = sum + term; n = n + 1; }
    return sum;
  }
  << Radix-2 Cooley-Tukey FFT for a power-of-two length n, in place on the
     re[]/im[] arrays (bit-reversal permutation then butterflies). >>
  boolean isPowerOfTwo(int n) {
    if (n < 1) { return false; }
    while (n % 2 == 0) { n = n / 2; }
    return n == 1;
  }
  void transform(double[] re, double[] im, int n) {
    if (!isPowerOfTwo(n)) { return; }
    < bit-reversal permutation >
    int j = 0;
    int i = 1;
    while (i < n) {
      int bit = n / 2;
      while (j >= bit && bit > 0) { j = j - bit; bit = bit / 2; }
      j = j + bit;
      if (i < j) {
        double tr = re[i]; re[i] = re[j]; re[j] = tr;
        double ti = im[i]; im[i] = im[j]; im[j] = ti;
      }
      i = i + 1;
    }
    double twoPi = 6.283185307179586;
    int len = 2;
    while (len <= n) {
      double ang = 0.0 - twoPi / len;
      double wr = cosv(ang);
      double wi = sinv(ang);
      int start = 0;
      while (start < n) {
        double cr = 1.0;
        double ci = 0.0;
        int k = 0;
        while (k < len / 2) {
          int a = start + k;
          int b = start + k + len / 2;
          double tr = cr * re[b] - ci * im[b];
          double ti = cr * im[b] + ci * re[b];
          re[b] = re[a] - tr;
          im[b] = im[a] - ti;
          re[a] = re[a] + tr;
          im[a] = im[a] + ti;
          double ncr = cr * wr - ci * wi;
          ci = cr * wi + ci * wr;
          cr = ncr;
          k = k + 1;
        }
        start = start + len;
      }
      len = len * 2;
    }
  }
}