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

Geometric Sequences01:30

Geometric Sequences

245
In systems where values diminish by a constant proportion at each stage, the resulting sequence follows a geometric structure. Each new value in the sequence is obtained by applying a fixed multiplier to the preceding term. This regular, proportional decline type is often used to represent processes involving gradual loss, such as energy dissipation or reduction in amplitude over time.When analyzing the total effect of such a process across unlimited iterations, the series of values is referred...
245
Radical Chain-Growth Polymerization: Overview01:10

Radical Chain-Growth Polymerization: Overview

3.1K
Chain-growth or addition polymerization is successive addition reactions of monomers with a polymer chain. In radical chain-growth polymerization, the reaction proceeds via a free-radical intermediate. The free radical is formed from radical initiators, which spontaneously generate free radicals by homolytic fission. Organic peroxides (such as dibenzoyl peroxide, as shown in Figure 1) or azo compounds are popular radical initiators. A low concentration ratio of radical initiator to monomer is...
3.1K
Fast Fourier Transform01:10

Fast Fourier Transform

854
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...
854
Ziegler–Natta Chain-Growth Polymerization: Overview01:17

Ziegler–Natta Chain-Growth Polymerization: Overview

3.9K
Ziegler–Natta polymerization is another form of addition or chain‐growth polymerization used for synthesizing linear polymers over branched polymers. The catalyst used for polymerization is the Ziegler–Natta catalyst, named after Karl Ziegler and Giulio Natta, who developed it in 1953. This catalyst is an organometallic complex of titanium tetrachloride and triethyl aluminum, with the active form of the catalyst being an alkyl titanium compound. Using the Ziegler–Natta...
3.9K
Carrier Generation and Recombination01:22

Carrier Generation and Recombination

1.2K
Carrier generation is the process by which electron-hole pairs (EHPs) are created within the semiconductor. In direct-bandgap semiconductors, such as gallium arsenide (GaAs), this occurs efficiently when energy absorption prompts valence electrons to leap into the conduction band, leaving behind holes.
This process is given by the generation rate G and is efficient due to the conservation of momentum between the valence band maximum and conduction band minimum.
Indirect generation involves an...
1.2K
Radical Chain-Growth Polymerization: Chain Branching01:17

Radical Chain-Growth Polymerization: Chain Branching

2.4K
The skeletal structure of polymers synthesized via radical polymerization is always branched. For example, the polymerization of ethylene by radical polymerization results in a low-density grade of polyethylene with a heavily branched skeletal structure. Here, the radical site abstracts hydrogen from the growing chain, and the radical site shifts from the end (a primary carbon center) to anywhere within the growing chain (a secondary carbon center). Consequently, the part of the chain from the...
2.4K

You might also read

Related Articles

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

Sort by
Same author

Hologram computation based on sparse matrix multiplication.

Optics express·2026
Same author

Modified split-Lohmann holography: a shift- and ringing-free approach.

Optics letters·2026
Same author

Sub-sampled single-step Fresnel diffraction for efficient computation of high-resolution holograms.

Optics letters·2026
Same author

Optical initialization and manipulation of higher-order electron states with spin and orbital angular momentum in a semiconductor quantum disk.

Optics express·2025
Same author

Asymmetric point-spread function in the tilted plane.

Optics express·2025
Same author

Quantized neural network for complex hologram generation.

Applied optics·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: Jan 10, 2026

Recording Ultra-Realistic Full-Color Analog Holograms for Use in a Moving Hologram Display
09:04

Recording Ultra-Realistic Full-Color Analog Holograms for Use in a Moving Hologram Display

Published on: January 14, 2020

10.2K

Fast calculation of computer-generated hologram using run-length encoding based recurrence relation.

Takashi Nishitsuji, Tomoyoshi Shimobaba, Takashi Kakue

    Optics Express
    |May 14, 2015
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a faster method for creating Computer-Generated Holograms (CGHs) by avoiding random memory access. The new algorithm, using run-length encoding, significantly improves calculation time for generating zoneplates.

    More Related Videos

    Quantifying Microorganisms at Low Concentrations Using Digital Holographic Microscopy DHM
    07:27

    Quantifying Microorganisms at Low Concentrations Using Digital Holographic Microscopy DHM

    Published on: November 1, 2017

    10.8K
    Digital Inline Holographic Microscopy DIHM of Weakly-scattering Subjects
    10:16

    Digital Inline Holographic Microscopy DIHM of Weakly-scattering Subjects

    Published on: February 8, 2014

    12.6K

    Related Experiment Videos

    Last Updated: Jan 10, 2026

    Recording Ultra-Realistic Full-Color Analog Holograms for Use in a Moving Hologram Display
    09:04

    Recording Ultra-Realistic Full-Color Analog Holograms for Use in a Moving Hologram Display

    Published on: January 14, 2020

    10.2K
    Quantifying Microorganisms at Low Concentrations Using Digital Holographic Microscopy DHM
    07:27

    Quantifying Microorganisms at Low Concentrations Using Digital Holographic Microscopy DHM

    Published on: November 1, 2017

    10.8K
    Digital Inline Holographic Microscopy DIHM of Weakly-scattering Subjects
    10:16

    Digital Inline Holographic Microscopy DIHM of Weakly-scattering Subjects

    Published on: February 8, 2014

    12.6K

    Area of Science:

    • Optics and Photonics
    • Computer Graphics
    • Computational Science

    Background:

    • Computer-Generated Holograms (CGHs) are often created by superimposing zoneplates, which are gratings that focus light.
    • Previous methods for generating zoneplates using computer graphics involved concentric circles but suffered from inefficient random memory access.

    Purpose of the Study:

    • To develop a computationally efficient algorithm for generating CGHs.
    • To overcome the limitations of random memory access in prior zoneplate generation techniques.

    Main Methods:

    • A novel algorithm for CGH generation was developed, utilizing a run-length encoding (RLE) based recurrence relation.
    • This approach eliminates the need for random memory access during zoneplate creation.

    Main Results:

    • The proposed RLE-based algorithm demonstrated a significant improvement in calculation time.
    • An 88% reduction in computation time was achieved compared to the previous algorithm.

    Conclusions:

    • The new algorithm provides a faster and more efficient method for generating CGHs.
    • Eliminating random memory access is key to enhancing the computational performance of zoneplate generation.