Improving logic-level representation of taylor expansion diagram using attributed edges

	Improving logic-level representation of taylor expansion diagram using attributed edges
Iranian Journal of Science and Technology Transactions of Electrical Engineering
شناسنامه علمی شماره، دوره 30، شماره 6، فروردین 2006، صفحه 735-748 اصل مقاله (189.8 K)
شناسه دیجیتال (DOI): 10.22099/ijste.2006.878
چکیده
Formal verification of complex digital systems requires a mechanism for efficient representation and manipulation of arithmetic as well as random Boolean functions. Although the Taylor Expansion Diagram can be used effectively to represent arithmetic expressions at the vector level, it is not efficient in the use of memory for representing bit-level logic expressions. In this paper, we present modifications to TED that will improve its ability for logic representation while maintaining its robustness in arithmetic representation. Our experimental results show a 30% reduction in the number of nodes in some benchmarks.
کلیدواژه‌ها
Formal verification؛ Taylor expansion diagram؛ attributed edge؛ register transfer level

آمار تعداد مشاهده مقاله: 1,320 تعداد دریافت فایل اصل مقاله: 1,024