A Modified Algorithm of Fast Fourier Transform

Authors

  • Rafayel Barseghyan Institute for Informatics and Automation Problems of NAS RA

Abstract

In this paper we present a new, efficient modification of split-radix algorithm for computing a power of four fast Fourier transforms.

References

D.E. Knuth, Fundamental Algorithms, 3rd ed., ser. "The Art of Computer Programming". Addison-Wesley, vol. 1, 1997.

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

M. Frigo and S.G. Johnson, "A modified split-radix FFT with fewer arithmetic operations", IEEE TRANS. SIGNAL PROCESSING - vol. 55, pp. 111-119, 2207.

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

Downloads

Published

2021-12-10

How to Cite

Barseghyan, R. . (2021). A Modified Algorithm of Fast Fourier Transform. Mathematical Problems of Computer Science, 32, 39–44. Retrieved from http://93.187.165.2/index.php/mpcs/article/view/360

Issue

Vol. 32 (2009): Mathematical Problems of Computer Science

Section

Articles

License

Creative Commons License

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