# New Approach to FFT Algorithms

## Abstract

In this paper we present a new, efficient modification of split-radix algorithm for computing a power of two discrete Fourier transforms. The developed algorithm allows to 40% real arithmetic operations reduction in comparison with previous best results for 16-point discrete Fourier transform.

## References

R. Blahut, Fast Algorithms for Digital Signal Processing. Addison-Wesley, 1985.

P. Duhamel and M. Vetterli, Fast Fourier transforms: a tutorial review and a state of the art, Signal Processing - Apr., vol. 19, pp. 259-299, 1990.

M. Frigo and S.G. Johnson, “A modified split-radix FFT with fewer arithmetic operations", IEEE Trans. Signal Proccessing, vol. 55, pp. 111-119, 2007.

H. Sarukhanyan, S. Agaian, “Conventional, Integer to Integer and Quantized Fast Fourier Transforms", CSIT, pp. 204-207, 2007.

I.G. Petrovski, Lectures on the theory of ordinary differential equations, (in Russian), 1984.

M. Vetterli, H.J. Nussbaumer, “Simple FFT and DCT algorithms with reduced number of operations", Signal Processing, vol. 6, Nr. 4, pp. 267-278, 1984.

R. Barseghyan, “FFT with lifting transforms", 3-th annual conference, RAU, (submitted), 2009.

R. Barseghyan, “Split-radix FFT algorithm with lifting steps", Vestnik RAU, Series: Physics-mathematics and natural science, pp. 42-50, 2009.

## Downloads

## Published

## How to Cite

*Mathematical Problems of Computer Science*,

*33*, 24–34. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/325

## Issue

## Section

## License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.