By Topic

The complexity of segmented channel routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Li, W.N. ; Dept. of Comput. Sci., Arkansas Univ., Fayetteville, AR, USA

The segmented channel routing problem arises in the wiring and the physical design automation for Field Programmable Gate Arrays (FPGA's), a new type of electrically programmable VLSI. It may also be applicable to configurable multiprocessors. This new routing problem poses interesting algorithmic problems. In a previous paper by V. P. Roychowdhury et al. (see ibid., vol.12, no. 1, p. 79-95, 1993), the study of the complexity of segmented channel routing was reported. In this paper, we point out that the strong NP-completeness proof of segmented channel routing in that previous paper is incomplete and incorrect. We provide a correct proof which shows that the problem is indeed NP-complete in the strong sense and, therefore, that an exact polynomial time algorithm for the general case of the problem does not exist unless P=NP. Since our construction also holds for the case where connection lengths are bounded by a constant, we then settle an open question raised by Roychowdhury et al

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:14 ,  Issue: 4 )