This paper reviews different recursive structures of Sliding Discrete Fourier Transform
(SDFT) algorithms. Normally, a SDFT algorithm is introduced to design a filter or to compute
N-point DFT through subsequent iterations in a recursive manner by allowing window shift
technique. The proposed paper deals with comparative analysis of different SDFT structures;
rSDFT, SGDFT, rSGDFT, DnSDFT, mDFT, HDFT, mHDFT, SWIFT, oSDFT to examine their
characteristics such as computational complexity, stability, filter structure, frequency …