Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5005138 | ISA Transactions | 2010 | 10 Pages |
Abstract
Scalable generic reconciliation algorithms, suitable for hardware implementation, are analyzed. The algorithms are fast and guard against multiple random failures, but distort process values in the absence of failures. Distortion is the consequence of replication followed by reconciliation. The extent of distortion is a function of the number of replications and other parameters required for unambiguous reconciliation.
Related Topics
Physical Sciences and Engineering
Engineering
Control and Systems Engineering
Authors
Gus Tibazarwa,