SVM-Based Routability-Driven Chip-Level Design for Voltage-Aware Pin-Constraint EWOD Chips Qin Wang 1, Weiran He, Hailong Yao 1, Tsung-Yi Ho 2, Yici Cai.

Slides:



Advertisements
Similar presentations
Optimal Bus Sequencing for Escape Routing in Dense PCBs H.Kong, T.Yan, M.D.F.Wong and M.M.Ozdal Department of ECE, University of Illinois at U-C ICCAD.
Advertisements

A Field-Programmable Pin-Constrained Digital Microfluidic Biochip Dan Grissom and Philip Brisk University of California, Riverside Design Automation Conference.
A Graph-Partitioning-Based Approach for Multi-Layer Constrained Via Minimization Yih-Chih Chou and Youn-Long Lin Department of Computer Science, Tsing.
NCKU CSIE EDALAB Shang-Tsung Yu, Sheng-Han Yeh, and Tsung-Yi Ho Electronic Design Automation Laboratory.
Pattern Recognition and Machine Learning
Support Vector Machines
Shuai Li and Cheng-Kok Koh School of Electrical and Computer Engineering, Purdue University West Lafayette, IN, Mixed Integer Programming Models.
Optimal Testing of Digital Microfluidic Biochips: A Multiple Traveling Salesman Problem R. Garfinkel 1, I.I. Măndoiu 2, B. Paşaniuc 2 and A. Zelikovsky.
Coupling-Aware Length-Ratio- Matching Routing for Capacitor Arrays in Analog Integrated Circuits Kuan-Hsien Ho, Hung-Chih Ou, Yao-Wen Chang and Hui-Fang.
Discriminative, Unsupervised, Convex Learning Dale Schuurmans Department of Computing Science University of Alberta MITACS Workshop, August 26, 2005.
Efficient Escape Routing Rui Shi, Chung-Kuan Cheng University of California, San Diego.
Droplet-Aware Module-Based Synthesis for Fault-Tolerant Digital Microfluidic Biochips Elena Maftei, Paul Pop, and Jan Madsen Technical University of Denmark.
Context-aware Query Suggestion by Mining Click-through and Session Data Authors: H. Cao et.al KDD 08 Presented by Shize Su 1.
Layer Assignment Algorithm for RLC Crosstalk Minimization Bin Liu, Yici Cai, Qiang Zhou, Xianlong Hong Tsinghua University.
Reduced Support Vector Machine
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 19: April 9, 2008 Routing 1.
Sample-Separation-Margin Based Minimum Classification Error Training of Pattern Classifiers with Quadratic Discriminant Functions Yongqiang Wang 1,2, Qiang.
Bioinformatics Challenge  Learning in very high dimensions with very few samples  Acute leukemia dataset: 7129 # of gene vs. 72 samples  Colon cancer.
Microarray analysis 2 Golan Yona. 2) Analysis of co-expression Search for similarly expressed genes experiment1 experiment2 experiment3 ……….. Gene i:
Metal Layer Planning for Silicon Interposers with Consideration of Routability and Manufacturing Cost W. Liu, T. Chien and T. Wang Department of CS, NTHU,
Tabu Search-Based Synthesis of Dynamically Reconfigurable Digital Microfluidic Biochips Elena Maftei, Paul Pop, Jan Madsen Technical University of Denmark.
Introduction to Routing. The Routing Problem Apply after placement Input: –Netlist –Timing budget for, typically, critical nets –Locations of blocks and.
Soft Margin Estimation for Speech Recognition Main Reference: Jinyu Li, " SOFT MARGIN ESTIMATION FOR AUTOMATIC SPEECH RECOGNITION," PhD thesis, Georgia.
Area-I/O Flip-Chip Routing for Chip-Package Co-Design Progress Report 方家偉、張耀文、何冠賢 The Electronic Design Automation Laboratory Graduate Institute of Electronics.
Escape Routing For Dense Pin Clusters In Integrated Circuits Mustafa Ozdal, Design Automation Conference, 2007 Mustafa Ozdal, IEEE Trans. on CAD, 2009.
NCKU CSIE EDALAB Department of Computer Science and Information Engineering National Cheng Kung University Tainan, Taiwan Tsung-Wei.
A Simple Method to Extract Fuzzy Rules by Measure of Fuzziness Jieh-Ren Chang Nai-Jian Wang.
A Field-Programmable Pin-Constrained Digital Microfluidic Biochip Dan Grissom and Philip Brisk University of California, Riverside Design Automation Conference.
Global Routing.
Pattern Selection based co-design of Floorplan and Power/Ground Network with Wiring Resource Optimization L. Li, Y. Ma, N. Xu, Y. Wang and X. Hong WuHan.
1 Coupling Aware Timing Optimization and Antenna Avoidance in Layer Assignment Di Wu, Jiang Hu and Rabi Mahapatra Texas A&M University.
1 Global Routing Method for 2-Layer Ball Grid Array Packages Yukiko Kubo*, Atsushi Takahashi** * The University of Kitakyushu ** Tokyo Institute of Technology.
A Power Grid Analysis and Verification Tool Based on a Statistical Prediction Engine M.K. Tsiampas, D. Bountas, P. Merakos, N.E. Evmorfopoulos, S. Bantas.
Jason Cong‡†, Guojie Luo*†, Kalliopi Tsota‡, and Bingjun Xiao‡ ‡Computer Science Department, University of California, Los Angeles, USA *School of Electrical.
Ping-Hung Yuh, Chia-Lin Yang, and Yao-Wen Chang
An Introduction to Support Vector Machines (M. Law)
Using Support Vector Machines to Enhance the Performance of Bayesian Face Recognition IEEE Transaction on Information Forensics and Security Zhifeng Li,
ARCHER:A HISTORY-DRIVEN GLOBAL ROUTING ALGORITHM Muhammet Mustafa Ozdal, Martin D. F. Wong ICCAD ’ 07.
ILP-Based Pin-Count Aware Design Methodology for Microfluidic Biochips Chiung-Yu Lin and Yao-Wen Chang Department of EE, NTU DAC 2009.
Today Ensemble Methods. Recap of the course. Classifier Fusion
Exact routing for digital microfluidic biochips with temporary blockages OLIVER KESZOCZE ROBERT WILLE ROLF DRECHSLER ICCAD’14.
1. Placement of Digital Microfluidic Biochips Using the T-tree Formulation Ping-Hung Yuh 1, Chia-Lin Yang 1, and Yao-Wen Chang 2 1 Dept. of Computer Science.
A SAT-Based Routing Algorithm for Cross-Referencing Biochips Ping-Hung Yuh 1, Cliff Chiung-Yu Lin 2, Tsung- Wei Huang 3, Tsung-Yi Ho 3, Chia-Lin Yang 4,
A Negotiated Congestion based Router for Simultaneous Escape Routing Q.Ma, T.Yan and Martin D.F. Wong Department of Electrical and Computer Engineering.
Johnathan Fiske, *Dan Grissom, Philip Brisk
Escape Routing of Mixed-Pattern Signals Based on Staggered-Pin- Array PCBs K. Wang, H. Wang and S. Dong Department of Computer Science & Technology, Tsinghua.
CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 13: February 20, 2002 Routing 1.
Reliability-Oriented Broadcast Electrode- Addressing for Pin-Constrained Digital Microfluidic Biochips Department of Computer Science and Information Engineering.
Fast Online Synthesis of Generally Programmable Digital Microfluidic Biochips Dan Grissom and Philip Brisk University of California, Riverside CODES+ISSS.
NCKU CSIE EDALAB Tsung-Wei Huang and Tsung-Yi Ho Department of Computer Science and Information Engineering National Cheng.
BOB-Router: A New Buffering-Aware Global Router with Over-the-Block Routing Resources Yilin Zhang1, Salim Chowdhury2 and David Z. Pan1 1 Department of.
LEMAR: A Novel Length Matching Routing Algorithm for Analog and Mixed Signal Circuits H. Yao, Y. Cai and Q. Gao EDA Lab, Department of CS, Tsinghua University,
Object Recognition as Ranking Holistic Figure-Ground Hypotheses Fuxin Li and Joao Carreira and Cristian Sminchisescu 1.
CISC Machine Learning for Solving Systems Problems Presented by: Eunjung Park Dept of Computer & Information Sciences University of Delaware Solutions.
Synthesis of Digital Microfluidic Biochips with Reconfigurable Operation Execution Elena Maftei Technical University of Denmark DTU Informatics
Lecture 14. Outline Support Vector Machine 1. Overview of SVM 2. Problem setting of linear separators 3. Soft Margin Method 4. Lagrange Multiplier Method.
A Novel Timing-Driven Global Routing Algorithm Considering Coupling Effects for High Performance Circuit Design Jingyu Xu, Xianlong Hong, Tong Jing, Yici.
Instance Discovery and Schema Matching With Applications to Biological Deep Web Data Integration Tantan Liu, Fan Wang, Gagan Agrawal {liut, wangfa,
Incremental Reduced Support Vector Machines Yuh-Jye Lee, Hung-Yi Lo and Su-Yun Huang National Taiwan University of Science and Technology and Institute.
Next, this study employed SVM to classify the emotion label for each EEG segment. The basic idea is to project input data onto a higher dimensional feature.
Routing-Based Synthesis of Digital Microfluidic Biochips Elena Maftei, Paul Pop, Jan Madsen Technical University of Denmark CASES’101Routing-Based Synthesis.
Dept. of Electronics Engineering & Institute of Electronics National Chiao Tung University Hsinchu, Taiwan ISPD’16 Generating Routing-Driven Power Distribution.
Finding Clusters within a Class to Improve Classification Accuracy Literature Survey Yong Jae Lee 3/6/08.
1 Double-Patterning Aware DSA Template Guided Cut Redistribution for Advanced 1-D Gridded Designs Zhi-Wen Lin and Yao-Wen Chang National Taiwan University.
The Chinese University of Hong Kong Learning Larger Margin Machine Locally and Globally Dept. of Computer Science and Engineering The Chinese University.
RTL Design Flow RTL Synthesis HDL netlist logic optimization netlist Library/ module generators physical design layout manual design a b s q 0 1 d clk.
High resolution product by SVM. L’Aquila experience and prospects for the validation site R. Anniballe DIET- Sapienza University of Rome.
Elena Maftei Technical University of Denmark DTU Informatics
Jin-Yih Li Yih-Lang Li Computer & Information TSMC Science Department,
Under a Concurrent and Hierarchical Scheme
Presentation transcript:

SVM-Based Routability-Driven Chip-Level Design for Voltage-Aware Pin-Constraint EWOD Chips Qin Wang 1, Weiran He, Hailong Yao 1, Tsung-Yi Ho 2, Yici Cai 1 1.Tsinghua University 2.National Chiao Tung University

Outline  Background  Problem Formulation  Contributions  Overall Design Flow  SVM-Based Electrode Clustering  Experimental Results  Summary 2

 DMFB is one of the many different types of biochips  Based on electrowetting-on-dielectric (EWOD) technology  Control the movement of the droplet  Advantages of DMFB  Reduces sample/reagent consumption  Reduces total analysis time  Dynamically reconfigurable for different types of sequential experiments  As the size of DMFB becomes larger, CAD methods are becoming necessary Digital Microfluidic Biochips (DMFB) 3

 2D array of electrodes for controlling the droplet movement  Top view of 2D electrode array View of the EWOD Chips Courtesy of K. Chakrabarty and F. Su [1] [1] K. Chakrabarty and F. Su, “Digital Microfluidic Biochips”, CRC Press,

Co-Design of EWOD Chips 5

 Direct Addressing & Broadcast addressing Addressing Schemes 6 Conduction wires Electrodes Via Control pins Electrodes that share the same control pin (a)Direct Addressing Control pins: 16 (b) Broadcast addressing Control pins: 10

Broadcast Addressing Scheme Droplet Spacing High voltage to generate an electrical field 0010XXX time X0010XX XX0010X XXX0010 XXXX001 Pin of electrode Wire External control pins Actuation sequence 00XXX00XXX 00XXX00XXX pins -> 4 pins Broadcast addressing Electrode 7

Regular CAD Flow of DMFBs 8 [2] T.-Y. Ho, K. Chakrabarty, and P. Pop, “Digital Microfluidic Biochips: Recent Research and Emerging Challenges,” Proc. of CODES+ISSS, 2011.

Routing Failed Problem 9 [3] ACER: An Agglomerative Clustering Based Electrode Addressing and Routing Algorithm for Pin-Constrained EWOD Chips,” IEEE Trans. on CAD Actuation Sequence Compatible Graph Electrode Addressing Cluster Routing & Escape Routing Routing Failed

Trapped Charge Problem 10

Outline  Background  Problem Formulation  Contributions  Overall Design Flow  SVM-Based Electrode Clustering  Experimental Results  Summary 11

 Given  A set of electrodes, the actuation sequences, the preferred voltage values, a threshold voltage value, the maximum number of allowed control pins, and the control layer design rules.  Constraint  Control pin constraint  Routing constraint  Broadcast-addressing constraint  Voltage constraint  Objective  Find a feasible routing solution from all of the electrodes to the control pins with minimized total routing cost. Problem Formulation 12

Outline  Background  Problem Formulation  Contributions  Overall Design Flow  SVM-Based Electrode Clustering  Experimental Results  Summary 13

 The first SVM-based electrode addressing methods  Improve the routability  Improve the reliability induced by the trapped charge problem  Feature Extraction  General Features  Context Features  Cluster Features  Effective ripup and rerouting methods are adopted Contributions 14 Machine Learning Prediction Model Physical Design

Outline  Background  Contributions  Problem Formulation  Overall Design Flow  SVM-Based Electrode Clustering  Experimental Results  Summary 15

Overall Design Flow of Our Approach 16

Outline  Background  Contributions  Problem Formulation  Overall Design Flow  SVM-Based Electrode Clustering  Experimental Results  Summary 17

Support Vector Machine(SVM) 18  SVM is related to statistical learning theory  Solving classification problem  Key area in machine learning  Maximal margin

Training Flow of SVM-Based Clustering 19

 The major concern of supervised learning  Having a great influence on experimental results  Features of electrode addressing  General Features  Context Features  Cluster Features Feature Extraction 20 Harra feature in graphics

 Describe a electrode addressing solution in a global view  Number of clusters  Total area of bounding boxes  Number of clusters with a single electrode  Total area of bounding box overlap  Normalization  Area of the chip  Number of electrodes General Features 21

 Routing resource information  Congestion information Context Features 22 Computing the bounding box for each cluster Dividing the whole chip into four quadrants Each quadrant collects information separately Bounding box area Overlap information Proportion of overlap area

Cluster Features 23

Electrode Addressing Solution Evaluation 24

Testing Flow of SVM-Based Clustering 25 Training Flow

Outline  Background  Contributions  Problem Formulation  Overall Design Flow  SVM-Based Electrode Clustering  Experimental Results  Summary 26

Testcases 27 BenchmarkWidthHeightArea#EVoltage(v) amino-acid amino-acid protein protein dilution multiplex random random random random random random random Width: the width of the chip Height: the height of the chip Area: the routing area considering the routing grids between adjacent electrodes #E: the number of electrodes Voltage: the threshold voltage for trapped charge issue

 ACER S.S.-Y.Liu,C.-H.Chang,H.-M.Chen,andT.-Y.Ho,“ACER:An Agglomerative Clustering BasedElectrode Addressing and Routing Algorithm forPin- Constrained EWOD Chips,” IEEE Trans. on CAD, vol. 33, no. 9, pp ,  SVM1 General Features Context Features Cluster Features  SVM2 General Features Context Features Experimental Results 28

Routing Completion Rate Without Ripup & Rerouting ACER47.32%SVM256.33% SVM156.41%SVM261.16% 29

Final Routing Completion Rate After Ripup & Rerouting  SVM1 and SVM2 are both 100%  For some cases, ACER is not 100% ACER95.21%SVM1100%SVM2100% 30

Number of Ripup & Rerouting Iterations ACER25SVM29 SVM29SVM19 31

Number of Used Control Pins ACER51SVM248 SVM247SVM146 32

Total Wire Length ACER3304SVM23032 SVM23043SVM

Running Time ACER232.21sSVM s SVM sSVM s 34

Trapped Charge  SVM1 and SVM2 are similar ACER19vSVM215v 35

Outline  Background  Contributions  Problem Formulation  Overall Design Flow  SVM-Based Electrode Clustering  Experimental Results  Summary 36

 The first SVM-based chip-level design flow  The routability and reliability are both improved  Real-life biochemical applications validate the presented method effectiveness Summary 37