DocumentCode :
2560399
Title :
Efficient graph-based computation and manipulation of functional decision diagrams
Author :
Kebschull, U. ; Rosenstiel, W.
Author_Institution :
Lehrstuhl fuer Tech. Inf., Univ. of Tubingen, Germany
fYear :
1993
fDate :
22-25 Feb 1993
Firstpage :
278
Lastpage :
282
Abstract :
An efficient canonical representation for arbitrary Boolean functions, the functional decision diagrams (FDDs), are presented. FDDs are a graphical representation of the Reed-Muller coefficients as BDDs are a representation of the function table. Some algorithms to manipulate FDDs and generate a functional decision diagram from a BDD are presented. The results are very encouraging and show that FDDs are applicable for new approaches to Reed-Muller logic synthesis
Keywords :
Boolean functions; directed graphs; logic design; Reed-Muller coefficients; arbitrary Boolean functions; efficient canonical representation; functional decision diagrams; graph-based computation; logic synthesis; manipulation; Arithmetic; Binary decision diagrams; Boolean functions; Circuit synthesis; Circuit testing; Decision trees; Heuristic algorithms; Logic circuits; Logic design; Minimization methods;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation, 1993, with the European Event in ASIC Design. Proceedings. [4th] European Conference on
Conference_Location :
Paris
Print_ISBN :
0-8186-3410-3
Type :
conf
DOI :
10.1109/EDAC.1993.386463
Filename :
386463
Link To Document :
بازگشت