DocumentCode
549628
Title
Are logic synthesis tools robust?
Author
Puggelli, Alberto ; Welp, Tobias ; Kuehlmann, Andreas ; Sangiovanni-Vincentelli, Alberto
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Univ. of California - Berkeley, Berkeley, CA, USA
fYear
2011
fDate
5-9 June 2011
Firstpage
633
Lastpage
638
Abstract
A systematic investigation is presented about the robustness of logic synthesis tools to equivalence-preserving transformations of the input Verilog file. We have developed a framework that: 1) parses Verilog behavioral models into an abstract syntax tree; 2) generates random equivalence-preserving transformations on the syntax tree, and; 3) writes the transformed design back in Verilog format. The original and the transformed Verilog descriptions are then checked for equivalence and synthesized. Results show that average (peak) improvements in area of 2:5%(11%) and length of the critical path of 4%(13%) are achievable. Indeed these figures are comparable to recent advancements in logic synthesis (achieve 4:9%(23%) 5%(24%) improvements area-wise, respectively), signaling a relevant lack of robustness in synthesis tools. This lack of robustness suggests that new synthesis algorithms should be evaluated by measuring the average improvement on several transformed files to assess their real contributions to the quality of the results.
Keywords
hardware description languages; logic design; network synthesis; Verilog behavioral models; Verilog file; abstract syntax tree; logic synthesis tools; random equivalence-preserving transformation generation; Algorithm design and analysis; Benchmark testing; Data structures; Hardware design languages; Reduced instruction set computing; Robustness; Synthesizers; Logic Synthesis; Robustness; Verilog;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference (DAC), 2011 48th ACM/EDAC/IEEE
Conference_Location
New York, NY
ISSN
0738-100x
Print_ISBN
978-1-4503-0636-2
Type
conf
Filename
5981984
Link To Document