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 (US) |
|---|---|
| Title of host publication | IEEE/ACM International Conference on Computer-Aided Design |
| Publisher | Publ by IEEE |
| Pages | 26-29 |
| Number of pages | 4 |
| ISBN (Print) | 0818630108 |
| State | Published - Dec 1 1992 |
| Externally published | Yes |
| Event | IEEE/ACM International Conference on Computer-Aided Design - ICCAD '92 - Santa Clara, CA, USA Duration: Nov 8 1992 → Nov 12 1992 |
Publication series
| Name | IEEE/ACM International Conference on Computer-Aided Design |
|---|
Other
| Other | IEEE/ACM International Conference on Computer-Aided Design - ICCAD '92 |
|---|---|
| City | Santa Clara, CA, USA |
| Period | 11/8/92 → 11/12/92 |
Fingerprint
ASJC Scopus subject areas
- Engineering(all)
Cite this
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 proceeding › Conference contribution
}
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 -