On channel segmentation design for row-based FPGAs

Kai Zhu; D. F. Wong

doi:10.1109/iccad.1992.279403

On channel segmentation design for row-based FPGAs

Kai Zhu
, D. F. Wong

Office of the Provost

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-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 language	English
Title of host publication	1992 IEEE/ACM International Conference on Computer-Aided Design
Publisher	IEEE
Pages	26-29
Number of pages	4
ISBN (Print)	0818630108, 9780818630101
DOIs	https://doi.org/10.1109/iccad.1992.279403
Publication status	Published - Nov 1992
Event	IEEE/ACM International Conference on Computer-Aided Design - ICCAD '92 - Santa Clara, United States Duration: 8 Nov 1992 → 12 Nov 1992 https://ieeexplore.ieee.org/xpl/conhome/894/proceeding

Publication series

Name	IEEE/ACM International Conference on Computer-Aided Design

Conference

Conference	IEEE/ACM International Conference on Computer-Aided Design - ICCAD '92
Country/Territory	United States
City	Santa Clara
Period	8/11/92 → 12/11/92
Internet address	https://ieeexplore.ieee.org/xpl/conhome/894/proceeding

Access to Document

10.1109/iccad.1992.279403

Cite this

@inproceedings{f6aac231c77e44999a4ff17017ee69c1,

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.\}",

note = "This work was partially supported by the National Science Foundation under grant MIP-8909586 and by an IBM Faculty Development Award.; IEEE/ACM International Conference on Computer-Aided Design - ICCAD '92 ; Conference date: 08-11-1992 Through 12-11-1992",

year = "1992",

month = nov,

doi = "10.1109/iccad.1992.279403",

language = "English",

isbn = "0818630108",

series = "IEEE/ACM International Conference on Computer-Aided Design",

publisher = "IEEE",

pages = "26--29",

booktitle = "1992 IEEE/ACM International Conference on Computer-Aided Design",

address = "United States",

url = "https://ieeexplore.ieee.org/xpl/conhome/894/proceeding",

}

Zhu, K & Wong, DF 1992, On channel segmentation design for row-based FPGAs. in 1992 IEEE/ACM International Conference on Computer-Aided Design. IEEE/ACM International Conference on Computer-Aided Design, IEEE, pp. 26-29, IEEE/ACM International Conference on Computer-Aided Design - ICCAD '92, Santa Clara, California, United States, 8/11/92. https://doi.org/10.1109/iccad.1992.279403

TY - GEN

T1 - On channel segmentation design for row-based FPGAs

AU - Zhu, Kai

AU - Wong, D. F.

N1 - This work was partially supported by the National Science Foundation under grant MIP-8909586 and by an IBM Faculty Development Award.

PY - 1992/11

Y1 - 1992/11

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 - https://www.scopus.com/pages/publications/0026998803

U2 - 10.1109/iccad.1992.279403

DO - 10.1109/iccad.1992.279403

M3 - Conference proceeding

AN - SCOPUS:0026998803

SN - 0818630108

SN - 9780818630101

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

SP - 26

EP - 29

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

PB - IEEE

T2 - IEEE/ACM International Conference on Computer-Aided Design - ICCAD '92

Y2 - 8 November 1992 through 12 November 1992

ER -

On channel segmentation design for row-based FPGAs

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this