@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",
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",
note = "IEEE/ACM International Conference on Computer-Aided Design - ICCAD '92 ; Conference date: 08-11-1992 Through 12-11-1992",
}