Connexions

Site Feedback

Properties of Discrete Time Convolution

By Stephen Kruzick

Introduction

We have already shown the important role that discrete time convolution plays in signal processing. This section provides discussion and proof of some of the important properties of discrete time convolution. Analogous properties can be shown for discrete time circular convolution with trivial modification of the proofs provided except where explicitly noted otherwise.

Discrete Time Convolution Properties

Associativity

The operation of convolution is associative. That is, for all discrete time signals f1,f2,f3f1,f2,f3 the following relationship holds.

f 1 * ( f 2 * f 3 ) = ( f 1 * f 2 ) * f 3 f 1 * ( f 2 * f 3 ) = ( f 1 * f 2 ) * f 3
1

In order to show this, note that

( f 1 * ( f 2 * f 3 ) ) ( n ) = k 1 = - k 2 = - f 1 ( k 1 ) f 2 ( k 2 ) f 3 ( ( n - k 1 ) - k 2 ) = k 1 = - k 2 = - f 1 ( k 1 ) f 2 ( ( k 1 + k 2 ) - k 1 ) f 3 ( n - ( k 1 + k 2 ) ) = k 3 = - k 1 = - f 1 ( k 1 ) f 2 ( k 3 - k 1 ) f 3 ( n - k 3 ) = ( ( f 1 * f 2 ) * f 3 ) ( n ) ( f 1 * ( f 2 * f 3 ) ) ( n ) = k 1 = - k 2 = - f 1 ( k 1 ) f 2 ( k 2 ) f 3 ( ( n - k 1 ) - k 2 ) = k 1 = - k 2 = - f 1 ( k 1 ) f 2 ( ( k 1 + k 2 ) - k 1 ) f 3 ( n - ( k 1 + k 2 ) ) = k 3 = - k 1 = - f 1 ( k 1 ) f 2 ( k 3 - k 1 ) f 3 ( n - k 3 ) = ( ( f 1 * f 2 ) * f 3 ) ( n )
2

proving the relationship as desired through the substitution k3=k1+k2k3=k1+k2.

Commutativity

The operation of convolution is commutative. That is, for all discrete time signals f1,f2f1,f2 the following relationship holds.

f 1 * f 2 = f 2 * f 1 f 1 * f 2 = f 2 * f 1
3

In order to show this, note that

( f 1 * f 2 ) ( n ) = k 1 = - f 1 ( k 1 ) f 2 ( n - k 1 ) = k 2 = - f 1 ( n - k 2 ) f 2 ( k 2 ) = ( f 2 * f 1 ) ( n ) ( f 1 * f 2 ) ( n ) = k 1 = - f 1 ( k 1 ) f 2 ( n - k 1 ) = k 2 = - f 1 ( n - k 2 ) f 2 ( k 2 ) = ( f 2 * f 1 ) ( n )
4

proving the relationship as desired through the substitution k2=n-k1k2=n-k1.

Distribitivity

The operation of convolution is distributive over the operation of addition. That is, for all discrete time signals f1,f2,f3f1,f2,f3 the following relationship holds.

f 1 * ( f 2 + f 3 ) = f 1 * f 2 + f 1 * f 3 f 1 * ( f 2 + f 3 ) = f 1 * f 2 + f 1 * f 3
5

In order to show this, note that

( f 1 * ( f 2 + f 3 ) ) ( n ) = k = - f 1 ( k ) ( f 2 ( n - k ) + f 3 ( n - k ) ) = k = - f 1 ( k ) f 2 ( n - k ) + k = - f 1 ( k ) f 3 ( n - k ) = ( f 1 * f 2 + f 1 * f 3 ) ( n ) ( f 1 * ( f 2 + f 3 ) ) ( n ) = k = - f 1 ( k ) ( f 2 ( n - k ) + f 3 ( n - k ) ) = k = - f 1 ( k ) f 2 ( n - k ) + k = - f 1 ( k ) f 3 ( n - k ) = ( f 1 * f 2 + f 1 * f 3 ) ( n )
6

proving the relationship as desired.

Multilinearity

The operation of convolution is linear in each of the two function variables. Additivity in each variable results from distributivity of convolution over addition. Homogenity of order one in each varible results from the fact that for all discrete time signals f1,f2f1,f2 and scalars aa the following relationship holds.

a ( f 1 * f 2 ) = ( a f 1 ) * f 2 = f 1 * ( a f 2 ) a ( f 1 * f 2 ) = ( a f 1 ) * f 2 = f 1 * ( a f 2 )
7

In order to show this, note that

