Information Technology Reference
In-Depth Information
V(i,j+1)
V(i,j) V(i
−
1,j)
U(i
−
1,j)
U(i
−
2,j)
V(i+1,j)
V(i,j)
V(i
−
1,j)
Further Mismatch
V(i,j)
V(i
−
1,j)
V(i,j
−
1)
V(i
−
1,j
−
1)
V(i
−
1,j
−
1)
V(i
−
2,j
−
1)
Mismatch!
U(i
−
2,j
−
1)
V(i,j
−
1)
V(i
−
1,j
−
1)
V(i
−
1,j
−
1)
Figure
13.17.
Reif's compact error-correction scheme: the error propagation
process.
Reif et al. [21] provides a more compact method for decreasing assembly
errors. This compact method takes each original tile (as illustrated in Fig. 13.15)
and modifies the pads of each tile, to form a modified error-resultant tile (as
illustrated in Fig. 13.16).
The result is that essentially each tile executes both the original compu-
tation required at that location as well as the computation of a particular
neighbor. An illustration of the error propagation process is illustrated in
Figure 13.17.
This provides a quadratic reduction of errors without increasing the assembly
size. The experimental testing of these and related error-reduction methods is
ongoing. It seems possible that other error-correction techniques developed in
computer science may also be utilized.
Search WWH ::
Custom Search