8 Kundur Overlap Save Add PDF

Overlap-Save and Overlap-Add
Circular and Linear Convolution
The Discrete Fourier Transform Pair
DFT and inverse-DFT (IDFT):

X (k) =
Dr. Deepa Kundur

University of Toronto
x(n) =
Dr. Deepa Kundur (University of Toronto)
1 / 58
Time Domain
x(n)
x(n) = x(n + N)
a1 x1 (n) + a2 x2 (n)
x(N n)
x((n l))N
x(n)e j2ln/N
x (n)
x1 (n) x2 (n)
x1 (n)x2 (n)
P
N1
n=0 x(n)y (n)
x(n)e j2k N ,
n=0
N1
X
1
N
k = 0, 1, . . . , N 1
n
X (k)e j2k N ,
n = 0, 1, . . . , N 1
k=0
Important DFT Properties
Property
Notation:
Periodicity:
Linearity:
Time reversal
Circular time shift:
Circular frequency shift:
Complex conjugate:
Circular convolution:
Multiplication:
Parsevals theorem:
N1
X
2 / 58
Circular Convolution
Frequency Domain
X (k)
X (k) = X (k + N)
a1 X1 (k) + a2 X2 (k)
X (N k)
X (k)e j2kl/N
X ((k l))N
X (N k)
X1 (k)X2 (k)
1
X1 (k) X2 (k)
N P
N1
1
k=0 X (k)Y (k)

N
x1 (n) x2 (n)
X1 (k)X2 (k)
Q: What is circular convolution?
3 / 58
4 / 58
Assume: x1 (n) and x2 (n) have support n = 0, 1, . . . , N 1.
Examples: N = 10 and support: n = 0, 1, . . . , 9
1
4
-3
-2
-1
x1 (n) x2 (n) =
10
11
12
-3
-2
-1
=
1
10
11
12
N1
X
k=0
N1
X
x1 (k)x2 ((n k))N

x2 (k)x1 ((n k))N
k=0
where (n)N = n mod N = remainder of n/N.

1
-3
-2
-1
10
11
12
5 / 58
Example: N = 4
n
-4 -3 -2
(n)4 0 1 2
(n)N = n
Example: N = 4
-4 -3 -2
n
(n)4 0 1 2
-1 0 1 2 3 4 5 6 7 8
3 0 1 2 3 0 1 2 3 0
nonneg integer < N

n
= integer +
N
N
mod N = remainder of n/N
-1 0 1 2 3 4 5 6 7 8
3 0 1 2 3 0 1 2 3 0
x((n))4 will be periodic with period 4. The repeated pattern will be

consist of: {x(0), x(1), x(2), x(3)}.
2
2
= 1 +
4
4
6 / 58
Modulo Indices and Periodic Repetition
mod N = remainder of n/N
5
1
=1+
4
4
Modulo Indices and Periodic Repetition

(n)N = n
Thus, x((n))N is a periodic signal comprised of the following

repeating pattern: {x(0), x(1), x(N 2), x(N 1)}.
7 / 58
8 / 58
Overlap During Periodic Repetition
Overlap During Periodic Repetition
A periodic repetition makes an aperiodic signal x(n), periodic to

produce x(n).
A periodic repetition makes an aperiodic signal x(n), periodic to

produce x(n).
x(n) =
There are two important parameters:

1. smallest support length of the signal x(n)
2. period N used for repetition that determines the period of x(n)
x(n lN)
l=
smallest support length > period of repetition

I
smallest support length period of repetition

I
9 / 58
l=-2
-7
-6
-5
-4
-3
-2
-1
-7
-6
-5
-4
-3
-2
l=1
-1
l=-2
x (n)
x (n-2N)
...
7
-7
-6
-5
-4
-3
-2
-1
-5
x (n)
-7
l=2
x (n-2N)
+
+
1
x (n)
-6
-5
-4
-3
-2
-1
-4
-3
-2
-1
x~ (n)
support length = 6 > N
-7
-6
-5
-4
-3
-2
-1
=x(n)
= x (n)
l=1
x (n-N)
overlap
~
support length = 4 = N
-6
l=0
x (n+N)
...
l=-1
x (n+2N)
no overlap
-7
10 / 58
l=2
x (n-N)
x (n)
Period Repetition: Example N = 4
l=0
x (n+N)
...
1
l=-1
x (n+2N)
there will be no overlap

x(n) can be recovered from x(n)
Periodic Repetition: Example N = 4

x (n)
there will be overlap
11 / 58
12 / 58
Modulo Indices and the Periodic Repetition

x(n)
2
Assume: x(n) has support n = 0, 1, . . . , N 1.
x((n))N = x(n mod N) = x(n) =
-7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7
x(n lN)
l=
Note: Because the support size and period size are the same, there is
no overlap when taking the periodic repetition x((n))N .
13 / 58
-7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7
1
0
-7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7
15 / 58
x((n))N
1
1
0
x(n)
1
14 / 58

x(n)
1
0
16 / 58

2
12
8
4
0
-4
1
0
15
11
7
3
-1
12
8
4
0
-4
1
0
1
1
-7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7
13
9
5
1
-3
x((n))N
13
9
5
1
-3
14
10
6
2
-2
-7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7
x(n)
x((n))N
15
11
7
3
-1
x(n)
14
10
6
2
-2
x (n)
2
1
-7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7 ...
Therefore x((n))N = x(n).

17 / 58
Circular Convolution: One Interpretation
18 / 58
Circular Convolution: One Interpretation

To compute
PN1
k=0
x1 (k)x2 ((n k))N (or
PN1
k=0
x2 (k)x1 ((n k))N ):
1. Take the periodic repetition of x2 (n) with period N:

x2 (n) =
N1
X
x2 (n lN)
k=0
l=
2. Conduct a standard linear convolution of x1 (n) and x2 (n) for

n = 0, 1, . . . , N 1:
x1 (n) x2 (n) = x1 (n) x2 (n) =
x1 (k)
x2 (n k) =
k=
x1 (k) x2 ((n k))N =
N1
X
N1
X
x1 (k) x2 (n k)
k=0
. . . which makes sense, since x((n))N = x(n).
x1 (k)
x2 (n k)
k=0
Note: x1 (n) x2 (n) = 0 for n < 0 and n N.
19 / 58
20 / 58
Circular Convolution: Another Interpretation
Using DFT for Linear Convolution

To compute
PN1
k=0
x1 (k)x2 ((n k))N (or
PN1
k=0
Therefore, circular convolution and linear convolution are related as

follows:
x2 (k)x1 ((n k))N ):
1. Conduct a linear convolution of x1 (n) and x2 (n) for all n:

xL (n) = x1 (n) x2 (n) =
x1 (k)x2 (n k) =
k=
N1
X
xC (n) = x1 (n) x2 (n) =

x1 (k)x2 (n k)
xL (n lN),
for n = 0, 1, . . . , N 1
Q: When can one recover xL (n) from xC (n)?
When can one use the DFT (or FFT) to compute linear convolution?
A: When there is no overlap in the periodic repetition of xL (n).
When support length of xL (n) N.
n = 0, 1, . . . , N 1
l=
xL (n lN)
l=
k=0
2. Compute the periodic repetition of xL (n) and window the result for
n = 0, 1, . . . , N 1:
x1 (n) x2 (n) =
21 / 58
22 / 58
Filtering of Long Data Sequences
Let x(n) have support n = 0, 1, . . . , L 1.

Let h(n) have support n = 0, 1, . . . , M 1.
We can set N L + M 1 and zero pad x(n) and h(n) to have
support n = 0, 1, . . . , N 1.
1. Take N-DFT of x(n) to give X (k), k = 0, 1, . . . , N 1.
The input signal x(n) is often very long especially in real-time

signal monitoring applications.
For linear filtering via the DFT, for example, the signal must be
limited size due to memory requirements.
2. Take N-DFT of h(n) to give H(k), k = 0, 1, . . . , N 1.

3. Multiply: Y (k) = X (k) H(k), k = 0, 1, . . . , N 1.
4. Take N-IDFT of Y (k) to give y (n), n = 0, 1, . . . , N 1.
23 / 58
24 / 58
Recall, for N = 8 the 8-FFT is given by

Stage 1
x(0)
x(4)
W8
Stage 2
Stage 3
W8
Complexity of N-FFT is N log(N).
If N is too large as for long data sequences, then there is a

significant delay in processing that precludes real-time
processing.
X(2)
-1
2
W8
W8
All N-input samples are required simultaneously by the FFT

operator.
X(0)
x(6)
X(1)
-1
x(2)
-1
X(3)
-1
0
W8
x(1)
-1
X(4)
x(5)
W8
0
W8
-1
-1
0
W8
x(3)
2
W8
-1
2
x(7)
-1
W8
-1
-1
signal
input
X(6)
25 / 58
signal
output
26 / 58
Main advantage: samples of the output y (n) = h(n) x(n) will

be available real-time on a block-by-block basis.
Strategy:
1. Segment the input signal into fixed-size blocks prior to

processing.
2. Compute DFT-based linear filtering of each block separately via
the FFT.
3. Fit the output blocks together in such a way that the overall
output is equivalent to the linear filtering of x(n) directly.
I
Data Processing
Delay
X(7)
Data Acquisition
Delay
W8
0
W8
-1
X(5)
27 / 58
Goal: FIR filtering: y (n) = x(n) h(n)
Two approaches to real-time linear filtering of long inputs:

I
I
Overlap-Add Method
Overlap-Save Method
Assumptions:
I
I
FIR filter h(n) length = M

Block length = L M
28 / 58
Overlap-Add Method
Overlap-Add Method
Overlap-Add Method
Overlap-Add Method
Deals with the following signal processing principles:
I
The linear convolution of a discrete-time signal of length L and a

discrete-time signal of length M produces a discrete-time
convolved result of length L + M 1.
Addititvity:
Overlap-Add Method
(x1 (n)+x2 (n)) h(n) = x1 (n) h(n)+x2 (n) h(n)
29 / 58
Overlap-Add Method
-2
-1
L=4
L=4
L=4
Input
into
blocks
length
L=4
x1(n)
* h(n)
-2
-1
L=4
x2(n)
* h(n)
1
4
-3
-2
-1
L=4
x3(n)
* h(n)
1
10
-3
-2
-1
10
x(n) is divided
non-overlapping
xm (n) each of
L.
10
-3
Overlap-Add Method
10
30 / 58
Overlap-Add Filtering Stage
* h(n)
4
-3
x(n)
1
Each
input
block
xm (n) is individually
filtered as it is received
to produce the output
block ym (n).
makes use of the N-DFT and N-IDFT where: N = L + M 1

I
Thus, zero-padding of x(n) and h(n) that are of length

L, M < N is required.
The actual implementation of the DFT/IDFT will use the

FFT/IFFT for computational simplicity.
+ ...
n
L=4
31 / 58
32 / 58
Overlap-Add Method
Overlap-Add Method
Linear Convolution via the DFT

Length of linear convolution result = Length of DFT
Let xm (n) have support n = 0, 1, . . . , L 1.

l=-2
x (n)
x (n+2N)
We set N L + M 1 (the length of the linear convolution result)

and zero pad xm (n) and h(n) to have support n = 0, 1, . . . , N 1.
-6
-5
-4
-3
-2
-1
1. Take N-DFT of xm (n) to give Xm (k), k = 0, 1, . . . , N 1.
-7
l=1
l=0
-6
-5
-4
-3
-2
-1
l=2
x (n-N)
x (n)
...
-7
l=-1
x (n+N)
x (n-2N)
...
7
no overlap
x~ (n)
support length = 4 = N
3. Multiply: Ym (k) = Xm (k) H(k), k = 0, 1, . . . , N 1.
4. Take N-IDFT of Ym (k) to give ym (n), n = 0, 1, . . . , N 1.
-7
-6
-5
-4
-3
-2
-1
= x (n)
33 / 58
Overlap-Add Method
x(n)
* h(n)
4
-2
-1
L=4
L=4
* h(n)
-1
L=4
x2(n)
* h(n)
1
4
-3
-2
-1
L=4
x3(n)
* h(n)
1
10
-3
-2
-1
10
x(n) is divided
non-overlapping
xm (n) each of
L.
10
-2
4
-3
Input
into
blocks
length
L=4
x1(n)
-3
Overlap-Add Method
* h(n)
10
L=4
34 / 58
x(n)
-3
-2
-1
L=4
L=4
L=4
Each
input
block
xm (n) is individually
filtered as it is received
to produce the output
block ym (n).
+ ...
-2
-1
L=4
y2(n)
-2
-1
y (n) = x(n) h(n)
ADD
to
next
block
2
10
M-1=2
L=4
y3(n)
ADD
to
next
block
+ ...
-2
-1
L=4
35 / 58
The support overlap

amongst the ym (n)
blocks must be accounted for.
10
-3
Output blocks ym (n)

must be fitted together
appropriately to generate:
M-1=2
4
-3
L=4
10
-3
L=4
These extra M-1 samples (i.e., tail)

due to convolution expanding
the support must be added to the
begininning of the next output
block
y1(n)
10
M-1=2
36 / 58
Overlap-Add Method
Overlap-Add Addition Stage
* h(n)
1
4
-3
-2
-1
x(n) = x1 (n) + x2 (n) + x3 (n) + =
L=4
L=4
L=4
These extra M-1 samples (i.e., tail)

due to convolution expanding
the support must be added to the
begininning of the next output
block
y1(n)
xm (n)
10
L=4
From the Addititvity property, since:

1
-3
x(n) h(n) = (x1 (n) + x2 (n) + x3 (n) + ) h(n)

= x1 (n) h(n) + x2 (n) h(n) + x3 (n) h(n) +
X
X
=
xm (n) h(n) =
ym (n)
-2
-1
L=4
y2(n)
-1
6
6
y (n) = x(n) h(n)
10
M-1=2
L=4
y3(n)
m=1
ADD
to
next
block
-2
M-1=2
4
-3
ADD
to
next
block
+ ...
-2
-1
M-1=2
L=4
37 / 58
Overlap-Add Method
Input signal:
The support overlap

amongst the ym (n)
blocks must be accounted for.
10
-3
Output blocks ym (n)

must be fitted together
appropriately to generate:
10
m=1
m=1
Overlap-Add Method
x(n)
38 / 58
Overlap-Add Method
Overlap-Add Method
1
1. Break the input signal x(n) into non-overlapping blocks xm (n) of length L.
-3
-2
-1
10
2. Zero pad h(n) to be of length N = L + M 1.
zeros

4. For each block m:
zeros
Output signal:
4.1
4.2
4.3
4.4
zeros
Add
points
5. Form y (n) by overlapping the last M 1 samples of ym (n) with the first
M 1 samples of ym+1 (n) and adding the result.
Add
points
Zero pad xm (n) to be of length N = L + M 1.

Take N-DFT of xm (n) to give Xm (k), k = 0, 1, . . . , N 1.
Multiply: Ym (k) = Xm (k) H(k), k = 0, 1, . . . , N 1.
Take N-IDFT of Ym (k) to give ym (n), n = 0, 1, . . . , N 1.
39 / 58
40 / 58
Overlap-Add Method
Overlap-Add Method: Cautionary Note
Overlap-Add Method

Output signal:
Add
If you DO NOT overlap and add, but only append the output blocks
ym (n) for m = 1, 2, . . ., then you will not get the true y (n) sequence.
points
Add
points
Q: What sequence will you obtain instead?
41 / 58
Overlap-Add Method
42 / 58
Overlap-Save Method
Overlap-Save Method
zeros
Overlap-Save Method
Overlap-[Discard] Method
zeros
zeros
43 / 58
44 / 58
Overlap-Save Method
Overlap-Save Method
Overlap-Save Method
yL(n) linear
convolution
2
result
Deals with the following signal processing principles:
The N = (L + M 1)-circular convolution of a discrete-time

signal of length N and a discrete-time signal of length M using
an N-DFT and N-IDFT.
xC (n) =
-6
-5
-4
-3
-2
-1
-7
xL (n lN) ,
| {z }
-6
-5
-4
-3
...
-2
-1
Add and keep points only

at n=0, 1, ..., N-1
yC (n)
circular
convolution
result
n = 0, 1, . . . , N 1
yL(n-2N)
+
+
overlap since
N < L+M-1
Time-Domain Aliasing:
-7
yL(n-N)
yL(n)
...
yL(n+N)
yL(n+2N)
l= support=M + N 1
-7
-6
-5
-4
-3
corruption from
previous repetitions
2
1
-2
-1
= yL(n) at n=M-1, M, ..., N-1
45 / 58
Overlap-Save Method
yC ,m (n)
aliasing corruption
yL,m (n)
n = 0, 1, . . . , M 2
n = M 1, M, . . . , N 1
The first M 1 points of a the current filtered output block

ym (n) must be discarded.
The previous filtered block ym1 (n) must compensate by
providing these output samples.
Overlap-Save Method
1. All input blocks xm (n) are of length N = (L + M 1) and

contain sequential samples from x(n).
2. Input block xm (n) for m > 1 overlaps containing the first M 1
points of the previous block xm1 (n) to deal with aliasing
corruption.
where yL,m (n) = xm (n) h(n) is the desired output.

I
46 / 58
Overlap-Save Input Segmentation Stage
Convolution of xm (n) with support n = 0, 1, . . . , N 1 and h(n)

with support n = 0, 1, . . . , M 1 via the N-DFT will produce a
result yC ,m (n) such that:

Overlap-Save Method
I
3. For m = 1, there is no previous block, so the first M 1 points

are zeros.
47 / 58
48 / 58
Overlap-Save Method
Overlap-Save Method
Input signal blocks:
x1 (n) = {0,
|
0, . . .
{z
M 1 zeros
0, x(0), x(1), . . . , x(L 1)}

}
x2 (n) = {x(L M + 1), . . . x(L 1), x(L), . . . , x(2L 1)}

|
{z
}
zeros
last M 1 points from x1 (n)
x3 (n) = {x(2L M + 1), . . . x(2L 1), x(2L), . . . , x(3L 1)}

|
{z
}
point
overlap
last M 1 points from x2 (n)
..
.
point
overlap
The last M 1 points from the previous input block must be saved
for use in the current input block.
49 / 58
Overlap-Save Method
50 / 58
Overlap-Save Method
Using DFT for Circular Convolution
makes use of the N-DFT and N-IDFT where: N = L + M 1

I
Overlap-Save Filtering Stage

I
Only a one-time zero-padding of h(n) of length M L < N is

required to give it support n = 0, 1, . . . , N 1.
The input blocks xm (n) are of length N to start, so no
zero-padding is necessary.
N = L + M 1.
Let xm (n) have support n = 0, 1, . . . , N 1.
We zero pad h(n) to have support n = 0, 1, . . . , N 1.
1. Take N-DFT of xm (n) to give Xm (k), k = 0, 1, . . . , N 1.
The actual implementation of the DFT/IDFT will use the

FFT/IFFT for computational simplicity.
3. Multiply: Ym (k) = Xm (k) H(k), k = 0, 1, . . . , N 1.

4. Take N-IDFT of Ym (k) to give yC ,m (n), n = 0, 1, . . . , N 1.
51 / 58
52 / 58
Overlap-Save Method
Circular Convolution via the DFT
Overlap-Save Method
Overlap-Save Output Blocks
Length of linear convolution result > Length of DFT

yL(n) linear
convolution
2
result
-6
-5
-4
-3
-2
-1
yL(n-N)
yL(n)
...
-7
yL(n+N)
yL(n+2N)
-7
-6
-5
-4
-3
...
+
1
yL(n-2N)
-2
-1
yC ,m (n) =
Add and keep points only

at n=0, 1, ..., N-1
overlap since
N < L+M-1
yC (n)
circular
convolution
result
-7
-6
-5
-4
-3
where yL,m (n) = xm (n) h(n) is the desired output.
corruption from
previous repetitions
aliasing n = 0, 1, . . . , M 2
yL,m (n) n = M 1, M, . . . , N 1
-2
-1
= yL(n) at n=M-1, M, ..., N-1
53 / 58
Overlap-Save Method
= {y1 (0),
|
y1 (1), . . .
{z
y1 (M 2), y (0), . . . , y (L 1)}

}
= {y2 (0),
|
y2 (1), . . .
{z
y2 (M 2), y (L), . . . , y (2L 1)}

}
= {y3 (0),
|
y3 (1), . . .
{z
y3 (M 2), y (2L), . . . , y (3L 1)}

}
Overlap-Save [Discard] Output Blocks

y1 (n)
54 / 58
Overlap-Save Method
Overlap-Save Output Stage

Output signal blocks:
M 1 points corrupted from aliasing
y2 (n)
Discard
y3 (n)
points
Discard
points
Discard
points
where y (n) = x(n) h(n) is the desired output.
The first M 1 points of each output block are discarded.

The remaining L points of each output block are appended to form
y (n).
55 / 58
56 / 58
Overlap-Save Method
Overlap-Save Method
Overlap-Save Method
Overlap-Save Method
1. Insert M 1 zeros at the beginning of the input sequence x(n).
Input signal blocks:
2. Break the padded input signal into overlapping blocks xm (n) of length
N = L + M 1 where the overlap length is M 1.
zeros
3. Zero pad h(n) to be of length N = L + M 1.

5. For each block m:
point
overlap
5.1 Take N-DFT of xm (n) to give Xm (k), k = 0, 1, . . . , N 1.

5.2 Multiply: Ym (k) = Xm (k) H(k), k = 0, 1, . . . , N 1.
5.3 Take N-IDFT of Ym (k) to give ym (n), n = 0, 1, . . . , N 1.
Output signal blocks:
point
overlap
Discard
5.4 Discard the first M 1 points of each output block ym (n).

6. Form y (n) by appending the remaining (i.e., last) L samples of each block
ym (n).
points
Discard
points
Discard
points
57 / 58

58 / 58

8 Kundur Overlap Save Add PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

8 Kundur Overlap Save Add PDF

Uploaded by

Copyright:

Available Formats

Overlap-Save and Overlap-Add

Circular and Linear Convolution

The Discrete Fourier Transform Pair

Overlap-Save and Overlap-Add

DFT and inverse-DFT (IDFT):

Dr. Deepa Kundur

Dr. Deepa Kundur (University of Toronto)

Overlap-Save and Overlap-Add

Overlap-Save and Overlap-Add

Circular and Linear Convolution

n=0 x(n)y (n)

Dr. Deepa Kundur (University of Toronto)

Overlap-Save and Overlap-Add

Overlap-Save and Overlap-Add

Important DFT Properties

Dr. Deepa Kundur (University of Toronto)

Circular and Linear Convolution

k=0 X (k)Y (k)

Overlap-Save and Overlap-Add

Q: What is circular convolution?

Dr. Deepa Kundur (University of Toronto)

Overlap-Save and Overlap-Add

Overlap-Save and Overlap-Add

Circular and Linear Convolution

Overlap-Save and Overlap-Add

Circular and Linear Convolution

Assume: x1 (n) and x2 (n) have support n = 0, 1, . . . , N 1.

Assume: x1 (n) and x2 (n) have support n = 0, 1, . . . , N 1.

Examples: N = 10 and support: n = 0, 1, . . . , 9

x1 (k)x2 ((n k))N

where (n)N = n mod N = remainder of n/N.

Dr. Deepa Kundur (University of Toronto)

Overlap-Save and Overlap-Add

Overlap-Save and Overlap-Add

Circular and Linear Convolution

nonneg integer < N

Dr. Deepa Kundur (University of Toronto)

Circular and Linear Convolution

mod N = remainder of n/N

x((n))4 will be periodic with period 4. The repeated pattern will be

Overlap-Save and Overlap-Add

Modulo Indices and Periodic Repetition

mod N = remainder of n/N

Overlap-Save and Overlap-Add

Overlap-Save and Overlap-Add

Modulo Indices and Periodic Repetition

Dr. Deepa Kundur (University of Toronto)

Thus, x((n))N is a periodic signal comprised of the following

Dr. Deepa Kundur (University of Toronto)

Overlap-Save and Overlap-Add

Overlap-Save and Overlap-Add

Circular and Linear Convolution

Overlap-Save and Overlap-Add

Circular and Linear Convolution

Overlap During Periodic Repetition

Overlap During Periodic Repetition

A periodic repetition makes an aperiodic signal x(n), periodic to

A periodic repetition makes an aperiodic signal x(n), periodic to

There are two important parameters:

smallest support length > period of repetition

smallest support length period of repetition

Dr. Deepa Kundur (University of Toronto)

Overlap-Save and Overlap-Add