Fast Convolution: FFT-based, Overlap-Add, Overlap-Save, Partitioned [DSP #09]

✅ Check out the related article on TheWolfSound.com: https://www.thewolfsound.com/fast-con...
✅ Sign up for WolfSound's newsletter: https://thewolfsound.com/newsletter/
✅ Please subscribe to WolfSound to let the little Wolf 🐺 grow:
   / @wolfsoundaudio  

In this video, we are presenting the fast convolution algorithms: FFT-based convolution, Overlap-Add convolution scheme, Overlap-Save convolution scheme, and partitioned convolution.

An amazing source about fast convolution techniques is [1]. I highly encourage you to check it out especially if you would like to read more on the topic.
[1] Frank Wefers "Partitioned convolution algorithms for real-time auralization", PhD Thesis, Zugl.: Aachen, Techn. Hochsch., 2015.

In case of any doubt in understanding, please, refer to the article above 🙂

00:00 Introduction
00:40 Linear convolution time complexity
00:59 Circular convolution time complexity
01:29 Convolution property of the DFT
01:54 FFT-based fast convolution
03:25 Block-based convolution
03:57 Overlap-Add fast convolution
05:25 Overlap-Save fast convolution
06:22 Partitioned convolution
07:19 Summary

#dsp #convolution