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

572
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...
572
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

429
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]...
429
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

664
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...
664
Properties of Fourier series II01:21

Properties of Fourier series II

342
Time scaling of signals is a crucial concept in signal processing that affects the Fourier series representation without altering its coefficients. The process modifies the fundamental frequency, thereby changing how the series represents the signal over time. This principle is essential in various applications, including audio and image processing, where signal manipulation is frequent. Understanding function symmetries is fundamental to simplifying the Fourier series.
A function f(t) is...
342
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

202
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....
202
Continuous -time Fourier Transform01:11

Continuous -time Fourier Transform

540
The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
540

You might also read

Related Articles

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

Sort by
Same author

Automatic Evaluation Algorithms for Radio Tomography Imaging Methods.

Sensors (Basel, Switzerland)·2025
Same author

A New Digital Platform for Collecting Measurement Data from the Novel Imaging Sensors in Urology.

Sensors (Basel, Switzerland)·2022
Same author

Plug Regime Flow Velocity Measurement Problem Based on Correlability Notion and Twin Plane Electrical Capacitance Tomography: Use Case.

Sensors (Basel, Switzerland)·2021
Same journal

RETRACTED: Zhang et al. A Novel Framework for Reconstruction and Imaging of Target Scattering Centers via Wide-Angle Incidence in Radar Networks. <i>Sensors</i> 2025, <i>25</i>, 6802.

Sensors (Basel, Switzerland)·2026
Same journal

Enhancing Unsupervised Multi-Source Domain Adaptation for Person Re-Identification via Mixture of Experts and Graph-Based Relation.

Sensors (Basel, Switzerland)·2026
Same journal

Development of an Instrumented Glove for Palmar Pressure Assessment in Kayakers.

Sensors (Basel, Switzerland)·2026
Same journal

Development and Experimental Validation of an Autonomous IoT-Based Monitoring System for Real-Time Water Quality Assessment in the Amazon River.

Sensors (Basel, Switzerland)·2026
Same journal

Semi-Supervised Adversarial Learning Framework for Controller Area Network Bus Intrusion Detection.

Sensors (Basel, Switzerland)·2026
Same journal

Smart Optimization Method for Safety Signs in Innovative Manufacturing Environments Integrating Industrial Field IoT Sensors and Knowledge Graphs.

Sensors (Basel, Switzerland)·2026
See all related articles

Related Experiment Video

Updated: Oct 30, 2025

Gain-compensation Methodology for a Sinusoidal Scan of a Galvanometer Mirror in Proportional-Integral-Differential Control Using Pre-emphasis Techniques
09:01

Gain-compensation Methodology for a Sinusoidal Scan of a Galvanometer Mirror in Proportional-Integral-Differential Control Using Pre-emphasis Techniques

Published on: April 4, 2017

8.8K

Short-Time Fourier Transform Based on Metaprogramming and the Stockham Optimization Method.

Grzegorz Rybak1, Krzysztof Strzecha1

  • 1Institute of Applied Computer Science, Lodz University of Technology, 90-537 Lodz, Poland.

Sensors (Basel, Switzerland)
|July 2, 2021
PubMed
Summary
This summary is machine-generated.

A new Java extension for the Short-Time Fourier Transform (STFT) algorithm optimizes performance by moving computations to program generation. This high-performance STFT solution enhances efficiency without bit-reversal, suitable for real-time applications.

Keywords:
DSPECTJavaSTFTStockham algorithmbutterfly operationmetaprogrammingprogram optimization

More Related Videos

Proton Transfer and Protein Conformation Dynamics in Photosensitive Proteins by Time-resolved Step-scan Fourier-transform Infrared Spectroscopy
10:03

Proton Transfer and Protein Conformation Dynamics in Photosensitive Proteins by Time-resolved Step-scan Fourier-transform Infrared Spectroscopy

Published on: June 27, 2014

18.1K
Computer-based Multitaper Spectrogram Program for Electroencephalographic Data
04:13

Computer-based Multitaper Spectrogram Program for Electroencephalographic Data

Published on: November 13, 2019

12.5K

Related Experiment Videos

Last Updated: Oct 30, 2025

Gain-compensation Methodology for a Sinusoidal Scan of a Galvanometer Mirror in Proportional-Integral-Differential Control Using Pre-emphasis Techniques
09:01

Gain-compensation Methodology for a Sinusoidal Scan of a Galvanometer Mirror in Proportional-Integral-Differential Control Using Pre-emphasis Techniques

Published on: April 4, 2017

8.8K
Proton Transfer and Protein Conformation Dynamics in Photosensitive Proteins by Time-resolved Step-scan Fourier-transform Infrared Spectroscopy
10:03

Proton Transfer and Protein Conformation Dynamics in Photosensitive Proteins by Time-resolved Step-scan Fourier-transform Infrared Spectroscopy

Published on: June 27, 2014

18.1K
Computer-based Multitaper Spectrogram Program for Electroencephalographic Data
04:13

Computer-based Multitaper Spectrogram Program for Electroencephalographic Data

Published on: November 13, 2019

12.5K

Area of Science:

  • Computer Science
  • Signal Processing
  • Algorithm Optimization

Background:

  • High-performance algorithms are crucial for efficient signal processing tasks.
  • Existing libraries like FFTW and JTransform offer common solutions for Fast Fourier Transform (FFT) and Short-Time Fourier Transform (STFT).
  • Java-based implementations often face performance challenges compared to native code.

Purpose of the Study:

  • To present a novel, high-performance STFT algorithm extension implemented entirely in Java.
  • To enhance computational efficiency for non-parallel processing environments.
  • To demonstrate the applicability of the optimized STFT in real-world industrial measurement systems.

Main Methods:

  • Developed a Java-based STFT extension adapting the Stockham algorithm using metaprogramming techniques.
  • Shifted complex computations and expensive functions from runtime to the program generation phase.
  • Eliminated the need for bit-reversal permutation operations during runtime.
  • Conducted performance tests using the Java Virtual Machine (JVM) and the Java Microbenchmark Harness (JMH) library, considering JVM warm-up effects.

Main Results:

  • The developed Java STFT extension demonstrates competitive performance against established libraries like FFTW and JTransform.
  • Significant reduction in execution time achieved through metaprogramming and elimination of bit-reversal.
  • The optimized algorithm was successfully integrated into an Electrical Capacitance Tomography (ECT) system.

Conclusions:

  • The Java STFT extension offers a high-performance alternative for non-parallel computations.
  • Metaprogramming and strategic computation shifting effectively optimize STFT execution time.
  • The enhanced STFT algorithm provides a viable solution for real-time industrial monitoring, as demonstrated in an ECT system for material change detection.