New channel segmentation model and associated routing algorithm for high performance FPGAs

In the model considered, a channel is partitioned into several regions and each region consists of tracks of equal length segments, but segment length is varied uniformly across the regions. Each region is allocated a certain number of tracks. The segments are arranged in a staggered fashion. In order to make optimum use of the model, a routing algorithm is developed. The key feature of the routing algorithm is the assignment of the nets to the appropriate tracks by delay computation and delay matching techniques. Experimental results show that the model and the algorithm improve the longest net delay by as much as 75.16% and the average net delay by 48.28% as compared to the conventional uniformly segmented model.<<ETX>>

[1]  Akihiro Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC.

[2]  Sinan Kaptanoglu,et al.  Segmented channel routing , 1991, DAC '90.

[3]  A. El Gamal,et al.  An architecture for electrically configurable gate arrays , 1988, Proceedings of the IEEE 1988 Custom Integrated Circuits Conference.

[4]  A. El Gamal,et al.  An architecture for electrically configurable gate arrays , 1989 .

[5]  R. Tsay.  Exact zero skew , 1991, ICCAD 1991.

[6]  Jonathan Rose,et al.  A detailed router for field-programmable gate arrays , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  R. H. Freeman,et al.  A 9000-gate user-programmable gate array , 1988, Proceedings of the IEEE 1988 Custom Integrated Circuits Conference.