DocumentCode
2560449
Title
Input order for ROBDDs based on kernel analysis
Author
Besson, T. ; Bouzouzou, H. ; Floricica, I. ; Saucier, G. ; Roane, R.
Author_Institution
Inst. Nat. Polytech. de Grenobl
fYear
1993
fDate
22-25 Feb 1993
Firstpage
266
Lastpage
272
Abstract
A method for finding a good input order for the ROBDD representation of Boolean functions for synthesis purposes is presented. This method relies on the analysis of the set of kernels of the functions. To each cokernel/kernel pair is associated a partitioning of the variables and the final order is deduced by intersecting these partitioning requirements. Results on a large set of benchmarks in the synthesis field is provided
Keywords
Boolean functions; logic design; logic partitioning; Boolean functions; ROBDD representation; binary decision diagram; input order; kernel analysis; large set of benchmarks; logic synthesis; partitioning; Automata; Binary decision diagrams; Boolean functions; Circuit synthesis; Data structures; Design automation; Field programmable gate arrays; Kernel; Logic devices; Testing;
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.386465
Filename
386465
Link To Document