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

Supercritical Fluid Chromatography

Supercritical Fluid Chromatography

Supercritical fluid chromatography (SFC) provides a beneficial substitute for gas chromatography (GC) and liquid chromatography (LC) for certain samples because it merges the top attributes of both techniques. SFC allows the separation and analysis of compounds that GC or LC does not easily manage. These compounds are traditionally nonvolatile or thermally unstable, making GC unsuitable and lacking functional groups required for HPLC analysis.
SFC utilizes a supercritical fluid mobile phase,...

Parallel Processing

Parallel Processing

The brain processes sensory information rapidly due to parallel processing, which involves sending data across multiple neural pathways at the same time. This method allows the brain to manage various sensory qualities, such as shapes, colors, movements, and locations, all concurrently. For instance, when observing a forest landscape, the brain simultaneously processes the movement of leaves, the shapes of trees, the depth between them, and the various shades of green. This enables a quick and...

Fast Decoupled and DC Powerflow

Fast Decoupled and DC Powerflow

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:

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

Gaussian Elimination: Problem Solving

Gaussian Elimination: Problem Solving

Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...

You might also read

Related Articles

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

Sort by

Same author

A causal AI and explainable optimization framework for social robot design.

iScience·2026

Same author

A Transformer-LSTM-SVR hybrid model for AI-driven emotional optimization in NEV embedded interior systems.

Scientific reports·2025

Same author

Effects of different soluble dietary fibers on oil encapsulation: Comparison of emulsion and microcapsule properties.

Food chemistry·2025

Same author

Nanoantenna induced liquid crystal alignment for high performance tunable metasurface.

Nanophotonics (Berlin, Germany)·2024

Same author

Design of a sweeping robot based on fuzzy QFD and ARIZ algorithms.

Heliyon·2024

Same author

Phosphatidylserine: A comprehensive overview of synthesis, metabolism, and nutrition.

Chemistry and physics of lipids·2024

Search research articles

Related Experiment Video

Updated: Jun 14, 2026

Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy (ATOM)

Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy (ATOM)

Published on: June 28, 2017

Fast CGH computation using S-LUT on GPU.

Yuechao Pan¹, Xuewu Xu, Sanjeev Solanki

¹Data Storage Institute, Agency for Science, Technology and Research, DSI Building,5 Engineering Drive 1, Off Kent Ridge Crescent, NUS, Singapore. Pan_Yuechao@dsi.a-star.edu.sg

|April 8, 2010

Summary

This summary is machine-generated.

A new split look-up table (S-LUT) algorithm on graphics processing units (GPUs) significantly speeds up full-parallax computer-generated hologram (CGH) computation. This method balances speed and memory, enabling high-quality holographic 3D displays.

Related Experiment Videos

Last Updated: Jun 14, 2026

Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy (ATOM)

Microfluidic Imaging Flow Cytometry by Asymmetric-detection Time-stretch Optical Microscopy (ATOM)

Published on: June 28, 2017

Area of Science:

Optics and Photonics
Computer Graphics
Holography

Background:

Efficient computation of full-parallax computer-generated holograms (CGHs) is crucial for holographic 3D display technology.
Existing algorithms like coherent ray trace (CRT) and look-up table (LUT) face challenges with speed and memory usage, respectively.
There is a need for algorithms that optimize both speed and memory without compromising reconstructed object quality.

Purpose of the Study:

To develop a novel algorithm for full-parallax CGH computation that addresses the limitations of existing methods.
To improve the balance between computational speed and memory efficiency in CGH generation.
To demonstrate the effectiveness of the proposed algorithm on graphics processing units (GPUs).

Main Methods:

Development of a novel split look-up table (S-LUT) algorithm.
Implementation of the S-LUT algorithm on a graphics processing unit (GPU).
Comparative analysis of the S-LUT algorithm against traditional coherent ray trace (CRT) and look-up table (LUT) algorithms.

Main Results:

The S-LUT algorithm implemented on GPU achieved the fastest computation speed among all investigated algorithms.
The S-LUT on GPU maintained low memory usage, overcoming a key limitation of the LUT algorithm.
High-quality reconstructed objects were successfully demonstrated using CGHs computed with the S-LUT on GPU.

Conclusions:

The developed S-LUT algorithm on GPU offers a superior balance of speed and memory efficiency for full-parallax CGH computation.
This advancement has the potential to overcome current bottlenecks in holographic display technology.
The GPU implementation of S-LUT paves the way for real-time and interactive holographic 3D display applications.