Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Trigonometric Fourier series

Trigonometric Fourier series

Fourier series is a foundational mathematical technique that decomposes periodic functions into an infinite series of sinusoidal harmonics. This method enables the representation of complex periodic signals as sums of simple sine and cosine functions, facilitating their analysis and interpretation in various fields, including signal processing, acoustics, and electrical engineering.
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...

Fast Fourier Transform

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

Convergence of Fourier Series

Convergence of Fourier Series

The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...

Continuous -time Fourier Transform

Continuous -time Fourier Transform

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

Discrete-Time Fourier Series

Discrete-Time Fourier Series

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

Parseval's Theorem for Fourier transform

Parseval's Theorem for Fourier transform

Parseval's theorem is a fundamental principle in signal processing that enables the calculation of a signal's energy in either the time domain or the frequency domain. This theorem is pivotal in demonstrating energy conservation between these two domains, ensuring that the computed energy value remains consistent regardless of the domain of analysis.
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a...

You might also read

Related Articles

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

Sort by

Same author

Preparation methodology evaluation of rat pulmonary tissues containing mineral fibers following inhalation exposure to Libby amphibole asbestos.

Journal of occupational medicine and toxicology (London, England)·2025

Same author

Acoustic Sensing Fiber Coupled with Highly Magnetostrictive Ribbon for Small-Scale Magnetic-Field Detection.

Sensors (Basel, Switzerland)·2025

Same author

Fiber-based Miniature Strain Sensor with Fast Response and Low Hysteresis.

Advanced functional materials·2024

Same author

Sub-surface thermal measurement in additive manufacturing via machine learning-enabled high-resolution fiber optic sensing.

Nature communications·2024

Same author

Laser Machined Fiber-based Microprobe: Application in Microscale Electroporation.

Advanced fiber materials·2023

Same author

Optical Fiber Sensors: introduction to the feature issue.

Applied optics·2023

Search research articles

Related Experiment Videos

Fast-Fourier-transform based numerical integration method for the Rayleigh-Sommerfeld diffraction formula.

Fabin Shen¹, Anbo Wang

¹Center for Photonics Technology, Bradley Department of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061, USA. fashen1@vt.edu

|March 10, 2006

Summary

This summary is machine-generated.

This study presents a fast Fourier transform-based direct integration (FFT-DI) method for accurately calculating Rayleigh-Sommerfeld diffraction integrals, offering improved numerical precision and efficiency for optical simulations.

Related Experiment Videos

Area of Science:

Optics and Photonics
Computational Physics
Numerical Methods

Background:

Accurate computation of diffraction integrals is crucial in optical system design and analysis.
Existing methods, such as the angular spectrum method, have limitations in certain scenarios.
The Rayleigh-Sommerfeld diffraction integral provides a rigorous framework for wave propagation.

Purpose of the Study:

To investigate and implement a novel numerical method for calculating the Rayleigh-Sommerfeld diffraction integral.
To enhance the accuracy of numerical diffraction calculations using Simpson's rule.
To analyze the computational complexity and accuracy trade-offs of different methods.

Main Methods:

Implementation of a fast Fourier transform-based direct integration (FFT-DI) method.
Application of Simpson's rule to improve the accuracy of numerical integration.
Comparative analysis of FFT-DI and fast Fourier transform-based angular spectrum (FFT-AS) methods.
Numerical simulations to verify the performance of the FFT-DI method.

Main Results:

The FFT-DI method, enhanced with Simpson's rule, demonstrates improved accuracy in calculating diffraction integrals.
Analysis reveals the influence of sampling interval and computation window size on accuracy and complexity for both FFT-DI and FFT-AS.
Numerical simulations confirm the effectiveness and performance of the FFT-DI method.

Conclusions:

The presented FFT-DI method offers a viable and accurate alternative for numerical diffraction calculations.
Optimizing sampling intervals and computation window sizes is essential for balancing accuracy and efficiency.
The FFT-DI method shows competitive performance compared to the FFT-AS method.