Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Fast Fourier Transform01:10

Fast Fourier Transform

636
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
636
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

244
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
244
Discrete Fourier Transform01:15

Discrete Fourier Transform

601
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
601
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

780
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
780
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

484
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
484
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

204
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
204

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Ego-R1: Agentic Chain-of-Tool-Thought for Ultra-Long Egocentric Video Reasoning.

IEEE transactions on pattern analysis and machine intelligence·2026
Same author

Biomarkers associated with future suicide risk enhance predictive performance in psychiatric inpatients.

BMJ health & care informatics·2026
Same author

Harmonic analysis method based on multi-stage frequency correction.

The Review of scientific instruments·2026
Same author

Exploring the potential of chitosan-α-lipoic acid copolymer/sodium alginate-coated hollow zein nanoparticles for oral astaxanthin delivery: Structural characterization, safety assessment and anti-ulcerative colitis effect.

International journal of biological macromolecules·2026
Same author

The Long-Term Efficacy of Cephalosporin in Elderly Hip Fracture Patients: A Comprehensive Analysis.

Journal of clinical medicine·2025
Same author

Factors influencing overdose and misuse of gender-affirming medication in Chinese transgender and gender diverse individuals: A qualitative study of experience and perspectives.

International journal of transgender health·2025
Same journal

A compact low-power magnetic particle imaging scanner based on a permanent-magnet field-free-line generator with high gradient.

The Review of scientific instruments·2026
Same journal

Achieving ultrahigh resolution with high efficiency: Optical design of the two-dimensional Resonant Inelastic X-ray Scattering (2D-RIXS) spectrometer at NanoTerasu beamline 02U.

The Review of scientific instruments·2026
Same journal

Automated laboratory x-ray diffractometer and fluorescence spectrometer for high-throughput materials characterization.

The Review of scientific instruments·2026
Same journal

Nonlinear Bayesian Doppler tomography for simultaneous reconstruction of flow and temperature.

The Review of scientific instruments·2026
Same journal

A Reflectance-based multimodal wearable photoplethysmography (PPG) sensor.

The Review of scientific instruments·2026
Same journal

Temporal analysis of products-Raman (TAP-Raman): An integrated setup for operando spectroscopy and transient kinetic analysis.

The Review of scientific instruments·2026
See all related articles

Related Experiment Video

Updated: Nov 19, 2025

Functional Near-Infrared Spectroscopy Hyperscanning Study in Psychological Counseling
06:04

Functional Near-Infrared Spectroscopy Hyperscanning Study in Psychological Counseling

Published on: January 17, 2025

967

A novel algorithm for implementing time-frequency transform with low computation.

Yijiao Zhang1, Shulin Tian1, Huiqing Pan1

  • 1School of Automation Engineering, University of Electronic Science and Technology of China, No. 2006 Xiyuan Ave., West Hi-Tech Zone, Chengdu 611731, China.

The Review of Scientific Instruments
|January 30, 2021
PubMed
Summary
This summary is machine-generated.

A new two-dimensional sliding fast Fourier transform (2D SFFT) algorithm reduces computation compared to traditional methods. This 2D SFFT enhances ultra-short pulse detection in mixed-domain oscilloscopes.

More Related Videos

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

43.3K
Combined Invasive Subcortical and Non-invasive Surface Neurophysiological Recordings for the Assessment of Cognitive and Emotional Functions in Humans
08:25

Combined Invasive Subcortical and Non-invasive Surface Neurophysiological Recordings for the Assessment of Cognitive and Emotional Functions in Humans

Published on: May 19, 2016

11.0K

Related Experiment Videos

Last Updated: Nov 19, 2025

Functional Near-Infrared Spectroscopy Hyperscanning Study in Psychological Counseling
06:04

Functional Near-Infrared Spectroscopy Hyperscanning Study in Psychological Counseling

Published on: January 17, 2025

967
Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

43.3K
Combined Invasive Subcortical and Non-invasive Surface Neurophysiological Recordings for the Assessment of Cognitive and Emotional Functions in Humans
08:25

Combined Invasive Subcortical and Non-invasive Surface Neurophysiological Recordings for the Assessment of Cognitive and Emotional Functions in Humans

Published on: May 19, 2016

11.0K

Area of Science:

  • Signal Processing
  • Fourier Analysis
  • Algorithm Development

Background:

  • Traditional sliding discrete Fourier transform (DFT) algorithms can be computationally intensive.
  • Detecting ultra-short pulses in mixed-domain oscilloscopes presents challenges due to frequency-domain limitations.

Purpose of the Study:

  • To introduce a novel two-dimensional sliding fast Fourier transform (2D SFFT) algorithm.
  • To demonstrate the computational efficiency and accuracy of the 2D SFFT algorithm.
  • To apply the 2D SFFT algorithm for improved ultra-short pulse detection.

Main Methods:

  • Organizing one-dimensional data into a two-dimensional structure.
  • Calculating current spectrums using existing spectrums and new data.
  • Comparing computational requirements against traditional sliding DFT and fast Fourier transform (FFT) algorithms.

Main Results:

  • The 2D SFFT algorithm requires less computation than traditional sliding DFT for sliding rates >= 4/M.
  • The 2D SFFT algorithm is computationally more efficient than FFT for sliding rates <= 6.25%.
  • The spectral error between 2D SFFT and FFT is minimal, less than 10^-10.

Conclusions:

  • The proposed 2D SFFT algorithm offers significant computational advantages.
  • The 2D SFFT algorithm improves the detection of previously invisible ultra-short pulses.
  • This advancement enhances the probability of intercept for mixed-domain oscilloscopes.