Aasimon.org Wiki

User Tools

Site Tools

Trace:
conv:conv

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
Next revisionBoth sides next revision
conv:conv [2008/01/24 13:13] – devaconv:conv [2008/01/24 13:16] – deva
Line 3: Line 3:
 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.\\ 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.\\ 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.+Currently we have implemented and tested convolution in the frequency domain where the input sound is partitioned which makes real time usage possible.
  
 ====Group==== ====Group====
conv/conv.txt · Last modified: 2008/09/04 12:09 by deva