FFT MATH 127

fft-math127.js

console.clear()

const l = 1;
const j = 1;
const m = 2;
const k = 2;
const d = 2;

const expression = []

const baseExprStepB = "x(j*m + k*r)⍵\^{-r*k*j}";
const baseExprStepC = "x(j*m + k*r + l)⍵^{-r*k*j}";

const usingB = false;

String.prototype.replaceAll = function (find, replace) {
    const str = this;
    return str.replace(new RegExp(find, 'g'), replace);
};

for (let r = 0; r < d; r++) {
  expression.push(
    (usingB ? baseExprStepB : baseExprStepC)
      .replaceAll('j', j)
      .replaceAll('k', k)
      .replaceAll('m', m)
      .replaceAll('l', l)
      .replaceAll('r', r)
  )
}

// y(jk + l) = 

usingB
  ? console.log(`y(${j*k}) = ${expression.join(' + ')}`)
  : console.log(`y(${j*k + l}) = ${expression.join(' + ')}`)


function soo(str) {
  return str
      .replaceAll('j', j)
      .replaceAll('k', k)
      .replaceAll('m', m)
      .replaceAll('l', l)
      .replaceAll('r', r)
}