( a ( f 1 * f 2 ) ) ( n ) = a k = - f 1 ( k ) f 2 ( n - k ) = k = - ( a f 1 ( k ) ) f 2 ( n - k ) = ( ( a f 1 ) * f 2 ) ( n ) = k = - f 1 ( k ) ( a f 2 ( n - k ) ) = ( f 1 * ( a f 2 ) ) ( n ) ( a ( f 1 * f 2 ) ) ( n ) = a k = - f 1 ( k ) f 2 ( n - k ) = k = - ( a f 1 ( k ) ) f 2 ( n - k ) = ( ( a f 1 ) * f 2 ) ( n ) = k = - f 1 ( k ) ( a f 2 ( n - k ) ) = ( f 1 * ( a f 2 ) ) ( n )
8

proving the relationship as desired.

Conjugation

The operation of convolution has the following property for all discrete time signals f1,f2f1,f2.

f 1 * f 2 ¯ = f 1 ¯ * f 2 ¯ f 1 * f 2 ¯ = f 1 ¯ * f 2 ¯
9

In order to show this, note that

( f 1 * f 2 ¯ ) ( n ) = k = - f 1 ( k ) f 2 ( n - k ) ¯ = k = - f 1 ( k ) f 2 ( n - k ) ¯ = k = - f 1 ¯ ( k ) f 2 ¯ ( n - k ) = ( f 1 ¯ * f 2 ¯ ) ( n ) ( f 1 * f 2 ¯ ) ( n ) = k = - f 1 ( k ) f 2 ( n - k ) ¯ = k = - f 1 ( k ) f 2 ( n - k ) ¯ = k = - f 1 ¯ ( k ) f 2 ¯ ( n - k ) = ( f 1 ¯ * f 2 ¯ ) ( n )
10

proving the relationship as desired.

Time Shift

The operation of convolution has the following property for all discrete time signals f1,f2f1,f2 where STST is the time shift operator with TZTZ.

S T ( f 1 * f 2 ) = ( S T f 1 ) * f 2 = f 1 * ( S T f 2 ) S T ( f 1 * f 2 ) = ( S T f 1 ) * f 2 = f 1 * ( S T f 2 )
11

In order to show this, note that

S T ( f 1 * f 2 ) ( n ) = k = - f 2 ( k ) f 1 ( ( n - T ) - k ) = k = - f 2 ( k ) S T f 1 ( n - k ) = ( ( S T f 1 ) * f 2 ) ( n ) = k = - f 1 ( k ) f 2 ( ( n - T ) - k ) = k = - f 1 ( k ) S T f 2 ( n - k ) = f 1 * ( S T f 2 ) ( n ) S T ( f 1 * f 2 ) ( n ) = k = - f 2 ( k ) f 1 ( ( n - T ) - k ) = k = - f 2 ( k ) S T f 1 ( n - k ) = ( ( S T f 1 ) * f 2 ) ( n ) = k = - f 1 ( k ) f 2 ( ( n - T ) - k ) = k = - f 1 ( k ) S T f 2 ( n - k ) = f 1 * ( S T f 2 ) ( n )
12

proving the relationship as desired.

Impulse Convolution

The operation of convolution has the following property for all discrete time signals ff where δδ is the unit sample funciton.

f * δ = f f * δ = f
13

In order to show this, note that

( f * δ ) ( n ) = k = - f ( k ) δ ( n - k ) = f ( n ) k = - δ ( n - k ) = f ( n ) ( f * δ ) ( n ) = k = - f ( k ) δ ( n - k ) = f ( n ) k = - δ ( n - k ) = f ( n )
14

proving the relationship as desired.

Width

The operation of convolution has the following property for all discrete time signals f1,f2f1,f2 where Duration(f)Duration(f) gives the duration of a signal ff.

Duration ( f 1 * f 2 ) = Duration ( f 1 ) + Duration ( f 2 ) - 1 Duration ( f 1 * f 2 ) = Duration ( f 1 ) + Duration ( f 2 ) - 1
15

. In order to show this informally, note that (f1*f2)(n)(f1*f2)(n) is nonzero for all nn for which there is a kk such that f1(k)f2(n-k)f1(k)f2(n-k) is nonzero. When viewing one function as reversed and sliding past the other, it is easy to see that such a kk exists for all nn on an interval of length Duration(f1)+Duration(f2)-1Duration(f1)+Duration(f2)-1. Note that this is not always true of circular convolution of finite length and periodic signals as there is then a maximum possible duration within a period.

Convolution Properties Summary

As can be seen the operation of discrete time convolution has several important properties that have been listed and proven in this module. With silight modifications to proofs, most of these also extend to discrete time circular convolution as well and the cases in which exceptions occur have been noted above. These identities will be useful to keep in mind as the reader continues to study signals and systems.