Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abraham, J., Siewiorek, D.: An algorithm for the accurate reliability evaluation of triple modular redundancy networks. IEEE Transactions on Computers 23, 682–692 (1974)
Akers, S.B.: Binary decision diagrams. IEEE Trans. Computers C-27(6), 509–516 (1978)
Astola, H., Stanković, S., Astola, J.T.: Error correcting decision diagrams. In: Proceedings of The Third Workshop on Information Theoretic Methods in Science and Engineering, Tampere, Finland, August 16-18 (2010)
Astola, J.T., Stanković, R.S.: Fundamentals of Switching Theory and Logic Design. Springer, Heidelberg (2006)
Bryant, R.E.: Graph-based algorithms for Boolean functions manipulation. IEEE Trans. Computers C-35(8), 667–691 (1986)
Clarke, E.M., Fujita, M., Zhao, X.: Multi-terminal decision diagrams and hybrid decision diagrams. In: Sasao, T., Fujita, M. (eds.) Representation of Discrete Functions, pp. 91–108. Kluwer, Dordrecht (1997)
van Gils, W.: A triple modular redundancy technique providing multiple-bit error protection without using extra redundancy. IEEE Transactions on Computers 35, 623–631 (1986)
Krol, T.: (N, K) concept fault tolerance. IEEE Trans. Comput. 35, 339–349 (1986)
van Lint, J.H.: Introduction to Coding Theory. Springer, New York (1982)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1997)
Miller, D.M., Thornton, M.A.: Multiple Valued Logic: Concepts and Representations. Morgan & Claypool, San Francisco (2008)
von Neumann, J.: Probabilistic logics and synthesis of reliable organisms from unreliable components. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, pp. 43–98. Princeton University Press, Princeton (1956)
Thornton, M.A., Nair, V.S.S.: Efficient calculation of spectral coefficients and their applications. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems CAD-14(11), 1328–1341 (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Astola, H., Stanković, S., Astola, J.T. (2012). Performance Analysis of Error-Correcting Binary Decision Diagrams. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2011. EUROCAST 2011. Lecture Notes in Computer Science, vol 6928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27579-1_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-27579-1_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27578-4
Online ISBN: 978-3-642-27579-1
eBook Packages: Computer ScienceComputer Science (R0)