2012 International Symposium on Electronic System Design (ISED) 2012
DOI: 10.1109/ised.2012.70
|View full text |Cite
|
Sign up to set email alerts
|

Low-Cost Dilution Engine for Sample Preparation in Digital Microfluidic Biochips

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
4
2
1

Relationship

5
2

Authors

Journals

citations
Cited by 11 publications
(12 citation statements)
references
References 7 publications
0
12
0
Order By: Relevance
“…A majority of them [Bhattacharjee et al 2012Chiang et al 2013;Dinh et al 2014;Griffith et al 2006;Huang et al 2012;Mitra et al 2014Mitra et al , 2012Ren et al 2003;Roy et al 2010Roy et al , 2011aRoy et al , 2014aRoy et al , 2014bRoy et al , 2014cThies et al 2008] deal with with the task of diluting a fluid to a certain CF by mixing it with a buffer. Note that the dilution process needs only two input fluids to prepare a target solution, and up to two mixers are sufficient to complete the task [Roy et al 2010;Thies et al 2008].…”
Section: Prior Work: Dilution and Mixing Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…A majority of them [Bhattacharjee et al 2012Chiang et al 2013;Dinh et al 2014;Griffith et al 2006;Huang et al 2012;Mitra et al 2014Mitra et al , 2012Ren et al 2003;Roy et al 2010Roy et al , 2011aRoy et al , 2014aRoy et al , 2014bRoy et al , 2014cThies et al 2008] deal with with the task of diluting a fluid to a certain CF by mixing it with a buffer. Note that the dilution process needs only two input fluids to prepare a target solution, and up to two mixers are sufficient to complete the task [Roy et al 2010;Thies et al 2008].…”
Section: Prior Work: Dilution and Mixing Algorithmsmentioning
confidence: 99%
“…that the mixing tree is a full binary tree, that is, every node has exactly two children (representing a 1 : 1 mix/split step), or no children (representing an input reactant, that is, a variable) [Aho et al 1974;Roy et al 2014b]. The root starts at level d. The partitioning of the tree into a left and a right subtree at a level , is obtained in such a way that the sum of the component ratios (or the coefficients of variables) in each child node becomes 2 −1 .…”
Section: Analysis Of Rmamentioning
confidence: 99%
“…In order to produce a dilution gradient of size 2 k+1 + 1, we need to supply 2 k droplets for each boundary CF (Lemma 2). Here, we demonstrate how a low-cost dilution engine [26] can be integrated on-chip for this purpose. We will illustrate the technique using the following example.…”
Section: Fig 4: Generation Of a Target Cf With Multiple Demandmentioning
confidence: 99%
“…5b. If boundary CFs other than 0% and 100% are needed, a dilution engine [26] can be used for generating them. We provide two dilution engines for generating the boundary CFs, which can be run in parallel to reduce sample preparation time.…”
Section: Architecturementioning
confidence: 99%
“…Traditionally, solution preparation was implemented using continuous-flow microfluidic chips [6][7][8]. Recently, several automated mixing/dilution schemes for solution preparation on a digital microfludic platform have also been reported [9][10][11][12][13][14][15]. Almost all previous work related to dilution with DMFs demonstrated various methods for obtaining a target droplet with the desired concentration when a sample and a neutral buffer solution are supplied.…”
Section: Introductionmentioning
confidence: 99%