Table 11 The iterative algorithm based on the block diagram of Figure 7

1. Take the transform (e.g. the Fourier transform) of the input to the i^thiteration (x⁽ⁱ⁾) and denote it as X⁽ⁱ⁾; x⁽⁰⁾ is normally the initial received signal.

2. Multiply X⁽ⁱ⁾ by a mask (for instance a band-limiting filter).

3. Take the inverse transform of the result in step 2 to get r⁽ⁱ⁾.

4. Set the new result as: x^{(i + 1)}=x⁽⁰⁾ + x⁽ⁱ⁾−r⁽ⁱ⁾.

5. Repeat for a given number of iterations.

6. Stop when $\parallel {\mathbf{x}}^{(i+1)}-{\mathbf{x}}^{\left(i\right)}{\parallel }_{{\ell }_2}<\epsilon$.