Abstract—We present a novel class of decision diagrams, called Bicon-ditional Binary Decision Diagrams (BBDDs), that enable efficient logic synthesis for XOR-rich circuits. BBDDs are binary decision diagrams where the Shannon’s expansion is replaced by the biconditional expansion. Since the biconditional expansion is based on the XOR/XNOR operations, XOR-rich logic circuits are efficiently represented and manipulated with canonical Reduced and Ordered BBDDs (ROBBDDs). Experimental results show that ROBBDDs have 37 % fewer nodes on average compared to traditional ROBDDs. To exploit this opportunity in logic synthesis for XOR-rich circuits, we developed a BBDD-based One-Pass Synthesis (OPS) methodology. The BBDD-based OPS is capable to harnes...
New algorithms for generating a regular two-dimensional layout representation for multi-output, inco...
Although contemporary logic synthesis performs well on random logic, it may produce subpar results i...
Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. Effici...
We present a novel class of decision diagrams, called Biconditional Binary Decision Diagrams (BBDDs)...
Binary decision diagrams (BDDs) is the most efficient Boolean logic representation found so far. In ...
In this paper, we present biconditional binary deci- sion diagrams (BBDDs), a novel canonical repres...
Binary Decision Diagrams (BDDs) provide a compact representation for Boolean functions. This researc...
Biconditional Binary Decision Diagrams (BBDDs) are a novel class of binary decision diagrams where t...
Data structures for Boolean functions build an essential component of design automation tools, espec...
Binary Decision Diagrams (BDDs) became popular after the ordering constraints proposed by Bryant [1]...
Despite decades of efforts and successes in logic synthesis, algorithm runtime has rarely been taken...
Data structures for Boolean functions build an essential component of design automation tools, espe...
Autosymmetric functions are particular "regular" Boolean functions that are exploited for logic opti...
Abstract — Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verificat...
Design of digital systems is based on various specifications of Boolean functions, most often in a f...
New algorithms for generating a regular two-dimensional layout representation for multi-output, inco...
Although contemporary logic synthesis performs well on random logic, it may produce subpar results i...
Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. Effici...
We present a novel class of decision diagrams, called Biconditional Binary Decision Diagrams (BBDDs)...
Binary decision diagrams (BDDs) is the most efficient Boolean logic representation found so far. In ...
In this paper, we present biconditional binary deci- sion diagrams (BBDDs), a novel canonical repres...
Binary Decision Diagrams (BDDs) provide a compact representation for Boolean functions. This researc...
Biconditional Binary Decision Diagrams (BBDDs) are a novel class of binary decision diagrams where t...
Data structures for Boolean functions build an essential component of design automation tools, espec...
Binary Decision Diagrams (BDDs) became popular after the ordering constraints proposed by Bryant [1]...
Despite decades of efforts and successes in logic synthesis, algorithm runtime has rarely been taken...
Data structures for Boolean functions build an essential component of design automation tools, espe...
Autosymmetric functions are particular "regular" Boolean functions that are exploited for logic opti...
Abstract — Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verificat...
Design of digital systems is based on various specifications of Boolean functions, most often in a f...
New algorithms for generating a regular two-dimensional layout representation for multi-output, inco...
Although contemporary logic synthesis performs well on random logic, it may produce subpar results i...
Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. Effici...