Research Roadmap Past – Present – Future Robert Brayton Alan Mishchenko Logic Synthesis and Verification Group UC Berkeley.

Slides:



Advertisements
Similar presentations
The Synthesis of Cyclic Circuits with SAT and Interpolation By John Backes and Marc Riedel ECE University of Minnesota.
Advertisements

ECE 667 Synthesis and Verification of Digital Systems
ECE Synthesis & Verification 1 ECE 667 Spring 2011 ECE 667 Spring 2011 Synthesis and Verification of Digital Circuits Introduction to Logic Synthesis.
ECE Synthesis & Verification - Lecture 8 1 ECE 697B (667) Spring 2006 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Circuits Introduction.
Combining Technology Mapping and Retiming EECS 290A Sequential Logic Synthesis and Verification.
Introduction to Logic Synthesis Alan Mishchenko UC Berkeley.
EE290A 1 Retiming of AND- INVERTER graphs with latches Juliet Holwill 290A Project 10 May 2005.
Reachability Analysis using AIGs (instead of BDDs?) 290N: The Unknown Component Problem Lecture 23.
Computation Engines: BDDs and SAT (part 2) 290N: The Unknown Component Problem Lecture 8.
1 FRAIGs: Functionally Reduced And-Inverter Graphs Adapted from the paper “FRAIGs: A Unifying Representation for Logic Synthesis and Verification”, by.
DAG-Aware AIG Rewriting Alan Mishchenko, Satrajit Chatterjee, Robert Brayton Department of EECS, University of California Berkeley Presented by Rozana.
 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,
Engineering Models and Circuit Realization of Quantum State Machines.
 2000 M. CiesielskiPTL Synthesis1 Synthesis for Pass Transistor Logic Maciej Ciesielski Dept. of Electrical & Computer Engineering University of Massachusetts,
Logic Synthesis Primer
03/08/2005 © J.-H. Jiang1 Retiming and Resynthesis EECS 290A – Spring 2005 UC Berkeley.
CAD Algorithms and Tools. Overview Introduction Multi-level logic synthesis SIS as a representative CAD tool Boolean networks Transformations of Boolean.
Electrical and Computer Engineering Archana Rengaraj ABC Logic Synthesis basics ECE 667 Synthesis and Verification of Digital Systems Spring 2011.
1 Alan Mishchenko UC Berkeley Implementation of Industrial FPGA Synthesis Flow Revisited.
05/04/06 1 Integrating Logic Synthesis, Tech mapping and Retiming Presented by Atchuthan Perinkulam Based on the above paper by A. Mishchenko et al, UCAL.
Combinational Problems: Unate Covering, Binate Covering, Graph Coloring and Maximum Cliques Example of application: Decomposition.
Combinational and Sequential Mapping with Priority Cuts Alan Mishchenko Sungmin Cho Satrajit Chatterjee Robert Brayton UC Berkeley.
ABC: A System for Sequential Synthesis and Verification BVSRC Berkeley Verification and Synthesis Research Center Robert Brayton, Niklas Een, Alan Mishchenko,
The Synergy between Logic Synthesis and Equivalence Checking R. Brayton UC Berkeley Thanks to SRC, NSF, California Micro Program and industrial sponsors,
ABC: A System for Sequential Synthesis and Verification
Logic Synthesis: Past and Future Alan Mishchenko UC Berkeley.
Cut-Based Inductive Invariant Computation Michael Case 1,2 Alan Mishchenko 1 Robert Brayton 1 Robert Brayton 1 1 UC Berkeley 2 IBM Systems and Technology.
Why consider ND-MV networks? Multi-Values: Multi-valued domains can be used to explore larger optimization spaces. Several interesting direct applications.
1 Stephen Jang Kevin Chung Xilinx Inc. Alan Mishchenko Robert Brayton UC Berkeley Power Optimization Toolbox for Logic Synthesis and Mapping.
Courtesy RK Brayton (UCB) and A Kuehlmann (Cadence) 1 Logic Synthesis Multi-Level Logic Synthesis.
ABC: A System for Sequential Synthesis and Verification BVSRC Berkeley Verification and Synthesis Research Center University of California, Berkeley Alan.
Reducing Structural Bias in Technology Mapping
Synthesis for Verification
Power Optimization Toolbox for Logic Synthesis and Mapping
Delay Optimization using SOP Balancing
Faster Logic Manipulation for Large Designs
Robert Brayton Alan Mishchenko Niklas Een
New Directions in the Development of ABC
Alan Mishchenko Robert Brayton UC Berkeley
Alan Mishchenko Satrajit Chatterjee Robert Brayton UC Berkeley
Logic Synthesis Primer
Introduction to Logic Synthesis with ABC
Magic An Industrial-Strength Logic Optimization, Technology Mapping, and Formal Verification System Alan Mishchenko UC Berkeley.
Logic Synthesis: Past, Present, and Future
Applying Logic Synthesis for Speeding Up SAT
Integrating an AIG Package, Simulator, and SAT Solver
A Boolean Paradigm in Multi-Valued Logic Synthesis
Synthesis for Verification
The Synergy between Logic Synthesis and Equivalence Checking
The Synergy between Logic Synthesis and Equivalence Checking
Alan Mishchenko University of California, Berkeley
SAT-Based Optimization with Don’t-Cares Revisited
Robert Brayton UC Berkeley
Scalable and Scalably-Verifiable Sequential Synthesis
Mapping into LUT Structures
Integrating Logic Synthesis, Technology Mapping, and Retiming
Integrating an AIG Package, Simulator, and SAT Solver
Introduction to Logic Synthesis
Recording Synthesis History for Sequential Verification
Logic Synthesis: Past, Present, and Future
Delay Optimization using SOP Balancing
Logic Synthesis: Past and Future
Reinventing The Wheel: Developing a New Standard-Cell Synthesis Flow
Magic An Industrial-Strength Logic Optimization, Technology Mapping, and Formal Verification System Alan Mishchenko UC Berkeley.
Innovative Sequential Synthesis and Verification
Robert Brayton Alan Mishchenko Niklas Een
Fast Min-Register Retiming Through Binary Max-Flow
Introduction to Logic Synthesis with ABC
Robert Brayton Alan Mishchenko Niklas Een
Integrating AIG Package, Simulator, and SAT Solver
Presentation transcript:

