Ms. Rachael LOrsa Profile

Rachael LOrsa

Graduate Student

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 12 May 2009 Paper

Detailed droplet routing and complexity characterization on a digital microfluidic biochip

Rachael L'Orsa, Biddut Bhattacharjee, Mina Hoorfar, Jonathan Holzman, Homayoun Najjaran

Proceedings Volume 7318, 73181I (2009) https://doi.org/10.1117/12.819356

KEYWORDS: Microfluidics, Electrodes, Detection and tracking algorithms, Computer simulations, Very large scale integration, Visualization, Silicon, Sensing systems, Medical research, Inspection

Read Abstract +

Digital microfluidic systems (DMFS) are poised to provide fully automated, high-throughput, dynamically reconfigurable sensing devices superior to those available today. Efficient droplet routing algorithms for these systems have not yet been established, though several solutions have been proposed. Such algorithms are ultimately required to generate droplet movement schedules and must be robust enough to handle the inevitable increases in problem complexity that will come as this technology matures. We have proposed a new solution based on a classic VLSI lineprobe algorithm to meet these demands for the detailed routing of droplets within a multi-stage algorithm. The most significant addition includes a sub-algorithm that calculates the routing complexity for any DMFS configuration based on the size, shape, number, type, and distribution of rectilinear obstacles throughout a DMFS biochip surface. By determining the complexity of the routing of each droplet, routing schedules may be prioritized, minimizing the number of fluidic and time constraint violations that affect high priority droplet routes. The complexity characterizations generated by our algorithm may also be used to create consistent, standardized benchmarks for the evaluation of existing droplet routing solutions. The efficiency of the proposed algorithm has been verified using the simulation presented in this paper.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years