Gerchberg–Saxton algorithm: Difference between revisions

Revision as of 10:42, 18 December 2019

Revision as of 12:23, 20 December 2019

Line 15:

IFT – inverse Fourier transform

''i'' – the imaginary unit, √−1 (square root of −1)

exp – exponential function (exp(x) = ''e''^''x'')

Target and Source be the Target and Source Amplitude planes respectively

A, B, C & D be complex planes with the same dimension as Target and Source

Line 26:

'''algorithm''' Gerchberg–Saxton(Source, Target, Retrieved_Phase) '''is'''

A := IFT(Target)

'''while''' error criterion is not satisfied

B := Amplitude(Source) × exp(i × Phase(A))

C := FT(B)

D := Amplitude(Target) × exp(i × Phase(C))

A := IFT(D)

'''end while'''

Retrieved_Phase = Phase(A)

This is just one of the many ways to implement the GS algorithm. Aside from optimizations, others may start by performing a forward Fourier Transformtransform to the source distribution.

==See also==