Trasformada rápida de Fourier utilizando Python

Authors

  • Michael Spilsbury Escuela de F´ısica, Universidad Nacional Aut´onoma de Honduras
  • Armando Euceda Escuela de F´ısica, Universidad Nacional Aut´onoma de Honduras

DOI:

https://doi.org/10.5377/ref.v5i1.8317

Keywords:

Fast fourier transform, algorithm, discrete Fourier transform, Cooley, Tukey, programming, Python, Fortran

Abstract

Next a computer program is presented to calculate the discrete Fourier transform using the fast Fourier transform algorithm. Since 1965[2], 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. The programming language to use is Python, which is a multi-paradigm programming language, this means that rather than forcing programmers to adopt a particular style of programming allows several styles: object-oriented, functional and imperative programming. Python users often refer to the Python philosophy is quite analogous to the Unix philosophy. At the same time Fortran module will be integrated to improve performance.

Downloads

Download data is not yet available.
Abstract
679
PDF (Español (España)) 589

Published

2017-06-30

How to Cite

Spilsbury, M., & Euceda, A. (2017). Trasformada rápida de Fourier utilizando Python. Revista De La Escuela De Física, 5(1), 6–10. https://doi.org/10.5377/ref.v5i1.8317

Issue

Section

Investigation