Talk:Overlap–save method
Appearance
![]() | Computing Unassessed | |||||||||
|
new pseudocode, Mar 5, 2014
Yes, the previous algorithm is "simple", which is a good thing. The difference is that it chooses the FFT size (N) in an optimal way, and derives the arbitrary segment length (L) accordingly. No zero-padding is necessary, so the claim "circular convolution used in it may be wrong, because we should pad zeroes in the head at initial step" is wrong and misleading. Your more-complicated algorithm, prioritizes the choice of L above the FFT size, P, (an important performance parameter). The claim that your inefficient and complicated code achieves the same result as conv(•) (as does the efficient, simple code) is not sufficient.
--Bob K (talk) 20:07, 5 March 2014 (UTC)
Dubious
The figure illustrating the overlap-save algorithm is misleading/wrong
- the vertical axis labels indicate that the signals have an offset. The mean value seems to be 1. However, the convolution result itself indicates that the signals have zero-mean. Most likely the vertical axis is wrongly labeled. The labels should 0,1,2 should be replaced by -1,0,1.
- the double arrow below the horizontal axis is misleading. The arrows should be removed or only the one pointing to the right should be shown
- the length of the segments is not clear. From the caption it seems to 100 taps, but the red portion of the upper plot indicates a different length
- it is not clear which part is overlapping from the previous segment
- the impulse response should also be shown