A Faster DFT Algorithm for Specific Binary Pulse Sequences

Discrete Fourier Transform (DFT) finds application in various engineering domains such as communication systems, image and speech processing, biomedical signal and seismic signal processing etc. A computationally efficient algorithm for computing DFT was given by Cooley-Tukey, thereby reducing the time complexity of DFT calculation from O(N2) to O(NlogN). In this paper, we present an algorithm to compute DFT of specific binary pulse sequences. Here, we demonstrate that for these specific pulse sequences, the complexity of DFT computation is O(N).