Improving logic-level representation of taylor expansion diagram using attributed edges
Editorial
10.22099/ijste.2006.878
Abstract
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.
(2006). Improving logic-level representation of taylor expansion diagram using attributed edges. Iranian Journal of Science and Technology Transactions of Electrical Engineering, 30(6), 735-748. doi: 10.22099/ijste.2006.878
MLA
. "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. doi: 10.22099/ijste.2006.878
HARVARD
(2006). 'Improving logic-level representation of taylor expansion diagram using attributed edges', Iranian Journal of Science and Technology Transactions of Electrical Engineering, 30(6), pp. 735-748. doi: 10.22099/ijste.2006.878
VANCOUVER
Improving logic-level representation of taylor expansion diagram using attributed edges. Iranian Journal of Science and Technology Transactions of Electrical Engineering, 2006; 30(6): 735-748. doi: 10.22099/ijste.2006.878
)