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

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

Properties of Fourier Transform I

671
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...
671
Properties of Fourier Transform II01:24

Properties of Fourier Transform II

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

Discrete Fourier Transform

913
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...
913
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

759
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
759
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

8.2K
The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
8.2K

You might also read

Related Articles

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

Sort by
Same author

Autofocusing optical-resolution photoacoustic microscopy.

Ultrasonics·2026
Same author

Twisted-Nematic Liquid Crystal-Infiltrated Bilayer Metasurface for Circular-Polarization LCoS Devices.

ACS applied optical materials·2026
Same author

High-efficiency phase modulation in LCoS-compatible LC-metasurface via spacer integration and Oseen-Frank modeling.

Optics express·2025
Same author

Vortex annihilation to reduce phase singularities and resultant speckles in computer-generated holography.

Optics letters·2025
Same author

Electrically tunable Fano resonances in liquid crystal-based dynamic metasurface at telecommunication wavelengths.

Optics express·2025
Same author

Fast-speed electrically tunable liquid crystal metasurface for 2π phase modulation at normal and oblique angles of incidence.

Optics express·2025
Same journal

Long-term stabilization of intensity-difference squeezing from four-wave mixing in rubidium vapor.

Optics express·2026
Same journal

Robust 3D topography measurement of large-range high-aspect-ratio structures based on dual-domain statistical filtering in SD-OCT.

Optics express·2026
Same journal

Broadband transmissive terahertz metasurface for simultaneous quad-mode OAM multiplexing.

Optics express·2026
Same journal

Leveraging two-dimensional materials for high-sensitivity optical sensors: quasi-bound states in the continuum within hybrid metasurfaces.

Optics express·2026
Same journal

Resolution investigation for dual-spherical-wave optical scanning holographic microscopy: methods and performance.

Optics express·2026
Same journal

Robustness of parallel subnetwork-filtered diffractive deep neural networks.

Optics express·2026
See all related articles

Related Experiment Video

Updated: Feb 6, 2026

Author Spotlight: Advancements in Molecular Biomarker Testing for Non-Squamous Non-Small Cell Lung Cancer
07:59

Author Spotlight: Advancements in Molecular Biomarker Testing for Non-Squamous Non-Small Cell Lung Cancer

Published on: September 8, 2023

1.7K

Fast two-step layer-based method for computer generated hologram using sub-sparse 2D fast Fourier transform.

Jia Jia, Jhen Si, Daping Chu

    Optics Express
    |August 19, 2018
    PubMed
    Summary
    This summary is machine-generated.

    New algorithms accelerate hologram calculations. The layer-based and sub-sparse two-dimensional Fast Fourier Transform (SS-2DFFT) methods significantly reduce computation time for 3D objects.

    More Related Videos

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

    A Multimodal Wide-Field Fourier-Transform Raman Microscope

    Published on: December 30, 2025

    402
    Fast and Simplified Method for High Through-put Isolation of miRNA from Highly Purified High Density Lipoprotein
    09:48

    Fast and Simplified Method for High Through-put Isolation of miRNA from Highly Purified High Density Lipoprotein

    Published on: July 27, 2016

    12.4K

    Related Experiment Videos

    Last Updated: Feb 6, 2026

    Author Spotlight: Advancements in Molecular Biomarker Testing for Non-Squamous Non-Small Cell Lung Cancer
    07:59

    Author Spotlight: Advancements in Molecular Biomarker Testing for Non-Squamous Non-Small Cell Lung Cancer

    Published on: September 8, 2023

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

    A Multimodal Wide-Field Fourier-Transform Raman Microscope

    Published on: December 30, 2025

    402
    Fast and Simplified Method for High Through-put Isolation of miRNA from Highly Purified High Density Lipoprotein
    09:48

    Fast and Simplified Method for High Through-put Isolation of miRNA from Highly Purified High Density Lipoprotein

    Published on: July 27, 2016

    12.4K

    Area of Science:

    • Optics and Photonics
    • Computer Science
    • Digital Holography

    Background:

    • Calculating computer-generated holograms (CGH) is computationally intensive.
    • Existing layer-based methods can be inefficient due to zero-value pixels in depth layers.
    • The occlusion effect in layered 3D scenes leads to sparse data.

    Purpose of the Study:

    • To develop computationally efficient algorithms for CGH calculation.
    • To accelerate the generation of holographic displays using optimized Fourier transform methods.
    • To reduce the processing time for complex 3D holographic reconstructions.

    Main Methods:

    • Proposed a two-step layer-based algorithm that computes only non-zero pixel areas.
    • Introduced a sub-sparse two-dimensional Fast Fourier Transform (SS-2DFFT) to skip zero-value rows/columns.
    • Combined layer-based and SS-2DFFT methods for enhanced computational speed.

    Main Results:

    • Achieved significant speedups in computational time compared to conventional methods.
    • Reduced computation time by 5x for a train model, 3.4x for a castle model, and 10x for a statue head model.
    • Validated the effectiveness of the proposed algorithms through numerical simulations and optical experiments.

    Conclusions:

    • The combined layer-based and SS-2DFFT algorithms offer substantial computational efficiency for CGH.
    • These methods enable faster and more practical generation of 3D holographic content.
    • The optimized Fourier transform approach is crucial for advancing holographic display technologies.