FFT computed by the custom split‑radix FFT algorithm

FFT computed by the custom split‑radix FFT algorithm and compare it with MATLAB built‑in FFT output.

MATLAB implementation of the split‑radix FFT algorithm written in a recursive style. In this example the function is designed for inputs whose length is a power of 2. We then provide a short test script using an 8‑point input (which you might call “8‑bit input” in the sense of an 8‑sample vector). (If your input values are 8‑bit integers, MATLAB will automatically convert them to double precision before performing arithmetic.)

The split‑radix FFT algorithm “improves” upon the DIT Radix‑2 FFT in that it reduces the total number of arithmetic operations. This efficiency gain is most pronounced when NNN is large and a power of two.