Improving Taylor Expansion Diagrams for Boolean Function Manipulation

Increasing size and complexity of digital systems requires higher level structures for verification. Recently a new, canonical and graph-based representation called TED has been introduced. TED can represent algebraic equations effectively but suffers from not having a good logic level representation. In this paper, we present modifications to TED that improve its ability for logic level representation. Our experimental results show a 100% reduction in the number of TED nodes in some benchmarks.