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

Automatic transistor and physical design of FPGA tiles from an architectural specification

Published:23 February 2003Publication History

ABSTRACT

One of the most difficult and time-consuming steps in the creation of an FPGA is its transistor-level design and physical layout. Modern commercial FPGAs typically consume anywhere from 50 to 200 man-years simply in the layout step. To date, automated tools have only been employed in small parts of the periphery and programming circuitry. The core tiles, which are repeated many times, are subject to painstaking manual design and layout. In this paper we present a new system (called GILES, for Good Instant Layout of Erasable Semiconductors) that automatically generates a transistor-level schematic from a high-level architectural specification of an FPGA. It also generates a cell-level netlist that is placed and routed automatically. The architectural specification is the one used as input to the VPR [3] architectural exploration tool. The output is the mask-level layout of a single tile that can be replicated to form an FPGA array. We describe a new placement tool that simultaneously places and compacts the layout to minimize white space and wiring demand, and a special-purpose router built for this task.GILES can place and route a tile consisting of four 4-input LUT logic cells and all of its programmable wires in a 0.18μm CMOS process using 8 layers of metal and 25983μm2 of area. When we generate the layout of an architecture similar to the Xilinx Virtex-E FPGA (built in a 0.18μm process) GILES requires only 47% more area than the original. The layout area of an architecture similar to the Altera Apex 20K400E (also built in a 0.18µm process) constructed by GILES requires 97% more area than the original.

References

  1. K. Padalia, "Automated Transistor-Level Design and Layout Placement of FPGA Logic and Routing from an Architectural Specification", Undergraduate Thesis, University of Toronto, 2001 http://www.eecg.toronto.edu/~jayar/pubs/ATL/ketan_padalia_2001_thesis.pdfGoogle ScholarGoogle Scholar
  2. V. Betz, "Architecture and CAD for Speed and Area Optimization of FPGAs," Ph. D. Thesis, University of Toronto, 1998.Google ScholarGoogle Scholar
  3. V. Betz, J. Rose, and A. Marquardt, Architecture and CAD for Deep-Submicron FPGAs, Kluwer Academic Publishers, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. V. Betz and J. Rose, "Cluster-Based Logic Blocks for FPGAs: Area-Efficiency vs. Input Sharing and Size," in IEEE CICC 1997, Santa Clara, CA, pp. 551--554.Google ScholarGoogle Scholar
  5. R. Fung, "Optimization Of Transistor-Level Floorplans For Field-Programmable Gate Arrays", Undergraduate Thesis, University of Toronto, 2001 http://www.eecg.toronto.edu/~jayar/pubs/ATL/ryan_fung_2002_thesis.pdfGoogle ScholarGoogle Scholar
  6. E. Ahmed and J. Rose, "The Effect of LUT and Cluster Size on Deep-Submicron FPGA Performance and Density," in FPGA 2000, ACM Symp. FPGAs, February 2000, pp. 3--12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. P. Hallschmid, S.J.E. Wilton, "Detailed Routing Architectures for Embedded Programmable Logic IP Cores', in the ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, Monterey, CA, Feb. 2001, pp. 69--74. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Stauffer, R. Nair, "Optimal CMOS Cell TransistorPlacement: A Relaxation Approach", Proc. ICCAD, 1988, pp. 364--367.Google ScholarGoogle Scholar
  9. S. Kirkpatrick, C. Gelatt and M. Vecchi, "Optimization by Simulated Annealing," Science, May 13, 1983, pp. 671--680.Google ScholarGoogle Scholar
  10. T. Serdar and C. Sechen, "AKORD: Transistor Level and Mixed Transistor/Gate Level Placement Tool for Digital Data Paths", International Conference on CAD, Nov. 1999, pp. 91--97. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. http://www.numeritech.com/ntproducts/Google ScholarGoogle Scholar
  12. K. Azegami, S. Kashiwakura, K. Yamashita, "Flexible FPGA Architecture Realized of General Purpose Sea of Gates, FPGA '96. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. S. Phillips, S. Hauck, "Automatic Layout of Domain-Specific Reconfigurable Subsystems for System-on-a-Chip," FPGA 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. http://www.juniper.net/micromagic/max.htmlGoogle ScholarGoogle Scholar
  15. C. Sechen and A. Sangiovanni-Vincentelli, "The TimberWolf Placement and Routing Package," JSSC, April 1985, pp. 510--522.Google ScholarGoogle Scholar
  16. Cheng, C. "RISA: Accurate and Efficient Placement and Routing Modeling", ICCAD, 1994. pp. 690--695. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. V. Betz, "VPR and T-Vpack: Versatile Packing, Placement and Routing for FPGAs", http://www.eecg.toronto.edu/~vaughn/vpr/vpr.htmlGoogle ScholarGoogle Scholar
  18. MOSIS Corporation, "MOSIS Scalable CMOS (SCMOS) Design Rules," http://www.mosis.org/Technical/Designrules/scmos/scmos-main.htmlGoogle ScholarGoogle Scholar
  19. 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
  20. C. Y. Lee, "An Algorithm for Path Connections and its Applications," IRE Trans. Electron. Comput., Vol. EC=10, 1961, pp. 346--365.Google ScholarGoogle Scholar
  21. M. Bourgeault, J. Slavkin, and Y. Sun, "Automatic Transistor-Level Design and Layout of FPGAs", Undergraduate Design Project, University of Toronto, 2002. http://www.eecg.toronto.edu/~jayar/pubs/ATL/Bourgeault_Slavkin_Sun_2002_Project.pdfGoogle ScholarGoogle Scholar
  22. Giles Powell and Srinvas Reddy, Altera Corporation, Private Communication.Google ScholarGoogle Scholar

Index Terms

  1. Automatic transistor and physical design of FPGA tiles from an architectural specification

        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 '03: Proceedings of the 2003 ACM/SIGDA eleventh international symposium on Field programmable gate arrays
          February 2003
          256 pages
          ISBN:158113651X
          DOI:10.1145/611817

          Copyright © 2003 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: 23 February 2003

          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