2004
DOI: 10.1117/1.1804543
|View full text |Cite
|
Sign up to set email alerts
|

Review of iterative Fourier-transform algorithms for beam shaping applications

Abstract: Abstract. We present a comparison of some of the most used iterative Fourier transform algorithms (IFTA) for the design of continuous and multilevel diffractive optical elements (DOE). Our aim is to provide optical engineers with advice for choosing the most suited algorithm with respect to the task. We tackle mainly the beam-shaping and the beamsplitting problems, where the desired light distributions are almost binary. We compare four recent algorithms, together with the historical errorreduction and input-o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 129 publications
(16 citation statements)
references
References 25 publications
0
16
0
Order By: Relevance
“…The combination of frequencies in this implementation takes the form of a linear superposition of available frequencies where various combinations can be used to approximate the same field. To converge on the best superposition geared toward reduction of crosstalk and optimized output uniformity, we im- plemented the output-output algorithm kernel variation of the standard Gerchberg-Saxton iterative Fourier transform algorithm (IFTA) [13], [14]. This algorithm iterates through discrete Fourier transform calculations while adjusting the previous solution in an attempt to decrease the crosstalk error function.…”
Section: Hologram Designmentioning
confidence: 99%
“…The combination of frequencies in this implementation takes the form of a linear superposition of available frequencies where various combinations can be used to approximate the same field. To converge on the best superposition geared toward reduction of crosstalk and optimized output uniformity, we im- plemented the output-output algorithm kernel variation of the standard Gerchberg-Saxton iterative Fourier transform algorithm (IFTA) [13], [14]. This algorithm iterates through discrete Fourier transform calculations while adjusting the previous solution in an attempt to decrease the crosstalk error function.…”
Section: Hologram Designmentioning
confidence: 99%
“…[9][10][11][12][13][14][15][16] For example, an analytical solution has been obtained by Dickey et al to convert a Gaussian beam into a circular or rectangular flattop beam. [9,10] A variety of approaches, mostly based on the Gerchberg-Saxton algorithm and its derivatives, [11][12][13][17][18][19] have been developed to calculate the desired phase profiles numerically. The straightforward way to realize the phase profiles is through optical path differences.…”
Section: Doi: 101002/adom201800961mentioning
confidence: 99%
“…One of the most potential application of CGHs is the ability of shaping a diffraction pattern at a certain plane in the space. The decade of the 90's was specially productive due to the development of Personal Computers and Liquid Crystal Displays (LCDs) [2]. In the recent years, this application has become an increasing interest motivated, specially, by the display industry and 3D imaging systems, leading to an increment of the number of published works about this topic [3][4][5][6][7][8][9][10].…”
Section: Introductionmentioning
confidence: 99%