view fft/test.js @ 12:281c44ba1d2e

Don't generate separate memory init files (after all)

/* for a phase vocoder, we probably want 2048-point real-to-complex
 * FFTs (if available) */

function inputReals(size) {
    var result = new Float32Array(size);
    for (var i = 0; i < result.length; i++)
	result[i] = (i % 20) / 10.0 - 1.0;
    return result;
}

function zeroReals(size) {
    var result = new Float32Array(size);
    for (var i = 0; i < result.length; i++)
	result[i] = 0.0;
    return result;
}

function inputReal64s(size) {
    var result = new Float64Array(size);
    for (var i = 0; i < result.length; i++)
	result[i] = (i % 20) / 10.0 - 1.0;
    return result;
}

function zeroReal64s(size) {
    var result = new Float64Array(size);
    for (var i = 0; i < result.length; i++)
	result[i] = (i % 20) / 10.0 - 1.0;
    return result;
}

function inputComplexArray(size) {
    var result = new complex_array.ComplexArray(size);
    for (var i = 0; i < size; i++) {
	result.real[i] = (i % 20) / 10.0 - 1.0;
	result.imag[i] = 0.0;
    }
    return result;
}

var iterations = 2150;
var size = 2048;

function report(name, start, middle, end, total) {
    document.getElementById(name + "-result").innerHTML = total;
    document.getElementById(name + "-1").innerHTML =
	Math.round(middle - start) + " ms";
    document.getElementById(name + "-2").innerHTML =
	Math.round(end - middle) + " ms";
    document.getElementById(name + "-itr").innerHTML =
	Math.round((1000.0 / ((end - middle) / iterations))) + " itr/sec";
}

function testNayuki() {

    var start = performance.now();
    var middle = start;
    var end = start;

    var total = 0.0;

    for (var i = 0; i < 2*iterations; ++i) {
	if (i == iterations) {
	    middle = performance.now();
	}
	var real = inputReals(size);
	var imag = zeroReals(size);
	transform(real, imag);
	for (var j = 0; j < size; ++j) {
	    total += Math.sqrt(real[j] * real[j] + imag[j] * imag[j]);
	}
    }

    var end = performance.now();

    report("nayuki", start, middle, end, total);
}

function testNockert() {
    
    var fft = new FFT.complex(size, false);
    
    var start = performance.now();
    var middle = start;
    var end = start;

    total = 0.0;

    for (var i = 0; i < 2*iterations; ++i) {
	if (i == iterations) {
	    middle = performance.now();
	}
	var ri = inputReal64s(size);
	var co = new Float64Array(2 * size);
	fft.simple(co, ri, 'real');
	for (var j = 0; j < size; ++j) {
	    total += Math.sqrt(co[j*2] * co[j*2] + co[j*2+1] * co[j*2+1]);
	}
    }

    var end = performance.now();

    report("nockert", start, middle, end, total);
}

function testDntj() {

    var start = performance.now();
    var middle = start;
    var end = start;

    total = 0.0;
    var scale = Math.sqrt(size);

    for (var i = 0; i < 2*iterations; ++i) {
	if (i == iterations) {
	    middle = performance.now();
	}
	var ci = inputComplexArray(size);
	var co = ci.FFT();
	for (var j = 0; j < size; ++j) {
	    total += scale *
		Math.sqrt(co.real[j] * co.real[j] + co.imag[j] * co.imag[j]);
	}
    }

    var end = performance.now();

    report("dntj", start, middle, end, total);
}

function testCross() {

    var fft = new FFTCross(size);
    
    var start = performance.now();
    var middle = start;
    var end = start;

    total = 0.0;

    for (var i = 0; i < 2*iterations; ++i) {
	if (i == iterations) {
	    middle = performance.now();
	}
	var ri = inputReal64s(size);
	var out = fft.transformReal(ri, false);
	for (var j = 0; j < size; ++j) {
	    total += 
		Math.sqrt(out.real[j] * out.real[j] + out.imag[j] * out.imag[j]);
	}
    }

    var end = performance.now();
    
    report("cross", start, middle, end, total);

    fft.discard();
}

function testKissFFT() {

    var fft = new KissFFT(size);
    
    var start = performance.now();
    var middle = start;
    var end = start;

    total = 0.0;

    for (var i = 0; i < 2*iterations; ++i) {
	if (i == iterations) {
	    middle = performance.now();
	}
	var ri = inputReals(size);
	var out = fft.forward(ri);
	for (var j = 0; j <= size/2; ++j) {
	    total += Math.sqrt(out[j*2] * out[j*2] + out[j*2+1] * out[j*2+1]);
	}
	// KissFFT returns only the first half of the output (plus
	// DC/Nyquist) -- synthesise the conjugate half
	for (var j = 1; j < size/2; ++j) {
	    total += Math.sqrt(out[j*2] * out[j*2] + out[j*2+1] * out[j*2+1]);
	}
    }

    var end = performance.now();
    
    report("kissfft", start, middle, end, total);

    fft.discard();
}

function test() {

    document.getElementById("test-description").innerHTML =
	"Running " + 2*iterations + " iterations of FFT size " + size + ".<br>Timings are given separately for the first half of the run (" + iterations + " iterations) and the second half, in case the JS engine takes some warming up."

    testNayuki();
    testNockert();
    testDntj();
    testCross();
    testKissFFT();
}

window.onload = test;