SIMPLIFIED BLUESTEIN NUMERICAL FAST FOURIER TRANSFORMS ALGORITHM FOR DSP AND ASP

Amannah; Bakpo

doi:10.29121/granthaalayah.v3.i11.2015.2925

Authors

Amannah, Constance Izuchukwu Department of Computer Science, University of Nigeria, Nsukka, Enugu State
Bakpo, Francis Sunday Department of Computer Science, University of Nigeria, Nsukka, Enugu State

DOI:

https://doi.org/10.29121/granthaalayah.v3.i11.2015.2925

Keywords:

Bluestein FFT, FFT, Algorithm, Simplified, Efficiency, Fast

Abstract [English]

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 fftalgorithms is possible for the processing of digital signals.

Downloads

Download data is not yet available.

References

Vladimir, P. andZlatka, 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-

Hamming, R. and Kaiser, J. (1977). Sharpening the Response of a Symmetric No recursive Filter by Multiple Use of the Same Filter , ” IEEE Trans. Acoustics, Speech, Signal Proc, ASSP, (25) 5 , pp. 415 – 422 .

Yin, L. G., Agiieswari, K. R., (2005). Evaluation of DSP Based Numerical Relay for Over Current Protection Centre for Communication Service Convergence Technologies (CCSCT). Department of Electronics and Communication Engineering, Beijing China.

Areva, T.D. (1995). Network Protection and Automation Guide.Prentice Hall. New Jersey.

Khederzadch, M. (2006). Back-up protection of distance relay second zone by directional ocercurrent relays with combined curves, in IEEE Power Engineering Society General Meeting. DOI: https://doi.org/10.1109/PES.2006.1709262

Price, E. (2010). The next step in the evolution of protection and control implementation, in Annual conference for Protective relay Engineers, Moscow, Russia, pp 1-16. DOI: https://doi.org/10.1109/CPRE.2010.5469522

An Introduction to the Mathematics of Digital Signal Processing: Part I:Algebra, Trigonometry, and the Most Beautiful Formula in Mathematics Author(s): F. R. Moore Source: Computer Music Journal, Vol. 2, No. 1, (Jul., 1978), pp. 38-47 Published by: The MIT Press Stable DOI: https://doi.org/10.2307/3680137

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().