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 | |
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 |
Scopus Subject Areas
- General Engineering