Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/343647.343800acmconferencesArticle/Chapter ViewAbstractPublication PagesdateConference Proceedingsconference-collections
Article
Free access

On the generation of multiplexer circuits for pass transistor logic

Published: 01 January 2000 Publication History
First page of PDF

References

[1]
E Ashar, A. Ghosh, and S. Devadas. Boolean satisfiability and equivalence checking using general binary decision diagrams. In Int'l Conf. on CAD, 1991.
[2]
J. Bern, J. Gergov, C. Meinel, and A. Slobodovfi. Boolean manipulation with free B DD' s. First experimental results. In European Design & Test Conf., pages 200-207, 1994.
[3]
V. Bertacco, S. Minato, E Verplaetse, L. Benini, and G. De Micheli. Decision diagrams and pass transistor logic synthesis. In Int'l Workshop on Logic Synth., 1997.
[4]
K.S. Brace, R.L. Rudell, and R.E. Bryant. Efficient implementation of a BDD package. In Design Automation Conf., pages 40-45, 1990.
[5]
R.E. Bryant. Graph- based algorithms for Boolean function manipulation. IEEE Trans. on Comp., 35(8):677-691, 1986.
[6]
E Buch, A. Narayan, A.R. Newton, and A.L. Sangiovanni-Vincentelli. Logic synthesis for large pass transistor circuits. In Int'l Conf. on CAD, pages 663-670, 1997.
[7]
S. Chang, D. Cheng, and M. Marek-Sadowska. Minimizing ROB DD size of incompletely specified multiple output functions. In European Design & Test Conf., pages 620-624, 1994.
[8]
R. Chaudhry, T.-H. Liu, A. Aziz, and J.L. Burns. Areaoriented synthesis for pass-transistor logic. In Int'l Conf. on Comp. Design, pages 160-167, 1998.
[9]
T.S. Cheung and K. Asada. Regenerative passtransistor logic: A circuit technique for high speed digital design. IEICE Trans. Electron., E79- C(9):1274-1283, 1996.
[10]
E Ferrandi, A. Macii, E. Macii, M. Poncino, R. Scarsi, and E Somenzi. Symbolic algorithms for layoutoriented synthesis of pass transistor logic circuits. In Int'l Conf. on CAD, 1998.
[11]
K. Karplus. ITEM: an if-then-else minimizer for logic synthesis. Technical report, University of California, Santa Cruz, 1992.
[12]
F.S. Lai and W. Hwang. Design and implementation of differential cascode voltage switch with pass-gate (dcvspg) logic for high-performance digital systems. IEEE Jour. of Solid-State Circ., 32(4):563-573, April 1997.
[13]
T.-H. Liu, A. Aziz, and J.L. Burns. Performance driven synthesis for pass-transistor logic. In Int'l Workshop on Logic Synth., pages 255-259, 1998.
[14]
D.E. Long. BDD library. 1993.
[15]
A. Parameswar, H. Hara, and T. Sakurai. A high speed, low power, swing restored pass-transistor logic based multiply and accumulate circuit for multimedia applications. In Proc. Custom Integrated Circuits Conf., pages 278-281, May 1994.
[16]
R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Int'l Conf. on CAD, pages 42-47, 1993.
[17]
C. Scholl, S. Melchior, G. Hotz, and E Molitor. Minimizing ROB DD sizes of incompletely specified functions by exploiting strong symmetries. In European Design & Test Conf., pages 229-234, 1997.
[18]
E. Sentovich, K. Singh, L. Lavagno, Ch. Moon, R. Murgai, A. Saldanha, H. Savoj, E Stephan, R. Brayton, and A. Sangiovanni-Vincentelli. SIS: A system for sequential circuit synthesis. Technical report, University of Berkeley, 1992.
[19]
T.R. Shiple, R. Hojati, A.L. Sangiovanni-Vincentelli, and R.K. Brayton. Heuristic minimization of BDDs using don't cares. In Design Automation Conf., pages 225-231, 1994.
[20]
E Somenzi. CUDD: CU Decision Diagram Package Release 2.3.0. University of Colorado at Boulder, 1998.
[21]
N. Weste and K. Eshraghian. Principles of CMOS VLSI Design: A Systems Perspective. Addison- Wesley, 1992.
[22]
K. Yano, Y. Sasaki, K. Rikino, and K. Seki. Top-down pass-transistor logic design. IEEE Jour. of Solid-State Circ., 31 (6):792-803, June 1996.
[23]
K. Yano, T. Yamanaka, T. Nishida, and M. Satio. A 3.8-ns cmos 16 x 16-b multiplier using complementary pass-transistor logic. IEEE Jour. of Solid-State Circ., 25(2):388-395, April 1990.

