skip to main content
10.1145/360276.360302acmconferencesArticle/Chapter ViewAbstractPublication PagesfpgaConference Proceedingsconference-collections
Article

Mixing buffers and pass transistors in FPGA routing architectures

Authors Info & Claims
Published:01 February 2001Publication History

ABSTRACT

The routing architecture of an FPGA consists of the length of the wires, the type of switch used to connect wires (buffered, unbuffered, fast or slow) and the topology of the interconnection of the switches and wires. FPGA routing architecture has a major influence on the logic density and speed of FPGA devices. Previ?ous work [] based on a 0.35um CMOS process has suggested that an architecture consisting of length 4 wires (where the length of a wire is measured in terms of the number of logic blocks it passes before being switched) and half of the programmable switches are active buffers, and half are pass transistors. In that work, however, the topology of the routing architecture prevented buffered tracks from connecting to pass-transistor tracks. This restriction prevents the creation of interconnection trees for high fanout nets that have a mixture of buffers and pass transistors. Electrical simulations sug?gest that connections closer to the leaves on interconnection trees are faster using pass transistors, but it is essential to buffer closer to the source. This latter effect is well known in regular ASIC routing [2].

In this work we propose a new routing architecture that allows liberal switching between buffered and pass transistor tracks. We explore various versions of the architecture to determine the den?sity-speed trade-off. We show that one version of the new architec?ture results in FPGAs with 10% faster critical path delay yet uses the same area as the previous architecture that does not allow such switching. We also show that the new architecture allows a useful area-speed trade off and several versions of the new architecture result in FPGAs with 8% gain in area-delay product than the previ?ous architecture that does not allow the switching.

References

  1. 1.V. Betz, J. Rose, "FPGA Routing Architecture: Segmentation and Buffering to Optimize Speed and Density", FPGA'99, pp. 59-68. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.J. Cong, K.S. Leung, Optimal Wiresizing Under the Distributed Elmore Delay Model, Proc. Intl'l Conf. on Com-puter Aided Design, 1993, pp. 634-639. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.S. Brown, R. Francis, J. Rose, Z. Vranesic, Field-Programmable Gate Arrays, Kluwer Academic Publishers, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.V. Betz, J. Rose, A. Marquardt, Architecture and CAD for Deep-Submicron FPGAs, Kluwer Academic Publishers, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.E. Ahmed, J. Rose, The Effect of LUT and Cluster Size on Deep-Submicron FPGA Performance and Density FPGA'00, Monterey, CA, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.E.M. Sentovich et al, SIS: A System for Sequential Circuit Analysis, Tech. Report No. UCB/ERL M92/41, University of California, Berkeley, 1990.Google ScholarGoogle Scholar
  7. 7.J. Cong, Y. Ding, FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Designs, IEEE Trans. on CAD, Jan. 1994, pp.1-12.Google ScholarGoogle Scholar
  8. 8.A. Marquardt, V. Betz, J. Rose, Using Cluster-Based Logic Blocks and Timing-Driven Packing to Improve FPGA Speed and Density, ACM/SIGDA FPGA 99, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.S. Yang, Logic Synthesis and Optimization Benchmarks, Version 3.0, Tech. Report, Microelectronics Centre of North Carolina, 1991.Google ScholarGoogle Scholar
  10. 10.E. Ahmed, M.A.Sc Thesis, University of Toronto, 2000.Google ScholarGoogle Scholar
  11. 11.Xilinx XC4000X Data Book, May 14, 1999.Google ScholarGoogle Scholar
  12. 12.W. Elmore, The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers, Journal of Applied Physics, January 1948, pp. 55-63.Google ScholarGoogle Scholar
  13. 13.C. Ebeling, L. McMurchie, S. A. Hauck and S. Burns, "Placement and Routing Tools for the Triptych FPGA, IEEE Trans. on VLSI, Dec. 1995, pp. 473-482. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Mixing buffers and pass transistors in FPGA routing architectures

        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
          FPGA '01: Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays
          February 2001
          200 pages
          ISBN:1581133413
          DOI:10.1145/360276

          Copyright © 2001 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: 1 February 2001

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate125of627submissions,20%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader