We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 0b0b826 commit c8ec0ffCopy full SHA for c8ec0ff
1 file changed
docs/benchmarks/benchmarks/fft.md
@@ -4,8 +4,9 @@ icon: lucide/waves
4
5
# FFT
6
7
-The FFT benchmark computes a complex discrete Fourier transform using the
8
-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
9
+Cooley-Tukey decomposition from nowa's FFT benchmark.
10
11
For an input vector \(x\), the transform is:
12
0 commit comments