On channel segmentation design for row-based FPGAs

Kai Zhu, D. F. Wong

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review

21 Citations (Scopus)

Abstract

The channel segmentation design problem for row-based FPGAs is to design a segmented channel to maximize the probability of successful routing. In this paper, we present an algorithm which takes an arbitrary net distribution and an integer K (specifying the maximum number of segments allowed in routing a net) as inputs, and automatically generates a segmented channel which is most suitable for K-segment channel routing. Our algorithm was tested extensively over various net distributions. We also present a new algorithm for segmented channel routing based on reducing the problem to the maximum independent set problem for undirected graphs.

Original languageEnglish
Title of host publication1992 IEEE/ACM International Conference on Computer-Aided Design
PublisherIEEE
Pages26-29
Number of pages4
ISBN (Print)0818630108, 9780818630101
DOIs
Publication statusPublished - Nov 1992
EventIEEE/ACM International Conference on Computer-Aided Design - ICCAD '92 - Santa Clara, United States
Duration: 8 Nov 199212 Nov 1992
https://ieeexplore.ieee.org/xpl/conhome/894/proceeding

Publication series

NameIEEE/ACM International Conference on Computer-Aided Design

Conference

ConferenceIEEE/ACM International Conference on Computer-Aided Design - ICCAD '92
Country/TerritoryUnited States
CitySanta Clara
Period8/11/9212/11/92
Internet address

Scopus Subject Areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'On channel segmentation design for row-based FPGAs'. Together they form a unique fingerprint.

Cite this