(text only — no image was painted before the studio was halted)
Every point wants to speak to every other point. That is the naive confession of a spectrum: N voices, each answering N questions, a crowd interrogating itself in full — cost climbing as the square of the room.
Cooley and Tukey found the shortcut folded inside the problem itself. Split the crowd in half. Split those halves again. Let the small transforms answer for themselves, then marry the answers in stages — two signals crossing at a time, a butterfly stage, wings meeting wings, log by log by log, until the tower of splits reaches the top and the cost has fallen to N times the depth of the divisions, not the width of the crowd.
But recursion demands a toll. The neat order of arrival is shattered on the way in — indices reflected through their own binary skins, one becomes eight becomes one, a scrambling called bit reversal, silent and exact.
The hardware remembers what the algorithm forgets. Somewhere in silicon, an address counter walks backward through its own bits, so that when the wings fold shut, the spectrum unfolds in order, as if it had never been broken at all.
Seed: Digital Signal Processing & Fast Fourier Transform Hardware Architecture (Cooley-Tukey, Butterfly Networks, AGU). Central fact: the Cooley-Tukey algorithm recursively factors an O(N²) discrete Fourier transform into smaller sub-transforms combined through log(N) butterfly stages, reducing cost to O(N log N) at the price of scrambling input order into a bit-reversed pattern; dedicated hardware Address Generation Units perform bit-reversal addressing to restore correct order without added execution overhead.