DocumentCode
3406108
Title
Algebraic decision diagrams and their applications
Author
Bahar, R.I. ; Frohm, E.A. ; Gaona, C.M. ; Hachtel, G.D. ; Macii, E. ; Pardo, A. ; Somenzi, F.
Author_Institution
Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO, USA
fYear
1993
fDate
7-11 Nov. 1993
Firstpage
188
Lastpage
191
Abstract
In this paper we present theory and experiments on the algebraic decision diagrams (ADDs). These diagrams extend BDD´s by allowing values from an arbitrary finite domain to be associated with the terminal nodes. We present a treatment founded in Boolean algebras and discuss algorithms and results in applications like matrix multiplication and shortest path algorithms. Furthermore, we outline possible applications of ADD´s to logic synthesis, formal verification, and testing of digital systems.
Keywords
logic design; Boolean algebras; algebraic decision diagrams; arbitrary finite domain; binary decision diagrams; formal verification; logic synthesis; matrix multiplication; shortest path algorithms; Application software; Arithmetic; Binary decision diagrams; Boolean algebra; Boolean functions; Data structures; Digital systems; Formal verification; Logic testing; System testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer-Aided Design, 1993. ICCAD-93. Digest of Technical Papers., 1993 IEEE/ACM International Conference on
Conference_Location
Santa Clara, CA, USA
Print_ISBN
0-8186-4490-7
Type
conf
DOI
10.1109/ICCAD.1993.580054
Filename
580054
Link To Document