1984
DOI: 10.1364/josaa.1.000005
|View full text |Cite
|
Sign up to set email alerts
|

Computer-generated holograms with pulse-density modulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

1984
1984
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 98 publications
(22 citation statements)
references
References 7 publications
0
21
0
Order By: Relevance
“…(33), then write the resulting s b 1 ½m; n on the SLM, and illuminate the SLM with Iðx; yÞ of Eq. (31). Figure 11 shows the updated SLM pattern obtained from the SLM pattern in Fig.…”
Section: Encoding Complex-valued Oversampled Holograms On Binary Slmsmentioning
confidence: 99%
See 1 more Smart Citation
“…(33), then write the resulting s b 1 ½m; n on the SLM, and illuminate the SLM with Iðx; yÞ of Eq. (31). Figure 11 shows the updated SLM pattern obtained from the SLM pattern in Fig.…”
Section: Encoding Complex-valued Oversampled Holograms On Binary Slmsmentioning
confidence: 99%
“…The reason is that, in the far-field or the 2f setup case, the relation between the SLM pixels and output field samples are simply given by a discrete Fourier transform (FT), which is easy to understand and manipulate. Many iterative and noniterative algorithms have been designed or adapted and applied to this problem [31][32][33][34][35][36][37][38]. Exploiting the intrinsic connection to the classical halftoning problem of image processing, researchers also adapted and applied halftoning algorithms such as error diffusion [39][40][41][42][43] and direct binary search [44][45][46][47][48].…”
Section: Introductionmentioning
confidence: 99%
“…(5) to be converted to a binary format; this can be achieved in a number of ways. 6,7 For the example described in this Letter, a simple thresholding method was used in which the real part of Eq. (5) was sampled on a pixel grid and those pixels with a positive value were set to 1 (transparent) whereas all others were set to 0 (opaque).…”
Section: ͑3͒mentioning
confidence: 99%
“…Error diffusion [15][16][17][18][19][20] (ED) is yet another way to encode complex-valued functions in much less computation time than is required with global search methods. As with single-pixel methods, each desired complex value is encoded as a modulation value of a corresponding SLM pixel.…”
Section: Pseudorandom Encodingmentioning
confidence: 99%
“…Encoding algorithms for many other modulation characteristics are possible. A few of these include encoding for amplitude-phase coupled, 3,5,12 binary quantized, 16 and m-ary quantized characteristics. 6,8,12,17,21 Although specifying and evaluating such a variety of algorithms is beyond the scope of this paper, this section would also help in the development of blended algorithms for modulation characteristics other than phase-only.…”
Section: Description Of the Encoding Algorithmsmentioning
confidence: 99%