skip to main content
10.1145/1150343.1150381acmconferencesArticle/Chapter ViewAbstractPublication PagessbcciConference Proceedingsconference-collections
Article

Fast disjoint transistor networks from BDDs

Published:28 August 2006Publication History

ABSTRACT

In this paper, we describe different ways to derive transistor networks from BDDs. The use of disjoint pull-up (composed of PMOS transistors) and pull-down (composed of NMOS transistors) planes allows simplifications that result in shorter pull-up and pull-down transistor stacks. The reduced length of transistor stacks leads to the fastest implementation among the six different strategies evaluated to generate transistor networks from BDDs. Delay and area results are presented showing the impact of the proposed strategy.

References

  1. C.Yang and M.Ciesielski. BDS: a BDD-based logic optimization system. IEEE Transactions on CAD, Volume 21, Issue 7, July 2002 Page(s):866--876. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. P. Buch, A. Narayan, A.R. Newton and A. Sangiovanni-Vincentelli. Logic synthesis for large pass transistor circuits. ICCAD 1997. Pages:663--670. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Scholl and B. Becker. On the generation of multiplexer circuits for pass transistor logic. DATE 2000. Pp:372--378. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. P. Lindgren, M. Kerttu, M. Thornton and R. Drechsler. Low power optimization technique for BDD mapped circuits. ASP-DAC 2001. Pages:615--621. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. R.S. Shelar and S.S. Sapatnekar. An efficient algorithm for low power pass transistor logic synthesis. ASP-DAC 2002. Pages:87--92. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Avci and T. Yildirim. General design method for complementary pass transistor logic circuits. Electronics Letters, Vol.: 39 , Number: 1 , 9 Jan. 2003. Pages:46--48.Google ScholarGoogle Scholar
  7. R.S. Shelar and S. Sapatnekar. BDD decomposition for delay oriented pass transistor logic synthesis. Very Large Scale Integration (VLSI) Systems, IEEE Transactions on Volume 13, Issue 8, Aug. 2005 Page(s):957--970. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A.I. Reis, M. Robert, D. Auvergne and R. Reis. Associating CMOS transistors with BDD arcs for technology mapping. Electronics Letters, v. 31, n. 14, p. 1118--1120, 1995.Google ScholarGoogle Scholar
  9. S. Gavrilov, A. Glebov, S. Pullela, S.C. Moore, A. Dharchoudhury, R. Panda, G. Vijayan and D.T. Blaauw. Library-less synthesis for static CMOS combinational logic circuits. ICCAD 1997. Pages:658--662. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. C. L. Liu and J. A. Abraham. Transistor level synthesis for static CMOS combinational circuits. VLSI, 1999. Proceedings of the Ninth Great Lakes Symposium. Page(s): 172--175. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. S. Gavrilov and A. Glebiy. BDD based circuit level structural optimization for digital CMOS. Proceedings of MALOPD 1999. Pages: 45--49.Google ScholarGoogle Scholar
  12. M. Kanecko and J. Tian. Concurrent cell generation and mapping for CMOS logic circuits. ASPDAC97. Pp. 247--52.Google ScholarGoogle Scholar
  13. R.E.B. Poli, F.R. Schneider, R.P. Ribas and A.I. Reis. Unified theory to build cell-level transistor networks from BDDs. SBCCI 2003. Pages: 199--204. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Fast disjoint transistor networks from BDDs

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          SBCCI '06: Proceedings of the 19th annual symposium on Integrated circuits and systems design
          August 2006
          248 pages
          ISBN:1595934790
          DOI:10.1145/1150343

          Copyright © 2006 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 28 August 2006

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate133of347submissions,38%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader