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

Fingerprint

Field programmable gate arrays (FPGA)

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Zhu, K., & Wong, D. F. (1992). On channel segmentation design for row-based FPGAs. In IEEE/ACM International Conference on Computer-Aided Design (pp. 26-29). (IEEE/ACM International Conference on Computer-Aided Design). Publ by IEEE.

On channel segmentation design for row-based FPGAs. / Zhu, Kai; Wong, D. F.

IEEE/ACM International Conference on Computer-Aided Design. Publ by IEEE, 1992. p. 26-29 (IEEE/ACM International Conference on Computer-Aided Design).

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

Zhu, K & Wong, DF 1992, On channel segmentation design for row-based FPGAs. in IEEE/ACM International Conference on Computer-Aided Design. IEEE/ACM International Conference on Computer-Aided Design, Publ by IEEE, pp. 26-29, IEEE/ACM International Conference on Computer-Aided Design - ICCAD '92, Santa Clara, CA, USA, 11/8/92.
Zhu K, Wong DF. On channel segmentation design for row-based FPGAs. In IEEE/ACM International Conference on Computer-Aided Design. Publ by IEEE. 1992. p. 26-29. (IEEE/ACM International Conference on Computer-Aided Design).
Zhu, Kai ; Wong, D. F. / On channel segmentation design for row-based FPGAs. IEEE/ACM International Conference on Computer-Aided Design. Publ by IEEE, 1992. pp. 26-29 (IEEE/ACM International Conference on Computer-Aided Design).
@inproceedings{7bcecd6751b241fe8fabe2851c52ebc9,
title = "On channel segmentation design for row-based FPGAs",
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.",
author = "Kai Zhu and Wong, {D. F.}",
year = "1992",
month = "12",
day = "1",
language = "English (US)",
isbn = "0818630108",
series = "IEEE/ACM International Conference on Computer-Aided Design",
publisher = "Publ by IEEE",
pages = "26--29",
booktitle = "IEEE/ACM International Conference on Computer-Aided Design",

}

TY - GEN

T1 - On channel segmentation design for row-based FPGAs

AU - Zhu, Kai

AU - Wong, D. F.

PY - 1992/12/1

Y1 - 1992/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0026998803&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026998803&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0026998803

SN - 0818630108

T3 - IEEE/ACM International Conference on Computer-Aided Design

SP - 26

EP - 29

BT - IEEE/ACM International Conference on Computer-Aided Design

PB - Publ by IEEE

ER -