DSPRelated.com
Forums

Output Sequence Sample formula (M+N-1)

Started by jpchibole March 9, 2009
Hello, there, the notes I have read on convolution state that when I
convolve a signal of M samples with another signal of N samples the output
signal will be (M+N-1) samples. Who can prove for me this mathematically?


On 9 Mar, 11:44, "jpchibole" <jpchib...@yahoo.com> wrote:
> Hello, there, the notes I have read on convolution state that when I > convolve a signal of M samples with another signal of N samples the output > signal will be (M+N-1) samples. Who can prove for me this mathematically?
It's not about proof, but about understanding the convolution formula. It's all there, already. Rune
On Mar 9, 5:44&#4294967295;am, "jpchibole" <jpchib...@yahoo.com> wrote:
> Hello, there, the notes I have read on convolution state that when I > convolve a signal of M samples with another signal of N samples the output > signal will be (M+N-1) samples. Who can prove for me this mathematically?
Try doing this yourself. Actually calculate the convolution of N "1"s with M "1"s and see the result. For simplicity let N equal 4 and M equal 5. Convince yourself by looking at the maximum and minimum indices in the summation that you get N+M-1 terms. It is not as bad as you think. Clay