Related Experiment Video
Updated: Nov 1, 2025

09:04
Recording Ultra-Realistic Full-Color Analog Holograms for Use in a Moving Hologram Display
Published on: January 14, 2020
10.0K
Out-of-core GPU 2D-shift-FFT algorithm for ultra-high-resolution hologram generation.
Optics Express
|June 22, 2021
Summary
This study introduces an efficient out-of-core GPU algorithm for 2D-Shift-FFT, enabling ultra-high-resolution hologram generation. The novel method significantly accelerates holographic computations, overcoming memory limitations for large-scale matrices.
Area of Science:
- Computational Imaging
- Computer Graphics
- High-Performance Computing
Background:
- Generating ultra-high-resolution holograms necessitates processing large complex matrices that often exceed standard GPU memory capacities.
- Existing methods struggle with memory constraints when dealing with massive datasets required for advanced holographic applications.
Purpose of the Study:
- To develop a novel out-of-core GPU algorithm for 2D-Shift-FFT (Fast Fourier Transform) to efficiently generate ultra-high-resolution holograms.
- To address the challenge of limited GPU memory when processing large complex matrices (e.g., 100K^2) for holographic applications.
Main Methods:
- Employs a 1D-FFT based 2D-FFT computation method for out-of-core processing.
- Optimizes performance through data transposition for continuous memory layout, combined FFT-shift and transposition, concurrent execution on heterogeneous systems, cache-friendly chunk generation, and pinned-memory buffers.
Main Results:
- Achieved up to 3.24x (single-precision) and 3.06x (double-precision) performance improvement over conventional cuFFT implementations for large-scale complex matrices.
- Reduced hologram generation time by up to 28% in layer-based computer-generated holography (CGH) for 100K^2 holograms.
Conclusions:
- The proposed out-of-core GPU algorithm offers significant efficiency and usefulness for generating ultra-high-resolution holograms.
- Demonstrates a practical solution for memory-bound computational challenges in advanced holographic display technologies.
Related Concept Videos
Fast Fourier Transform
582
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
582
Aliasing
311
Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original...
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original...
311
Discrete Fourier Transform
524
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...
524
Upsampling
376
Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
376
Convolution: Math, Graphics, and Discrete Signals
541
In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
541
Continuous -time Fourier Transform
551
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...
551

