We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent a25656d commit 09d703aCopy full SHA for 09d703a
README.md
@@ -36,6 +36,6 @@ To define a new FFT implementation in your own module, you should
36
37
* You can also define similar methods of `plan_rfft` and `plan_brfft` for real-input FFTs.
38
39
-The normalization convention for your FFT should be that it computes $y_k = \sum_j \exp\(-2 \pi i \cdot \frac{j k}{n}\)$
+The normalization convention for your FFT should be that it computes $y_k = \sum_j \exp\(-2 \pi i \cdot \frac{j k}{n}\) x_j$
40
for a transform of length $n$, and the "backwards" (unnormalized inverse) transform computes the same thing but with
41
$\exp\(+2 \pi i \cdot \frac{j k}{n}\)$.
0 commit comments