ON THE COMPARATIVE ANALYSIS OF THE COOLEY-TUKEY AND BLUESTEIN NUMERICAL FAST FOURIER TRANSFORMS ALGORITHMS FOR DIGITAL SIGNAL PROCESSING

Constance Izuchukwu Amannah

Abstract


ABSTRACT

 

This study was designed to compare the computing efficiency of C-TNADSP and the BNADSP to ascertain a more efficient numerical algorithm necessary for the processing of digital signals. The faster numerical algorithm established in this study is abbreviated with RCC-TNADSP (Resultant Compared C-TBNADSP). The methodology adopted in this work was comparative analysis development design. The major technologies used in this work are the C-TNADSP and BNADSP, and the c++. The c++ served as a signal processing language simulator (SPLS). The execution times of the Cooley-Tukey and the Bluestein algorithms were 3.44 seconds and 3.50 seconds respectively.  On comparing the speeds of the fast Cooley–Tukey and the fast Bluestein algorithms we observed that the Cooley-Tukey algorithm has 0.06 seconds speed improvement over the Bluestein algorithm. In line with this outcome, we concluded that the Cooley-Tukey algorithm (C-TNADSP) is faster than the Bluestein algorithm (BNADSP). In the same vein the Cooley-Tukey algorithm (C-TNADSP) is therefore the fastest DSP algorithm. This is however faster than the spectrum of FFT algorithms of O(nlogn) computing speed. The algorithms were tested on input block width 1000 units, and above, and can be implemented on input size of 100 000, and 1000 000 000 without the challenge of storage overflow. The input samples tested in this work was the discretized pulse wave form with undulating shape out of which the binary equivalents were extracted. Other forms of signals may also be tested in this fast algorithm provided they are interpreted in the digital wave type.

 

KEYWORDS:  Algorithm, FFT, Cooley-Tukey, Bluestein, Comparison, Analysis, FFT


Full Text:

PDF

References


REFERENCES

Vladimir, P. and Zlatka, N., Georgi, I., Miglen, O., (2011). Complex Digital Signal Processing in Telecommunications: Applications of Digital Signal Processing, Dr. Christian Cuadrado-Laborde (Ed.), 307-406.

Saeed, B. (2003). Interpolation in Digital Signal Processing and Numerical Analysis. New York: Springer-Verlag.

Fraser, D. (1989). Interpolation by the FFT Revisited An Experimental Investigation, IEEE Transactions on Acoustics, Speech, and Signal Processing, (37)5, pp. 665-675.

Matthew, P.D. (2000). Efficient Digital Filters, IEEE Transactions on Acoustics, Speech and Signal Processing, ASSP-

Pedro, F. Z. T. (2009). Algorithms and tools for automatic generations of DSP hardware structures, Edition, Boston: McGraw Hill.pp.18-23, 317-320.

[21] Pavan Kumar K.M., Priya Jain, Ravi Kiran S, Rohith N., Ramamani K. FFT Algorithm: A Survey. The International Journal of Engineering and Science (IJES) Volume 2 Issue 4 pages 22-26, 2013 ISSN(e): 2319-1813 ISSN():.

Jianxin, X., Johnson, J.m Rebert, Padua, D. (2001). SPL: A Language and Compiler for DSP algorithms.

Frigo, M. and Johnson, S.G. (1998). FFTW: An Adaptive Software architecture for the FFT. In ICASSP, Vol.3, pp 1381 – 1384

Cooley James W., and John W. Tukey (1965). An algorithm for the machine calculation of complex fourier series. Mathematics computer. Vol. 19, 1965




DOI: https://doi.org/10.23956/ijarcsse.v7i10.321

Refbacks

  • There are currently no refbacks.




© International Journals of Advanced Research in Computer Science and Software Engineering (IJARCSSE)| All Rights Reserved | Powered by Advance Academic Publisher.