Research Roadmap Past – Present – Future Robert Brayton Alan Mishchenko Logic Synthesis and Verification Group UC Berkeley

2 Overview Past work Past work Espresso Espresso SIS SIS MVSIS MVSIS Current work Current work ABC ABC Future work Future work present 5 25 Time, years

3 Past 25 Years Various adaptations of these tools still used extensively in commercial CAD Various adaptations of these tools still used extensively in commercial CAD Espresso (two-level synthesis) Binary and multi-valued SOP minimization, pair-decoding, disjoint covers, etc MIS-II (multi-level synthesis) Factoring, extracting shared logic, elimination, resubstitution, simplification, etc SIS (sequential multi-level synthesis) Don’t-cares, retiming, state-encoding, tech-mapping, asynchronous, etc SOPs SOPs BDDs

4 Logic Synthesis is “Dead” (1991 – 2005) A. Richard Newton, “Has CAD for VLSI reached a dead end?” VLSI ’91 A. Richard Newton, “Has CAD for VLSI reached a dead end?” VLSI ’ K. Keutzer, A. R. Newton, N. Shenoy, “The future of logic synthesis and physical design in deep- submicron process geometries”. ISPD ’97 K. Keutzer, A. R. Newton, N. Shenoy, “The future of logic synthesis and physical design in deep- submicron process geometries”. ISPD ’ R. Madhavan, “The death of logic synthesis”, Keynote at ISPD ’05 R. Madhavan, “The death of logic synthesis”, Keynote at ISPD ’05

5 Revival in Past 7 Years ABC AIG rewriting, priority cuts, resynthesis, sequential synthesis and verification, etc now SOPs, BDDs, ZDDs AIGs, BDDs AIGs, truth tables, SAT MVSIS Multi-valued network optimization, encoding, non-determinism, FSM synthesis, etc And-Inv Graphs (AIGs), tech-mapping, don’t- cares, equivalence checking, etc

6 ABC Highlights “Rewriting the book of logic synthesis” “Rewriting the book of logic synthesis” almost all classical methods have been replaced by fast heuristic iterative transforms almost all classical methods have been replaced by fast heuristic iterative transforms Based on methods that are Based on methods that are high speed high speed scalable scalable SAT-based SAT-based Becoming a new standard of reference for Becoming a new standard of reference for logic synthesis logic synthesis verification verification

7 Example of Emerging Logic Synthesis Equivalent AIG in ABC a b cdfe x yz Boolean network in SIS a b cd e xy f z AIG is a Boolean network of 2-input AND nodes and invertors (dotted lines)

8 One AIG Node – Many Cuts Combinational AIG a b cd f e Each node in an AIG has many cuts Each cut represents a different SIS node No a priori fixed boundaries Implies that AIG manipulation with cuts is equivalent to working on many Boolean networks at the same time Different cuts for the same node

9 Current Work (2007) ABC-5 Efficient combinational logic synthesis Fast, scalable, good quality Technology mapping with structural choices Cut-based, heuristic, good area/delay, flexible Sequential synthesis Innovative, efficient, scalable, verifiable Sequential verification Robust, integrated, interacts with synthesis

10 Next 5 Years ( ) Integrating synthesis/ mapping/retiming Larger space of solutions, improved quality ABC-8 Co-developing synthesis and verification Wider use of sequential transforms, improved quality Integrating synthesis with place and route Moving towards all-in-one solutions Improving AIG-based synthesis and mapping Faster, more scalable, better quality Creating configurable design flows Easy customization based on goals and resources Supporting emerging technologies Flexible solutions for the XXI century

11 Next 25 Years Is logic synthesis finally dead? Is logic synthesis finally dead? NO! NO! Alive and well and living in Berkeley? Alive and well and living in Berkeley? It is a fundamental issue It is a fundamental issue Difficult problems will force new solutions Difficult problems will force new solutions