Efficient tiling patterns for reconfigurable gate arrays

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper we present a few potentially efficient tiling patterns for gate-array realizations. We start with a brief recapitulation of tiling patterns, and fundamental limits of placement/routing in a two-dimensional plane. We state the first principles (i.e. Rent's Rule, Donath's result, equivalence of wire flux and wire length) and we proceed to define a method to mathematically evaluate tiling patterns based on these principles. With this method we analyze a few regular tiling patterns and present a layout scheme for hexagonal and octagonal FPGAs. We briefly discuss the hierarchical gate array and we conclude with emphasis on the necessity of evolution of tiling patterns with the technology.

Original languageEnglish
Title of host publicationSLIP'08 - Proceedings of the 2008 ACM International Workshop on System Level Interconnect Prediction
Pages19-26
Number of pages8
DOIs
Publication statusPublished - 16 May 2008
Externally publishedYes
Event10th ACM International Workshop on System-Level Interconnect Prediction, SLIP 2008 - Newcastle, United Kingdom
Duration: 5 Apr 20086 Apr 2008

Publication series

NameInternational Workshop on System Level Interconnect Prediction, SLIP

Conference

Conference10th ACM International Workshop on System-Level Interconnect Prediction, SLIP 2008
Country/TerritoryUnited Kingdom
CityNewcastle
Period5/04/086/04/08

Keywords

  • FPGA
  • Hexagonal
  • Octagonal
  • Tiling

Fingerprint

Dive into the research topics of 'Efficient tiling patterns for reconfigurable gate arrays'. Together they form a unique fingerprint.

Cite this