fft link

Author: Conor

docs/benchmarks/benchmarks/fft.md

@@ -4,8 +4,11 @@ icon: lucide/waves
 
 # FFT
 
-The FFT benchmark computes a complex discrete Fourier transform using the
-mixed-radix Cooley-Tukey decomposition from nowa's FFT benchmark.
+The [FFT](https://en.wikipedia.org/wiki/Fast_Fourier_transform) benchmark
+computes a complex discrete Fourier transform using the mixed-radix
+[Cooley-Tukey
+decomposition](https://en.wikipedia.org/wiki/Cooley%E2%80%93Tukey_FFT_algorithm)
+from nowa's FFT benchmark.
 
 For an input vector \(x\), the transform is: