Gerchberg–Saxton algorithm: Difference between revisions

Revision as of 16:55, 3 June 2007

Revision as of 20:11, 28 June 2007

Line 1:

'''Gerchberg Saxton Algorithm'''

[[Image:GS-diagram.png|thumb|The Gerchberg-Saxton Algortithm]]

[[Image:Smilie-photograph.jpg|thumb|A projection from a Gerchberg-Saxton hologram]]

The '''Gerchberg -Saxton (GS) algorithm''' is an iterative [[algorithm]] for retrieving the phase of a pair of light distributions (or any other mathematically valid distribution) related via a propagating function, such as the [[Fourier transform]], if their intensities at their respective optical planes are known.

It is often necessary to know only the phase distribution from one of the planes, since the phase distribution on the other plane can be obtained by performing a Fourier transform on the plane whose phase is known. Although often used for two-dimensional signals, the GS algorithm is also valid for one-dimensional signals.

Line 44 ⟶ 42:

* [[Fourier optics]]

* [[Holography]]

* [[Adaptive Additive Algorithm|Adaptive-Additiveadditive Algorithmalgorithm]]

==External links==