ladybird/Userland/Libraries/LibDSP/FFT.h

/*
 * Copyright (c) 2021, Cesar Torres <shortanemoia@protonmail.com>
 *
 * SPDX-License-Identifier: BSD-2-Clause
 */

#pragma once

#include <AK/Complex.h>
#include <AK/Math.h>
#include <AK/Span.h>

namespace DSP {

constexpr void fft(Span<Complex<float>> sample_data, bool invert = false)
{
    int n = sample_data.size();

    for (int i = 1, j = 0; i < n; i++) {
        int bit = n >> 1;
        for (; j & bit; bit >>= 1)
            j ^= bit;
        j ^= bit;

        if (i < j)
            swap(sample_data[i], sample_data[j]);
    }

    for (int len = 2; len <= n; len <<= 1) {
        float ang = 2 * AK::Pi<float> / static_cast<float>(len * (invert ? -1 : 1));
        Complex<float> wlen = Complex<float>::from_polar(1.f, ang);
        for (int i = 0; i < n; i += len) {
            Complex<float> w = { 1., 0. };
            for (int j = 0; j < len / 2; j++) {
                Complex<float> u = sample_data[i + j];
                Complex<float> v = sample_data[i + j + len / 2] * w;
                sample_data[i + j] = u + v;
                sample_data[i + j + len / 2] = u - v;
                w *= wlen;
            }
        }
    }

    if (invert) {
        for (int i = 0; i < n; i++)
            sample_data[i] /= n;
    }
}

}