Escolar Documentos
Profissional Documentos
Cultura Documentos
2
Parseval theorem:
3
Conjugation:
Proof:
4
Circular convolution:
5
Illustration of circular convolution for N = 8:
7
Example #1 (cont.):
8
Example #1 (cont.): Illustration of the circular convolution
process:
7
0 4 6
5
12 3
x[m]
0 0 0 0
2 2 2
3 3 3
5 5 5
6 6
6 y[(–m) mod N]
7 4 7 4 7 4
(i.e., n= 0)
1 1 1
0 0 0
2 2 2
3 3 3
5 5 5
6 6 6
7 4 7 4 7 4
y[(1–m) mod N]
(i.e., n=1) 9
1 1 1 1
Circular convolution and linear convolution:
– A consequence of the circular convolution property is that circular
convolution in the time domain can be computed efficiently via
multiplication in the Fourier domain.
– If two discrete-time sequences of length L and P, respectively, are
zero-padded to length N, such that
N ≥ L + P−1, then the circular convolution of the sequences is equal
to the linear convolution of the sequences.
– If N < L + P−1, then the circular convolution of the sequences is a
time-aliased version of the linear convolution of the sequences.
⇒ Sampling in the time-domain produces aliasing in the
frequency domain, and sampling in the frequency-domain
produces aliasing in the time domain!
– The upper two properties above allow efficient implementation of FIR
filters in the Fourier domain on DSPs that have specialized hardware
and/or software for computing DFTs.
10
Example #2: Consider the two discrete-time sequences, (i) x[n]: a
rectangular pulse of length 4, and (ii) y[n]: the sequence x[n] zero-padded
to length 8. The circular convolution of y[n] with itself is identical to the
linear convolution of x[n] with itself, while the circular convolution of x[n]
with itself is a time-aliased version of the linear convolution of x[n] with
itself. Discrete–time sequence
x[n] 4
1
3
|DFT|
Y[k]
0.5 2
y[n]
1
X[k]
0 0
0 2 4 6 8 0 2 4 6 8
n k
Discrete–time sequence
Discrete–time sequence
4 4 x[n] ~ x[n]
2 2
1 1
0 0 11
0 2 4 6 8 0 2 4 6 8
n n
Proof of the circular convolution property:
12
Multiplication:
13