skip to main content
10.1145/1119772.1119844acmconferencesArticle/Chapter ViewAbstractPublication PagesaspdacConference Proceedingsconference-collections
Article

On improving FPGA routability applying multi-level switch boxes

Authors Info & Claims
Published:21 January 2003Publication History

ABSTRACT

In this paper, we propose a new FPGA switch box design style --- the extended switch boxes. An extended switch box is multi-level in nature. It consists of a kernel and extension(s) connected to the kernel, while many conventional switch boxes only consist of the kernel part and are referred to as single-level switch boxes. We show that with a much reduced total number of manufactured switches in the chip, this new design has a guaranteed complete mappability from any global routing to a feasible detailed routing of the entire FPGA chip. The interesting results seem to open a new avenue for designing FPGA routing structures.

References

  1. M. J. Alexander and Gabriel Robins, "New Performance FPGA Routing Algorithms," Proceedings DAC, pp. 562--567. 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Brown, R. J. Francise, J. Rose and Z. G. Vranesic, Field-Programmable Gate arrays, Kluwer-Academic Publisher, Boston MA, 1992.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Brown, J. Rose and Z. G. Vranesic, "A detailed router for Field-Programmable Gate Arrays", IEEE Trans. on Computer-Aided Design, 11:620 -- 628, May 1992.Google ScholarGoogle Scholar
  4. Y. W. Chang, D. F. Wong and C. K. Wong, "Universal switch modules for FPGA design", ACM Trans. on Design Automation of Electronic Systems, 1(1):80--101, January 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. H. Fan, J. Liu Technique for FPGA Switch Box Designs, to appear.Google ScholarGoogle Scholar
  6. H. Fan, J. Liu, Y. L. Wu and C. C. Cheung. "On Optimum Switch Box Designs for 2D FPGAs". Proc. IEEE/ACM Design Automation Conference (DAC), p. 203 -- 208, June 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Y. S. Lee and Allen C. H. Wu, "A Performance and Routability Driven Router for FPGAs Considering Path Delays," Proceedings DAC, pp. 557--561, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. F. Pan, Y. L. Wu, C. K. Wong and G. Yan, "On the Optimal Four-Way Switch Box Routing Structures of FPGA Greedy Routing Architectures," Integration, the VLSI Journal. Vol. 25, pp. 137--159, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Y. L. Wu and D. Chang, "On NP-Completeness of 2-D FPGA Routing Architectures and a Novel Solution," Proceedings of International Conference on Computer-Aided-Design 1994, pp. 362--366. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Y. L. Wu, D. Chang, M. Marek-Sadowska and S. Tsukiyama, "Not Necessarily More Switches More Routability", Proc. ASP-DAC, 1997, pp. 579--584.Google ScholarGoogle Scholar
  11. Y. L. Wu, and M. Marek-Sadowska, "Routing for Array Type FPGAs," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, Vol. 16, No. 5, pp. 506--518, May 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Y. L. Wu, M. Tsukiyama and M. Marek-Sadowska, "Graph based analysis of 2-D FPGA routing," IEEE Trans. Comput. Aided Des. 15(1)(1996) 33--44. Google ScholarGoogle ScholarDigital LibraryDigital Library

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
    ASP-DAC '03: Proceedings of the 2003 Asia and South Pacific Design Automation Conference
    January 2003
    865 pages
    ISBN:0780376609
    DOI:10.1145/1119772

    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: 21 January 2003

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • Article

    Acceptance Rates

    Overall Acceptance Rate466of1,454submissions,32%

    Upcoming Conference

    ASPDAC '25
  • Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader