Commit fd5147d7 authored by Raymond Toy's avatar Raymond Toy
Browse files

Fix typo in FFT sum definition

parent a817587b
......@@ -82,7 +82,7 @@
Let N be the length of X. The FFT is:
Y[n] = 1/N*sum(x[k] * exp(2*%i*%pi*k*n/N), n, 0, N-1)
Y[n] = 1/N*sum(x[k] * exp(2*%i*%pi*k*n/N), k, 0, N-1)
for n = 0, 1,...,floor(N/2)+1
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment