2011
DOI: 10.1002/cta.676
|View full text |Cite
|
Sign up to set email alerts
|

BDD‐based synthesis for mixed CMOS/PTL logic

Abstract: SUMMARYPower consumption and performance are two important design constraints for logic synthesis in design automation. In this paper, we propose an efficient synthesis algorithm to minimize power dissipation and optimize performance of the given digital circuits by constructing a binary decision diagram (BDD) whose nodes can be implemented by CMOS logics and pass-transistor logics (PTL) in a cell library.For BDD mapped circuits, the conventional synthesis algorithms need three cells: the CMOS cell, PTL cell, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 17 publications
0
4
0
Order By: Relevance
“…The binary decision diagram (BDD) is a cutting-edge logic decomposition technique for manipulating Boolean functions according to specified optimization criteria. 1 A root node and two terminal nodes make up the decision diagram. The true and complimentary forms are represented by terminal nodes, while intermediary nodes form a canonical structure based on a directly acyclic graph (DAG) with the variables of the Boolean function.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The binary decision diagram (BDD) is a cutting-edge logic decomposition technique for manipulating Boolean functions according to specified optimization criteria. 1 A root node and two terminal nodes make up the decision diagram. The true and complimentary forms are represented by terminal nodes, while intermediary nodes form a canonical structure based on a directly acyclic graph (DAG) with the variables of the Boolean function.…”
Section: Introductionmentioning
confidence: 99%
“…The binary decision diagram (BDD) is a cutting‐edge logic decomposition technique for manipulating Boolean functions according to specified optimization criteria 1 . A root node and two terminal nodes make up the decision diagram.…”
Section: Introductionmentioning
confidence: 99%
“…Ref. [16] proposes an efficient synthesis algorithm to minimize power dissipation and optimize performance of the given digital circuits. It is done by constructing BDD whose nodes can be implemented by CMOS logics and PTLs in a cell library.…”
Section: Introductionmentioning
confidence: 99%
“…Binary decision diagrams (BDDs) are state-of-art data structures for the representation and manipulation of Boolean functions in the area of VLSI CAD [3][4][5]. Forward BDDs have been studied in logic synthesis because they allow for aspects of circuit synthesis and technology mapping [4,5,[8][9][10][11]16] to be combined. Because of the well-developed logic synthesis methods in static Complementary Metal Oxide Semiconductor (CMOS) technology, CMOS has been used in the realization of VLSI circuits.…”
Section: Introductionmentioning
confidence: 99%