An outlook on design technologies for future integrated systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Proceedings of the 47th Design Automation Conference
A contamination aware droplet routing algorithm for the synthesis of digital microfluidic biochips
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Optimization of dilution and mixing of biochemical samples using digital microfluidic biochips
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Digital microfluidic biochips: recent research and emerging challenges
CODES+ISSS '11 Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Digital microfluidic biochips: a vision for functional diversity and more than Moore
Proceedings of the International Conference on Computer-Aided Design
A high-performance online assay interpreter for digital microfluidic biochips
Proceedings of the great lakes symposium on VLSI
Fast online synthesis of generally programmable digital microfluidic biochips
Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
A field-programmable pin-constrained digital microfluidic biochip
Proceedings of the 50th Annual Design Automation Conference
| Hi-index | 0.03 |
Due to recent advances in microfluidics, digital microfluidic biochips are expected to revolutionize laboratory procedures. One critical problem for biochip synthesis is the droplet routing problem. Unlike traditional very large scale integration routing problems, in addition to routing path selection, the biochip routing problem needs to address the issue of scheduling droplets under practical constraints imposed by the fluidic property and timing restriction of synthesis results. In this paper, we present the first network-flow-based routing algorithm that can concurrently route a set of noninterfering nets for the droplet routing problem on biochips. We adopt a two-stage technique of global routing followed by detailed routing. In global routing, we first identify a set of noninterfering nets and then adopt the network-flow approach to generate optimal global-routing paths for nets. In detailed routing, we present the first polynomial-time algorithm for simultaneous routing and scheduling using the global-routing paths with a negotiation-based routing scheme. Our algorithm targets at both the minimization of cells used for routing for better fault tolerance and minimization of droplet transportation time for better reliability and faster bioassay execution. Experimental results show the robustness and efficiency of our algorithm.