Cited By

View all
  • (2024)Compact Multiplexer Design with Multi-threshold Ferroelectric FETs2024 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)10.1109/ISVLSI61997.2024.00142(735-739)Online publication date: 1-Jul-2024
  • (2020)Virtualization-Based Efficient TSV Repair for 3-D Integrated CircuitsIEEE Access10.1109/ACCESS.2019.29402118(42231-42242)Online publication date: 2020
  • (2007)A comparative study of CMOS gates with minimum transistor stacksProceedings of the 20th annual conference on Integrated circuits and systems design10.1145/1284480.1284511(93-98)Online publication date: 3-Sep-2007
  • Show More Cited By

Index Terms

  1. On the generation of multiplexer circuits for pass transistor logic

        Recommendations

        Comments

        Please enable JavaScript to view thecomments powered by Disqus.

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        DATE '00: Proceedings of the conference on Design, automation and test in Europe
        January 2000
        707 pages
        ISBN:1581132441
        DOI:10.1145/343647
        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]

        Sponsors

        • EDAA: European Design Automation Association
        • ECSI
        • EDAC: Electronic Design Automation Consortium
        • SIGDA: ACM Special Interest Group on Design Automation
        • IEEE-CS: Computer Society
        • IFIP: International Federation for Information Processing
        • The Russian Academy of Sciences: The Russian Academy of Sciences

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 01 January 2000

        Permissions

        Request permissions for this article.

        Check for updates

        Qualifiers

        • Article

        Conference

        DATE00
        Sponsor:
        • EDAA
        • EDAC
        • SIGDA
        • IEEE-CS
        • IFIP
        • The Russian Academy of Sciences
        DATE00: Design Automation and Test in Europe
        March 27 - 30, 2000
        Paris, France

        Acceptance Rates

        Overall Acceptance Rate 518 of 1,794 submissions, 29%

        Upcoming Conference

        DATE '25
        Design, Automation and Test in Europe
        March 31 - April 2, 2025
        Lyon , France

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)77
        • Downloads (Last 6 weeks)10
        Reflects downloads up to 16 Nov 2024

        Other Metrics

        Citations

        Cited By

        View all
        • (2024)Compact Multiplexer Design with Multi-threshold Ferroelectric FETs2024 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)10.1109/ISVLSI61997.2024.00142(735-739)Online publication date: 1-Jul-2024
        • (2020)Virtualization-Based Efficient TSV Repair for 3-D Integrated CircuitsIEEE Access10.1109/ACCESS.2019.29402118(42231-42242)Online publication date: 2020
        • (2007)A comparative study of CMOS gates with minimum transistor stacksProceedings of the 20th annual conference on Integrated circuits and systems design10.1145/1284480.1284511(93-98)Online publication date: 3-Sep-2007
        • (2006)Fast disjoint transistor networks from BDDsProceedings of the 19th annual symposium on Integrated circuits and systems design10.1145/1150343.1150381(137-142)Online publication date: 28-Aug-2006
        • (2006)Exact minimisation of path-related objective functions for binary decision diagramsIEE Proceedings - Computers and Digital Techniques10.1049/ip-cdt:20050181153:4(231)Online publication date: 2006
        • (2005)BDD decomposition for delay oriented pass transistor logic synthesisIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2005.85360113:8(957-970)Online publication date: 1-Aug-2005
        • (2005)Average Path Length of Binary Decision DiagramsIEEE Transactions on Computers10.1109/TC.2005.13754:9(1041-1053)Online publication date: 1-Sep-2005
        • (2005)Exact lower bound for the number of switches in series to implement a combinational logic cellProceedings of the 2005 International Conference on Computer Design10.1109/ICCD.2005.51(357-362)Online publication date: 2-Oct-2005
        • (2004)Minimization of the expected path length in BDDs based on local changesProceedings of the 2004 Asia and South Pacific Design Automation Conference10.5555/1015090.1015321(865-870)Online publication date: 27-Jan-2004
        • (2004)Using genetic programing and multiplexers for the synthesis of logic circuitsEngineering Optimization10.1080/0305215041000168650336:4(491-511)Online publication date: Aug-2004
        • Show More Cited By

        View Options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Login options

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media