An ilp-based routing algorithm for pin-constrained EWOD chips with obstacle avoidance

11Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Electrowetting-on-dielectric (EWOD) chips have become the most popular actuators, particularly for droplet-based digital microfluidic biochip (DMFB) systems. In order to enable the electrical manipulations, wire routing is a key problem in designing EWOD chips. Unlike traditional very-large-scale-integration (VLSI) routing problems, in addition to routing-path establishment on signal pins, the pin-constrained EWOD-chip routing problem must address the issue of signal sharing for pin-count reduction under a practical constraint posed by a limited pin-count supply. Moreover, EWOD-chip designs might incur several obstacles in the routing region due to embedded devices for specific fluidic protocols. However, no existing work considers the EWOD-chip routing with obstacles and, therefore, lots of manual design efforts are involved. To remedy this insufficiency, we propose in this paper the first routing algorithm for pin-constrained EWOD chips with obstacle avoidance. The proposed algorithm, based on effective integer-linear-programming (ILP) formulation as well as efficient routing framework, can achieve high routability with a low design complexity. Experimental results based on real-life chips with obstacles demonstrate the high routability of proposed algorithm for pin-constrained EWOD chips with obstacle avoidance. © 1982-2012 IEEE.

Cite

CITATION STYLE

APA

Chang, J. W., Yeh, S. H., Huang, T. W., & Ho, T. Y. (2013). An ilp-based routing algorithm for pin-constrained EWOD chips with obstacle avoidance. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 32(11), 1655–1667. https://doi.org/10.1109/TCAD.2013.2269767

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free