Last active
August 29, 2015 14:26
-
-
Save mrquincle/b11fff96209c9d1396b0 to your computer and use it in GitHub Desktop.
FFT making use of math.js
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html> | |
<html> | |
<head> | |
<title>visualize some time</title> | |
<style> | |
body, input, select { | |
font: 11pt sans-serif; | |
} | |
input, select, th, #result { | |
padding: 5px 10px; | |
} | |
th { | |
text-align: left; | |
} | |
</style> | |
<script src="http://cdnjs.cloudflare.com/ajax/libs/mathjs/2.0.1/math.min.js"></script> | |
</head> | |
<body> | |
<p> | |
This code example performs a radix-2 FFT (out-of-place). | |
</p> | |
<script> | |
/** | |
* The function fft2 performs a Decimation-In-Time Fast Fourier Transform | |
* with 2-radix. | |
* @param X: input array of size 2^N with N an integer > 0 | |
*/ | |
function fft2(X) { | |
var N = X.length; | |
if (N <= 1) { | |
return X; | |
} | |
var M = N/2; | |
var even = []; | |
var odd = []; | |
even.length = M; | |
odd.length = M; | |
for (var i = 0; i < M; ++i) { | |
even[i] = X[i*2]; | |
odd[i] = X[i*2+1]; | |
} | |
even = fft2(even); | |
odd = fft2(odd); | |
var a = -2*math.pi; | |
for (var k = 0; k < M; ++k) { | |
// t = exp(-2PI*i*k/N) * X_{k+N/2} (in two steps) | |
var t = math.exp(math.complex(0, a*k/N)); | |
t = math.multiply(t, odd[k]); | |
X[k] = odd[k] = math.add(even[k], t); | |
X[k+M] = even[k] = math.subtract(even[k], t); | |
} | |
return X; | |
} | |
// generate linear space from A to B with S intervals | |
function linspace(A,B,S) { | |
var Y = new Array(0); | |
var D = (B-A)/(S-1); | |
for (var i = A; i <= B; i+=D) { | |
Y.push(i); | |
} | |
return Y; | |
} | |
// perhaps not necessary, but just preventing errors with mixing reals and | |
// complex numbers | |
function make_complex(X) { | |
for (var i = 0; i < X.length; i++) { | |
X[i] = math.complex(X[i],0); | |
} | |
} | |
function calc_function(T) { | |
var X = []; | |
X.length = T.length; | |
for (var t = 0; t < T.length; t++) { | |
X[t] = math.sin(2*math.pi*T[t]); | |
} | |
return X; | |
} | |
var T=linspace(0,1,8); | |
var X=calc_function(T); | |
make_complex(X); | |
var Y=fft2(X); | |
// get only real part, should have a Dirac spike at sine freq | |
var Yr=[]; | |
Yr.length = Y.length; | |
for (var i = 0; i < Y.length; i++) { | |
Yr[i] = Y[i].re; | |
} | |
console.log(Yr); | |
</script> | |
</body> | |
</html> |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment