Overlap-save method:

In this method the SIZE of the input data block is N=L+M-1

Each data block consists of the last M-1 data points of the previous data block followed by L NEW data points

In each output block M-1 points are corrupted due to aliasing as circular convolution is employed

To form the output sequence the FIRST

M-1 data points are discarded in each output block and the remaining data are FITTED together

Overlap-add method:

In this method the size of the input data block is L

Each data block is L points and we append M-1 zeros to compute N point DFT

In this no corruption due to aliasing as linear convolution is performed using circular convolution

To form the output sequence the last

M-1 points from each output block is added to the first M-1 points of the succeeding block

Overlap-save method:

In this method the size of the input data block is N=L+M-1

Each data block consists of the last M-1 data points of the previous data block followed by L new data points

In each output block M-1 points are corrupted due to aliasing as circular convolution is employed

To form the output sequence the first

M-1 data points are discarded in each output block and the remaining data are fitted together

Overlap-add method:

In this method the size of the input data block is L

Each data block is L points and we append M-1 zeros to compute N point DFT

In this no corruption due to aliasing as linear convolution is performed using circular convolution

To form the output sequence the last

M-1 points from each output block is added to the first M-1 points of the succeeding block