(N, K) Concept Fault Tolerance
IEEE Transactions on Computers - The MIT Press scientific computation series
IEEE Transactions on Computers
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Introduction to Coding Theory
IEEE Transactions on Computers
An Algorithm for the Accurate Reliability Evaluation of Triple Modular Redundancy Networks
IEEE Transactions on Computers
Efficient calculation of spectral coefficients and their applications
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.00 |
Decision diagrams are an efficient way of representing switching functions and they are easily mapped to technology. A layout of a circuit is directly determined by the shape and the complexity of the decision diagram. By combining the theory of error-correcting codes with decision diagrams, it is possible to form robust circuit layouts, which can detect and correct errors. The method of constructing robust decision diagrams is analogous to the decoding process of linear codes, and is based on simple matrix and look-up operations. In this paper, the performance of robust binary decision diagrams is analyzed by determining the error probabilities for such constructions. Depending on the error-correcting properties of the code used in the construction, the error probability of a circuit can be significantly decreased by a robust decision diagram.