A series of Jupyter notebooks and python files which stream audio from a microphone using pyaudio, then processes it.
-
Updated
Jul 14, 2024 - Python
A series of Jupyter notebooks and python files which stream audio from a microphone using pyaudio, then processes it.
Self-contained Jupyter notebook that walks through loading raw ECG, designing digital filters, visualising spectra, cleaning noise and extracting heart-rate features—perfect for teaching bio-signal processing.
Notes on some concepts in signal processing, wave theory and geophysics.
iPython Notebook that goes over the theory of the DFT and FFT as well as the implementation of various radix-2 algorithms in Python
PyAudio jupyter notebook with samples including live spectrogram / fft , recording , playback
ICPC Team Notebook (Cheatsheet) featuring essential C++ algorithms, data structures, graph theory, geometry, math, and string algorithms for competitive programming.
A Google Colab notebook for the Fast Fourier Transform (FFT) algorithm written in Python.
DSP code in Python
Three-notebook tutorial on the FFT and seasonality: build the transform by hand, prove it on the Keeling curve, then turn hourly demand into a staffing baseline, an anomaly alarm, and a capacity plan.
Code snippets and notebooks used in PDS classes.
Interactive Jupyter Notebook to show how the fft works
Engineering notebook exploring 2D/1D FFT, radial ideal filters, and Butterworth filter design for image fusion and audio source isolation.
Executed Jupyter notebooks and searchable reports for DSP Labs 1-7: sampling, LTI systems, Fourier analysis, frequency response, FIR, IIR, and audio filtering.
2D Fourier Transform applied to image processing: frequency decomposition, sinusoidal grating visualization, iterative reconstruction, and frequency filtering on an Earth image. Interactive Python notebook (Google Colab / Jupyter).
Python notebook containing implementations for the Discrete Fourier Transform which use different versions of the Fast Fourier Transform for their computations. The optimal implementation is then used to solve a variety of problems. This is an extension of the work done in Algorithms II (202).
Radix-2 Cooley-Tukey FFT kernel in CUDA/C with shared-memory stage fusion and a coalesced bit-reversal transpose. Reaches 25% of cuFFT throughput and 70x over a single-threaded CPU on 1M-point transforms (NVIDIA T4). Every figure reproducible from the included Colab notebook.
To associate your repository with the fft topic, visit your repo's landing page and select "manage topics."