Skip to content
#

fast-fourier-transform

Here are 197 public repositories matching this topic...

FFT is an efficient algorithm for computing the discrete Fourier transform (DFT) of a sequence, enabling the frequency analysis of signals in linear time. It plays a crucial role in various applications, including image processing, audio compression, and cryptography.

  • Updated Feb 13, 2023
  • Kotlin

Matlab scripts for analyzing calcium imaging data presented in "Neural Coding of Leg Proprioception in Drosophila" (Mamiya, Gurung, and Tuthill (2018) Neuron: DOI:https://doi.org/10.1016/j.neuron.2018.09.009)

  • Updated Jul 8, 2020
  • MATLAB

Improve this page

Add a description, image, and links to the fast-fourier-transform topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the fast-fourier-transform topic, visit your repo's landing page and select "manage topics."

Learn more