Related Experiment Video
Updated: Apr 13, 2026

Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy
Published on: June 15, 2022
The discrete Fourier transform algorithm for determining decay constants—Implementation using a field programmable
G Bostrom1, D Atkinson2, A Rice1
1Physics Department, Portland State University, Portland, Oregon 97201, USA.
Abstract:
Cavity ringdown spectroscopy (CRDS) uses the exponential decay constant of light exiting a high-finesse resonance cavity to determine analyte concentration, typically via absorption. We present a high-throughput data acquisition system that determines the decay constant in near real time using the discrete Fourier transform algorithm on a field programmable gate array (FPGA). A commercially available, high-speed, high-resolution, analog-to-digital converter evaluation board system is used as the platform for the system, after minor hardware and software modifications. The system outputs decay constants at maximum rate of 4.4 kHz using an 8192-point fast Fourier transform by processing the intensity decay signal between ringdown events. We present the details of the system, including the modifications required to adapt the evaluation board to accurately process the exponential waveform. We also demonstrate the performance of the system, both stand-alone and incorporated into our existing CRDS system. Details of FPGA, microcontroller, and circuitry modifications are provided in the Appendix and computer code is available upon request from the authors.
More Related Videos
08:31Luminescence Resonance Energy Transfer to Study Conformational Changes in Membrane Proteins Expressed in Mammalian Cells
Published on: September 16, 2014
08:12Author Spotlight: Exploring Light-Driven Chemical Reactions and Energy-Harnessing Devices in Photochemical Research
Published on: February 16, 2024
Related Concept Videos
Discrete Fourier Transform
Discrete-Time Fourier Series
For a discrete-time periodic signal x[n]...
Discrete-time Fourier transform
One of the notable...
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Trigonometric Fourier series
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
Exponential Fourier series
Euler's identity...