Leakage-Aware FPGA Re-synthesis

Slides:



Advertisements
Similar presentations
This algorithm is used for dimension reduction. Input: a set of vectors {Xn є }, and dimension d,d
Advertisements

Address comments to FPGA Area Reduction by Multi-Output Sequential Resynthesis Yu Hu 1, Victor Shih 2, Rupak Majumdar 2 and Lei He 1 1.
Exploiting Symmetry in SAT-Based Boolean Matching for Heterogeneous FPGA Technology Mapping Yu Hu 1, Victor Shih 2, Rupak Majumdar 2 and Lei He 1 1 Electrical.
Figure 4.1. The function f (x1, x2, x3) =  m(0, 2, 4, 5, 6).
ECE 551 Digital System Design & Synthesis Lecture 08 The Synthesis Process Constraints and Design Rules High-Level Synthesis Options.
1/48 ENERGY OPTIMIZATION TECHNIQUES: FPGA GLITCH REDUCTION Patrick Cooke and Elizabeth Graham.
1 Boolean Satisfiability in Electronic Design Automation (EDA ) By Kunal P. Ganeshpure.
1 DAOmap: A Depth-optimal Area Optimization Mapping Algorithm for FPGA Designs Deming Chen, Jacon Cong ICCAD 2004 Presented by: Wei Chen.
Exploiting Symmetry in SAT-Based Boolean Matching for Heterogeneous FPGA Technology Mapping Yu Hu 1, Victor Shih 2, Rupak Majumdar 2 and Lei He 1 1 Electrical.
Address comments to Robust FPGA Resynthesis Based on Fault-Tolerant Boolean Matching Yu Hu 1, Zhe Feng 1, Lei He 1 and Rupak Majumdar 2.
An Efficient Chiplevel Time Slack Allocation Algorithm for Dual-Vdd FPGA Power Reduction Yan Lin 1, Yu Hu 1, Lei He 1 and Vijay Raghunathan 2 1 EE Department,
Yu Hu1, Satyaki Das2 Steve Trimberger2, and Lei He1
 Y. Hu, V. Shih, R. Majumdar and L. He, “Exploiting Symmetries to Speedup SAT-based Boolean Matching for Logic Synthesis of FPGAs”, TCAD  Y. Hu,
Reconfigurable Architectures. 2 Granularity of Reconfigurable Systems Granularity:  The abstraction level used to configure the device.  May use a −Boolean-level,
Integer Programming Difference from linear programming –Variables x i must take on integral values, not real values Lots of interesting problems can be.
A Probabilistic Method to Determine the Minimum Leakage Vector for Combinational Designs Kanupriya Gulati Nikhil Jayakumar Sunil P. Khatri Department of.
Library of Efficient Data types and Algorithms (LEDA)
June 10, Functionally Linear Decomposition and Synthesis of Logic Circuits for FPGAs Tomasz S. Czajkowski and Stephen D. Brown University of Toronto.
Digital Design Strategies and Techniques. Analog Building Blocks for Digital Primitives We implement logical devices with analog devices There is no magic.
Literature Review: A New Decomposition Algorithm for Threshold Synthesis and Generalization of Boolean Functions Paper by José L. Subirats, José M. Jerez,
LOPASS: A Low Power Architectural Synthesis for FPGAs with Interconnect Estimation and Optimization Harikrishnan K.C. University of Massachusetts Amherst.
EMIS 8373: Integer Programming NP-Complete Problems updated 21 April 2009.
February 23, Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March
FPGA PLB Evaluation using Quantified Boolean Satisfiability Andrew C. Ling M.A.Sc. Candidate University of Toronto Deshanand P. Singh Ph.D. Altera Corporation.
Background Motivation Implementation Conclusion 2.
EE 5900 Advanced Algorithms for Robust VLSI CAD, Spring 2009 Combinational Circuits.
Planning as Satisfiability (SAT-Plan). SAT-Plan Translate the planning problem into a satisfiability problem for length n of Plan garb 0 (proposition)present.
Optimality FPGA Technology Mapping: A Study of Optimality Andrew C. Ling M.A.Sc. Candidate University of Toronto Deshanand P. Singh Ph.D. Altera Corporation.
In-Place Decomposition for Robustness in FPGA Ju-Yueh Lee, Zhe Feng, and Lei He Electrical Engineering Dept., UCLA Presented by Ju-Yueh Lee Address comments.
Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.
Write a function rule for a graph EXAMPLE 3 Write a rule for the function represented by the graph. Identify the domain and the range of the function.
ENGG 340 Midterm Review. Introduced the Concept of Variables and Functions Introduced the Concept of AND, OR, and NOT Introduced the Concept of Truth.
IPR: In-Place Reconfiguration for FPGA Fault Tolerance Zhe Feng 1, Yu Hu 1, Lei He 1 and Rupak Majumdar 2 1 Electrical Engineering Department 2 Computer.
1 Boolean Satisfiability (SAT) Class Presentation By Girish Paladugu.
Saleem Sabbagh & Najeeb Darawshy Supervisors: Mony Orbach, Technion & Ilia Averbouch, IBM Started at: Winter 2012 Duration: Semester.
Strong Supervision From Weak Annotation Interactive Training of Deformable Part Models ICCV /05/23.
Encoders The inverse function of a decoder. Priority Encoder resolve the ambiguity of illegal inputs only one of the input is encoded D 3 has the highest.
Fault-Tolerant Resynthesis for Dual-Output LUTs Roy Lee 1, Yu Hu 1, Rupak Majumdar 2, Lei He 1 and Minming Li 3 1 Electrical Engineering Dept., UCLA 2.
Field Programmable Gate Arrays
Eng. Mai Z. Alyazji October, 2016
A New Logic Synthesis, ExorBDS
IPF: In-Place X-Filling to Mitigate Soft Errors in SRAM-based FPGAs
Robust FPGA Resynthesis Based on Fault-Tolerant Boolean Matching
Technology Mapping into General Programmable Cells
EI205 Lecture 5 Dianguang Ma Fall 2008.
Mapping into LUT Structures
From Silicon to Microelectronics Yahya Lakys EE & CE 200 Fall 2014
FPGAs in AWS and First Use Cases, Kees Vissers
Circuits & Boolean Expressions
SISTEM DIGITAL ALJABAR LOGIKA
Incremental Placement Algorithm for Field Programmable Gate Arrays
Versatile SAT-based Remapping for Standard Cells
Andrey Mokhov, Jordi Cortadella, Alessandro de Gennaro
إستراتيجيات ونماذج التقويم
SAT-Based Area Recovery in Technology Mapping
Alan Mishchenko University of California, Berkeley
Robert Brayton UC Berkeley
FPGA Logic Synthesis using Quantified Boolean Satisfiability
FPGA Glitch Power Analysis and Reduction
Research Progress Fall Present
Combinational Circuits
Off-path Leakage Power Aware Routing for SRAM-based FPGAs
Evaluating Boolean expressions
Canonical Computation without Canonical Data Structure
FIGURE 5-1 MOS Transistor, Symbols, and Switch Models
Illustrative Example p p Lookup Table for Digits of h g f e ) ( d c b
SAT-based Methods: Logic Synthesis and Technology Mapping
Eng. Ahmed M Bader El-Din October, 2018
Circuits & Boolean Expressions
Presentation transcript:

Leakage-Aware FPGA Re-synthesis Victor Shih, Zhe Feng EE 201C • UCLA Fall 2007

Motivation Our current FPGA re-synthesis framework optimizes area For LUT-4 element, leakage depends on: Configuration – 13.0% leakage difference between highest and lowest configurations Input vector – 4.7% leakage difference between highest and lowest input vectors

Leakage by Configuration 0000000000000000 0111011101110111 1111111111111111 0101010101010101

Problem Formulation Develop leakage model Consider configuration Consider structure (LUT2,LUT3,LUT4…) Consider input vector (future) Use leakage model to evaluate and guide re-synthesis solutions process

Algorithm Extension Initial Circuit Circuit Library re-synthesis window Truth-table SAT-Based Boolean Matcher Unsatisfiable Satisfiable Leakage Model