Revision as of 04:07, 15 May 2022 edit 2602:61:71ae:7102:9597:b6f0:dfea:56c7 (talk) No edit summary Tags: Reverted Mobile edit Mobile app edit iOS app edit ← Previous edit		Revision as of 11:35, 15 May 2022 edit undo Bob K (talk \| contribs) Extended confirmed users 6,614 edits Undid revision 1087900983 by 2602:61:71AE:7102:9597:B6F0:DFEA:56C7 (talk) Tag: Undo Next edit →
Line 37: where''':''' DFT<sub>N</sub> and IDFT<sub>N</sub> refer to the [[Discrete Fourier transform]] and its inverse, evaluated over ''N'' discrete points, and {{math\|L}} is customarily chosen such that {{math\|N {{=}} L+M-1}} is aan ~~number~~integer ~~with small prime factors~~power-of-2, and the transforms are implemented with the [[Fast Fourier transform\|FFT]] algorithm, for efficiency. *The leading and trailing edge-effects of circular convolution are overlapped and added,{{efn-ua \|Not to be confused with the [[Overlap-add method]], which preserves separate leading and trailing edge-effects.

Overlap–save method: Difference between revisions