On the FPGA board level routing problem

We study a two-terminal board level routing problem applicable to FPGA-based logic emulation systems. The problem was studied by W. Mak and D.F. Wong (see IEEE Trans. CAD, vol.16, no.3, 1997), where an algorithm of O(n/sup 2/) time was proposed, where n is the number of nets. We present a new and simple O(n)-time routing algorithm for solving the problem. A new precise I/O capacity constraint for routability is given by taking other criteria (e.g., the number of chips) into consideration.

[1]  Joseph Varghese,et al.  An efficient logic emulation system , 1993, IEEE Trans. Very Large Scale Integr. Syst..

[2]  Joseph Varghese,et al.  An efficient logic emulation system , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[3]  STEPHEN WALTERS,et al.  Computer-aided prototyping for ASIC-based systems , 1991, IEEE Design & Test of Computers.

[4]  Martin D. F. Wong,et al.  On optimal board-level routing for FPGA-based logic emulation , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..