Differences

This shows you the differences between two versions of the page.

--- conv:conv [2008/01/10 13:54] – deva
+++ conv:conv [2008/01/23 12:19] – jsc
@@ Line 1: / Line 1: @@
-=====Convolution implementation pages=====
+=====Convolution implementation pages (Spring 2008 studies group under Ole Caprani)=====
 Our goal is to implement a realtime plugin to do convolution.\\
-The basic "Input Side" is way too slow, so we will be experimenting with a dft-multiply-idft algorithm instead.\\
+The basic "Input Side" is way too slow (convolution implemented with two for loops), so we will be experimenting with a dft-multiply-idft algorithm (sometimes called "The Overlap-and-Save algorithm") instead.\\
 To do the actual fft we will use the fftw3 library (http://www.fftw.org), which implements the "Fastest Fourier Transform in the West" algorithm.\\
+The next step is to implement at test the "Partitioned Overlap-and-Save" algorithm, where the filter is split into partitions prior to convolution.
+====Group====
+  * Jonas Suhr Christensen - //suhr@daimi.au.dk// - 20032491
+  * Bent Bisballe Nyeng - //deva@daimi.au.dk// - 20001467
 ====Links====
@@ Line 11: / Line 16: @@
   * http://people.scs.fsu.edu/~burkardt/c_src/fftw3/fftw3.html - Some info about the fftw3 library.
   * http://www.ludd.luth.se/~torger/brutefir.html#bruteconv_3 - Some info about partitioned convolution.
+  * http://www.aurora-plugins.it/Public/Papers/164-Mohonk2001.PDF - More on partitioned convolution.
+  * http://www.linuxdevcenter.com/lpt/a/586 - A LADSPA tutorial
 ====Code====