SIMPLIFIED BLUESTEIN NUMERICAL FAST FOURIER TRANSFORMS ALGORITHM FOR DSP AND ASP

This research was designed to develop a simplified Bluestein numerical FFT algorithm necessary for the processing of digital signals. The simplified numerical algorithm developed in this study is abbreviated with SBNADSP. The methodology adopted in this work was iterative and incremental development design. The major technology used in this work is the Bluestein numerical FFT algorithm. The study set the pace for its goal by re-indexing, decomposing, and simplifying the default Fast Fourier Transform Algorithms (the Bluestein FFT Algorithm). The improved efficiency of the Bluestein FFT algorithm is accounted for by the obvious reduction in the number of operations and operators in the simplified Bluestein algorithms. The SBTNADSP is designed to have four products, and three exponentiations against the default Bluestein FFT algorithm which has six exponentiations and eight products. Since the increase in the number of operators increases the length of operation, it is therefore reasonable to infer that the algorithm with the less number of operators will run shorter execution time than the one with greater operators. In line with this, we conclude that SBNADSP is of greater efficiency than the Bluestein numerical algorithm. The result of this study showed that a faster numerical algorithm other than the Bluestein fft algorithms is possible for the processing of digital signals.