Overlap-Save Method

In this method the data is divided into blocks of length L samples, but with
successive blocks overlapping by x 1. The DFT convolution is done on each block
with length L. It uses no zero padding to prevent time aliasing. Instead, it discards output
samples corrupted by time aliasing each frame, and overlaps the input frames by the same amount.
More specifically:

Overlap-Add Method:
In this method the data is divided into blocks of length L, but the DFT convolution is
done in zero-padded blocks so that wrap-around errors do not occur. In this case the
output is identical to the linear
convolution of the two blocks, with an initial rise of length x-1 samples, and a
trailing section also of length x-1 samples. It is easy to show that if the trailing
section of and nth output block is overlapped with the initial section of the (n+ 1)th
block, the samples add together to generate the correct output values.

The radix-2 decimation-in-time algorithm rearranges the discrete Fourier transform (DFT)
equation into two parts: a sum over the even-numbered discrete-time indices and a sum over
the odd-numbered indices . and then combines those two results to produce the DFT of

the whole sequence.