Transformada Rápida de Fourier

Authors

  • Michael Joel Spilsbury Universidad Nacional Autónoma de Honduras en el Valle de Sula
  • Armando Euceda Escuela de Fı́sica - Universidad Nacional Autónoma de Honduras

DOI:

https://doi.org/10.5377/ref.v4i2.8276

Keywords:

Fast Fourier transform, Algorithm, Discrete Fourier transform, Cooley, Tukey

Abstract

The following article is a brief introduction of fast Fourier transform (FFT), which is an algorithm for the calculation of the discrete Fourier transform that reduce the runtime of the program for calculating the Fourier transform greatly. Since 1965, when James W. Cooley and John W. Tukey published this algorithm, its use has expanded quickly and personal computers have generated an explosion of further FFT applications. Examples of the FFT application are circuit design, spectroscopy, crystallography, signal processing and communications, images, etc.

Downloads

Download data is not yet available.
Abstract
2303
PDF (Español (España)) 3487
Cover REF Vol.4(2)

Downloads

Published

2016-12-21

How to Cite

Spilsbury, M. J., & Euceda, A. (2016). Transformada Rápida de Fourier. Revista De La Escuela De Física, 4(2), 45–52. https://doi.org/10.5377/ref.v4i2.8276

Issue

Vol. 4 No. 2 (2016)

Section

Investigation

License

© Revista de la Escuela de Física