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

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...
Basic signals of Fourier Transform01:07

Basic signals of Fourier Transform

The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...
Properties of Fourier Transform II01:24

Properties of Fourier Transform II

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...
Discrete Fourier Transform01:15

Discrete Fourier Transform

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

Properties of Fourier Transform I

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...
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

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.

You might also read

Related Articles

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

Sort by
Same author

Piezo1 in immune cells: from mechanosensation to immunoregulation.

Frontiers in immunology·2026
Same author

Value of Testicular Shear Wave Dispersion Imaging in Predicting Semen Improvement After Varicocelectomy.

Ultrasound in medicine & biology·2026
Same author

Pulmonary ground-glass opacity associated with cystic airspace: clinicopathological features and aggressiveness.

Translational lung cancer research·2026
Same author

Study on tensile mechanical response and microstructure of polypropylene fiber reinforced loess under freezing.

PloS one·2026
Same author

Risk factors for diuretic resistance in hospitalized patients with acute decompensated heart failure: a retrospective study.

BMC cardiovascular disorders·2026
Same author

Intramolecular Design of Poly(ethylene oxide) for Solid-State Electrolytes and Next-Generation High-Energy Batteries.

Nano-micro letters·2026

Related Experiment Videos

Fourier multi-component and multi-layer neural networks: Unlocking high-frequency potential.

Shijun Zhang1, Hongkai Zhao2, Yimin Zhong3

  • 1Department of Applied Mathematics, Hong Kong Polytechnic University, Hong Kong.

Neural Networks : the Official Journal of the International Neural Network Society
|June 25, 2026
PubMed
Summary

This study introduces the Fourier Multi-Component and Multi-Layer Neural Network (FMMNN), a novel neural network architecture. FMMNNs demonstrate superior performance in approximating oscillatory functions with improved optimization and training efficiency.

Keywords:
Fourier analysisHigh-frequency approximationLow-rank structuresRandom-basis approximationScaled initialization

Related Experiment Videos

Area of Science:

  • Machine Learning
  • Artificial Intelligence
  • Neural Network Architectures

Background:

  • Neural network performance hinges on architecture and activation function choice.
  • Matching these elements is crucial for effective representation and learning.
  • Standard networks face challenges with high-frequency function approximation.

Purpose of the Study:

  • Introduce the Fourier Multi-Component and Multi-Layer Neural Network (FMMNN).
  • Analyze FMMNNs' expressive power, optimization landscape, and training dynamics.
  • Demonstrate FMMNNs' effectiveness on oscillatory function approximation tasks.

Main Methods:

  • FMMNN combines sine-type activations with multi-component, multi-layer structures.
  • Components are trainable linear combinations of fixed random sine basis functions.
  • Multi-layer composition enables adaptive high-frequency feature generation.

Main Results:

  • FMMNNs exhibit exponential expressive power for function approximation, even with low-rank structures.
  • Optimization landscape is more favorable than standard fully connected networks, especially for high-frequency targets.
  • A scaled random initialization method accelerates training and enhances performance.

Conclusions:

  • FMMNNs offer significant advantages in approximating oscillatory functions.
  • The proposed architecture and initialization method lead to strong accuracy and favorable convergence.
  • FMMNNs represent a promising advancement in neural network design for specific tasks.