Iterative Fourier transform algorithm with regularization for the optimal design of diffractive optical elements

Related Experiment Video

Updated: Aug 20, 2026

The Generation of Higher-order Laguerre-Gauss Optical Beams for High-precision Interferometry
12:14

The Generation of Higher-order Laguerre-Gauss Optical Beams for High-precision Interferometry

Published on: August 12, 2013

Hwi Kim1, Byungchoon Yang, Byoungho Lee

  • 1National Research Laboratory of Holography Technologies, School of Electrical Engineering, Seoul National University, Kwanak-Gu Shinlim-Dong, Seoul 151-744, Korea.

Journal of the Optical Society of America. A, Optics, Image Science, and Vision
|December 18, 2004
PubMed

More Related Videos

Fabrication of a Low-Cost, Fiber-Coupled, and Air-Spaced Fabry-Pérot Etalon07:22

Fabrication of a Low-Cost, Fiber-Coupled, and Air-Spaced Fabry-Pérot Etalon

Published on: February 3, 2023

Optically Trapping Large Metallic Particles in Air Using a 'Boat' Trap with Direct-Drawn Sidewalls10:36

Optically Trapping Large Metallic Particles in Air Using a 'Boat' Trap with Direct-Drawn Sidewalls

Published on: March 27, 2026

Related Concept Videos

Discrete-time Fourier transform01:26

Discrete-time Fourier transform

The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
Fast Fourier Transform01:10

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

Discrete Fourier Transform

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...
Convergence of Fourier Series01:21

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...
Trigonometric Fourier series01:17

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...
Discrete-Time Fourier Series01:20

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