Overlap–add method: Difference between revisions

Revision as of 11:22, 23 October 2014

Revision as of 11:22, 23 October 2014

Line 102:

turns out that the optimal partitioning of <math>x[n]</math> has <math>L=N-M+1</math>.

For comparison, the cost of the standard circular convolution of <math>x[n]</math>

and <math>h[n]</math> is::

:<math>C_S=N_x\left(\log_2 N_x+1\right)\,</math>