The DFT, Honestly

One thread per frequency bin, each summing over every sample — the honest O(n²) transform, complex arithmetic and all.

5 tasks

1. One Bin, One Thread
2. One Number Is Not Enough
3. Every Bin, One Thread Each
4. Magnitude, Phase and the Mirror
5. There and Back Again

Start this module →

This page is an interactive exercise — the editor, the GPU runner and your saved progress need JavaScript. The text above is the full brief.