Representation of Boolean functions with ROBDDs

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

Povzetek

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.

Ključne besede

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

Podatki

Jezik:	Angleški jezik
Leto izida:	2000
Tipologija:	1.16 - Samostojni znanstveni sestavek ali poglavje v monografski publikaciji
Organizacija:	UM FERI - Fakulteta za elektrotehniko, računalništvo in informatiko
UDK:	004:519.2
COBISS:	6992150
Št. ogledov:	1783
Št. prenosov:	40
Ocena:	0 (0 glasov)
Metapodatki:

Ostali podatki

Sekundarni jezik:	Angleški jezik
Sekundarne ključne besede:	Boolove funkcije;algoritmi;binarni odločitveni diagram;struktura podatkov;
URN:	URN:SI:UM:
Vrsta dela (COBISS):	Delo ni kategorizirano
Strani:	str. 1-8
ID:	10902456