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

Continuous -time Fourier Transform01:11

Continuous -time Fourier Transform

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

Discrete-time Fourier transform

1.2K
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...
1.2K
Fast Fourier Transform01:10

Fast Fourier Transform

978
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...
978
Properties of Fourier Transform I01:21

Properties of Fourier Transform I

700
The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
700
Properties of Fourier Transform II01:24

Properties of Fourier Transform II

807
The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
807
Discrete Fourier Transform01:15

Discrete Fourier Transform

938
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...
938

You might also read

Related Articles

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

Sort by
Same author

Wetting-state-dependent desorption of molten Al droplets from striped SiC surfaces under vertical harmonic vibration.

Physical chemistry chemical physics : PCCP·2026
Same author

A Lithium Superionic Conductor Softened by Nonmetal-Chlorine Chemical Bonds.

Journal of the American Chemical Society·2026
Same author

Safety Profile of COVID-19 Vaccines in HIV Patients Undergoing ART and Their Impact on Immune Recovery and HIV Reservoirs.

Infectious diseases & immunity·2026
Same author

Hyperhomocysteinemia reduces the high-quality embryo rate in PCOS patients undergoing IVF/ICSI: clinical evidence and a preliminary exploration of mechanisms in KGN cells.

Journal of ovarian research·2026
Same author

Comparision between percutaneous transhepatic gallbladder drainage and early laparoscopic cholecystectomy for acute cholecystitis in patients over 80 years Old: a propensity score-matched analysis.

BMC surgery·2026
Same author

Comparative Analysis of Flavor and Starch Physicochemical Properties in Different Varieties of Baked Sweet Potatoes.

Foods (Basel, Switzerland)·2026

Related Experiment Video

Updated: Feb 14, 2026

A Multimodal Wide-Field Fourier-Transform Raman Microscope
06:48

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

481

Polynomial Phase Estimation Based on Adaptive Short-Time Fourier Transform.

Fulong Jing1, Chunjie Zhang2, Weijian Si3

  • 1College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China. jing_fl@hrbeu.edu.cn.

Sensors (Basel, Switzerland)
|February 14, 2018
PubMed
Summary

A new Polynomial Phase Signal (PPS) parameter estimation method, the PPS-ASTFT estimator, avoids complex searches and error propagation. This adaptive short-time Fourier transform (ASTFT) approach offers accurate and efficient signal analysis for radar and communication systems.

Keywords:
adaptive short-time Fourier transforminstantaneous frequency gradient estimationparameters estimationpolynomial phase signalstime–frequency signal analysis

More Related Videos

Author Spotlight: Optimized Lung MRI Protocol with Computationally Efficient Reconstruction Methods
05:07

Author Spotlight: Optimized Lung MRI Protocol with Computationally Efficient Reconstruction Methods

Published on: September 6, 2024

777
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.4K

Related Experiment Videos

Last Updated: Feb 14, 2026

A Multimodal Wide-Field Fourier-Transform Raman Microscope
06:48

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

481
Author Spotlight: Optimized Lung MRI Protocol with Computationally Efficient Reconstruction Methods
05:07

Author Spotlight: Optimized Lung MRI Protocol with Computationally Efficient Reconstruction Methods

Published on: September 6, 2024

777
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.4K

Area of Science:

  • Signal Processing
  • Statistical Signal Estimation

Background:

  • Polynomial Phase Signals (PPSs) are crucial in radar, sonar, geophysics, and radio communications.
  • Accurate estimation of PPS coefficients is vital for these applications.

Purpose of the Study:

  • To propose a novel and efficient Polynomial Phase Signal parameter estimation method.
  • To overcome limitations of existing methods, such as multi-dimensional searches and error propagation.

Main Methods:

  • Introduced the Polynomial Phase Signal-Adaptive Short-Time Fourier Transform (PPS-ASTFT) estimator.
  • Utilized S-transform (ST) for instantaneous frequency (IF) estimation, preserving phase information.
  • Determined adaptive window width using instantaneous frequency gradient (IFG) calculated via robust principal component analysis (PCA).
  • Incorporated a refinement strategy to enhance estimation accuracy.

Main Results:

  • The PPS-ASTFT estimator successfully avoids one-dimensional and multi-dimensional searches and error propagation.
  • The method demonstrates robustness to noise due to PCA-based IFG calculation.
  • Numerical simulations confirm excellent statistical performance and efficiency compared to traditional methods.

Conclusions:

  • The proposed PPS-ASTFT estimator provides an accurate, efficient, and robust solution for Polynomial Phase Signal parameter estimation.
  • This method offers significant advantages for applications requiring precise signal analysis in challenging environments.