
89
Xn
Figure 7: Decomposition of a polygon into half-spaces and representation of the parallel
projection algorithm.
can be easily shown that the time domain operation indicated in Figure 3 is the projection
of C on the convex set C =Q-I[C] and leads to a necessary improvement since C includes
S N C. This process can be in general reiterated as long as the current estimate X does not
belong to .A (see Figure 8).
Consistent Signal Reconstruction and Convex Coding
Figure 8: Geometric representation of the alternating projection algorithm.
It was in fact proved in [8] that by applying