BDD decomposition for delay oriented pass transistor logic synthesis

Rupesh S. Shelar, Sachin S. Sapatnekar

Research output: Contribution to journalArticlepeer-review

35 Scopus citations

Abstract

We address the problem of synthesizing pass transistor logic (PTL), with the specific objective of delay reduction, through binary decision diagram (BDD) decomposition. The decomposition is performed by mapping the BDD to a network flow graph, and then applying the max-flow min-cut technique to bipartition the BDD optimally under a cost function that measures the delay and area of the decomposed implementations. Experimental results obtained by running our algorithm on the set of ISCAS'85 benchmarks show a 31% improvement in delay and a 30% improvement in area, on an average, as compared to static CMOS implementations for XOR intensive circuits, while in case of arithmetic logic unit and control circuits that are NAND intensive, improvements over static CMOS are small and inconsistent.

Original languageEnglish (US)
Pages (from-to)957-970
Number of pages14
JournalIEEE Transactions on Very Large Scale Integration (VLSI) Systems
Volume13
Issue number8
DOIs
StatePublished - Aug 2005

Bibliographical note

Funding Information:
Manuscript received November 26, 2003; revised November 4, 2004. This work was supported in part by Semiconductor Research Consortium (SRC) under Contract 2002-TJ-1092 and under Award NSF CCR-0098117.

Keywords

  • Binary decision diagrams (BDDs)
  • Functional decomposition
  • Logic synthesis
  • Pass transistor logic

Fingerprint Dive into the research topics of 'BDD decomposition for delay oriented pass transistor logic synthesis'. Together they form a unique fingerprint.

Cite this