Representation of Boolean functions with ROBDDs

Aleš Časar (Author), Robert Meolic (Author)

Abstract

This paper describes data structures and algorithms for representation of Boolean functions with reduced ordered binary decision diagrams (ROBDDs). A hash table is used for quick search. Additional information about variables and functions is stored in binary trees. Manipulations on functions are based on a recursive algorithm of ITE operation. The primary goal of this article is describe programming technics needed to realize the idea. For the first time here recursive algorithms for composing functions and garbage collection with a formulae counter are presented. This is better than garbage collection in other known implementations. The results of the tests show that the described representation is very efficient in applications which operate with Boolean functions.

Keywords

Boolove funkcije;algoritmi;binarni odločitveni diagram;struktura podatkov;Reduced Ordered Binary Decision Diagram;Boolean function;logic functions;logic design verification;hash table;

Data

Language:	English
Year of publishing:	2000
Typology:	1.16 - Independent Scientific Component Part or a Chapter in a Monograph
Organization:	UM FERI - Faculty of Electrical Engineering and Computer Science
UDC:	004:519.2
COBISS:	6992150
Views:	1783
Downloads:	40
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary keywords:	Boolove funkcije;algoritmi;binarni odločitveni diagram;struktura podatkov;
URN:	URN:SI:UM:
Type (COBISS):	Not categorized
Pages:	str. 1-8
ID:	10902456