On channel segmentation design for row-based FPGAs

Kai Zhu, D. F. Wong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 (US)
Title of host publicationIEEE/ACM International Conference on Computer-Aided Design
PublisherPubl by IEEE
Pages26-29
Number of pages4
ISBN (Print)0818630108
StatePublished - Dec 1 1992
Externally publishedYes
EventIEEE/ACM International Conference on Computer-Aided Design - ICCAD '92 - Santa Clara, CA, USA
Duration: Nov 8 1992Nov 12 1992

Publication series

NameIEEE/ACM International Conference on Computer-Aided Design

Other

OtherIEEE/ACM International Conference on Computer-Aided Design - ICCAD '92
CitySanta Clara, CA, USA
Period11/8/9211/12/92

ASJC 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