4/11/2005 Applied Logic & Computation for System Design - An introductory invitation Jie-Hong R. Jiang 江介宏 National Taiwan University.

Slides:



Advertisements
Similar presentations
Copyright 2000 Cadence Design Systems. Permission is granted to reproduce without modification. Introduction An overview of formal methods for hardware.
Advertisements

S4 S4 System Synthesis and Supervision, Scenarios Benoît Caillaud 20 March 2012.
TOPIC : SYNTHESIS DESIGN FLOW Module 4.3 Verilog Synthesis.
EECE **** Embedded System Design
ECOE 560 Design Methodologies and Tools for Software/Hardware Systems Spring 2004 Serdar Taşıran.
ECE Synthesis & Verification 1 ECE 667 Synthesis and Verification of Digital Systems Formal Verification Combinational Equivalence Checking.
AI 授課教師:顏士淨 2013/09/12 1. Part I & Part II 2  Part I Artificial Intelligence 1 Introduction 2 Intelligent Agents Part II Problem Solving 3 Solving Problems.
CSE241 Formal Verification.1Cichy, UCSD ©2003 CSE241A VLSI Digital Circuits Winter 2003 Recitation 6: Formal Verification.
The Design Process Outline Goal Reading Design Domain Design Flow
A Transformation Based Algorithm for Reversible Logic Synthesis D. Michael Miller Dmitri Maslov Gerhard W. Dueck Design Automation Conference, 2003.
1 HW/SW Partitioning Embedded Systems Design. 2 Hardware/Software Codesign “Exploration of the system design space formed by combinations of hardware.
ECE Synthesis & Verification1 ECE 667 Spring 2011 Synthesis and Verification of Digital Systems Verification Introduction.
Analysis of Algorithms CS 477/677
1 FRAIGs: Functionally Reduced And-Inverter Graphs Adapted from the paper “FRAIGs: A Unifying Representation for Logic Synthesis and Verification”, by.
ECE Synthesis & Verification - L211 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Systems Verification Equivalence checking.
Logic Design Outline –Logic Design –Schematic Capture –Logic Simulation –Logic Synthesis –Technology Mapping –Logic Verification Goal –Understand logic.
A Brief Introduction To The Theory of Computer Science and The PCP Theorem By Dana Moshkovitz Faculty of Mathematics and Computer Science The Weizmann.
Chapter 3 Combinational Logic Design
/faculteit technologie management 1 Process Mining: Extension Mining Algorithms Ana Karla Alves de Medeiros Ana Karla Alves de Medeiros Eindhoven University.
Debasis Sadhukhan M.Sc. Physics, IIT Bombay. 1. Basics of Quantum Computation. 2. Quantum Circuits 3. Quantum Fourier Transform and it’s applications.
Design methodology.
Alec Stanculescu, Fintronic USA Alex Zamfirescu, ASC MAPLD 2004 September 8-10, Design Verification Method for.
Engineering Design Process
CMPS 3223 Theory of Computation Automata, Computability, & Complexity by Elaine Rich ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Slides provided.
COE4OI5 Engineering Design. Copyright S. Shirani 2 Course Outline Design process, design of digital hardware Programmable logic technology Altera’s UP2.
Shashi Kumar 1 Logic Synthesis: Course Introduction Shashi Kumar Embedded System Group Department of Electronics and Computer Engineering Jönköping Univ.
CAD Techniques for IP-Based and System-On-Chip Designs Allen C.-H. Wu Department of Computer Science Tsing Hua University Hsinchu, Taiwan, R.O.C {
Complexity Classes (Ch. 34) The class P: class of problems that can be solved in time that is polynomial in the size of the input, n. if input size is.
Korea Advanced Institute of Science and Technology, Dept. of EECS, Div. of CS, Information Systems Lab. 1/10 CS204 Course Overview Prof.
Framework for the Development and Testing of Dependable and Safety-Critical Systems IKTA 065/ Supported by the Information and Communication.
ENG 1181 College of Engineering Engineering Education Innovation Center P. 1 1 Computer Problem Solving in MATLAB Topics Covered: 1.Problem Solving 2.Top-Down.
FORMAL VERIFICATION OF ADVANCED SYNTHESIS OPTIMIZATIONS Anant Kumar Jain Pradish Mathews Mike Mahar.
ELEC692/04 course_des 1 ELEC 692 Special Topic VLSI Signal Processing Architecture Fall 2004 Chi-ying Tsui Department of Electrical and Electronic Engineering.
Major objective of this course is: Design and analysis of modern algorithms Different variants Accuracy Efficiency Comparing efficiencies Motivation thinking.
MathCheck: A Math Assistant Combining SAT with Computer Algebra Systems Ed Zulkoski, Vijay Ganesh, Krzysztof Czarnecki University of Waterloo August 7,
CSCI 3160 Design and Analysis of Algorithms Tutorial 10 Chengyu Lin.
Modeling Mobile-Agent-based Collaborative Processing in Sensor Networks Using Generalized Stochastic Petri Nets Hongtao Du, Hairong Qi, Gregory Peterson.
Computer Hardware Engineers
Panel Discussion High Level Design and ESL: Who Cares? Masahiro Fujita VLSI Design and Education Center (VDEC) University of Tokyo.
1 Copyright  2001 Pao-Ann Hsiung SW HW Module Outline l Introduction l Unified HW/SW Representations l HW/SW Partitioning Techniques l Integrated HW/SW.
Operations Research The OR Process. What is OR? It is a Process It assists Decision Makers It has a set of Tools It is applicable in many Situations.
Technology Mapping. 2 Technology mapping is the phase of logic synthesis when gates are selected from a technology library to implement the circuit. Technology.
Introduction to Operations Research. MATH Mathematical Modeling 2 Introduction to Operations Research Operations research/management science –Winston:
2009/2/10NTUEE Research Projects1 Applied Logic & Computation in System Design - A Research Invitation Jie-Hong R. Jiang 江介宏 NTUEE/GIEE National Taiwan.
Quantum Programming Languages By Steve Franchak. What are QPL’s? A set of programming languages that use high- level constructs to express quantum algorithms.
1 Prof. Dr. Nizamettin AYDIN
Combinational Logic Design. 2 Combinational Circuits A combinational logic circuit has: ♦ A set of m Boolean inputs, ♦ A set of n Boolean outputs ♦ n.
Operations Research Models and Methods Advanced Operations Research Reference: Operations Research Models and Methods, Operations Research Models and Methods,
Equivalence checking Prof Shobha Vasudevan ECE 598SV.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Presented By Anna Fariha Roll : SN – 213 MS, 1 st Semester Session: Boolean Matching.
EMT 351/4 DIGITAL IC DESIGN Week # 1 EDA & HDL.
Sub-fields of computer science. Sub-fields of computer science.
P & NP.
Electrical Engineering
Abstraction and Refinement for Large Scale Model Checking
PRE-AP computer science 1
The Analysis of Cyclic Circuits with Boolean Satisfiability
CSCI-100 Introduction to Computing
Big Ideas in Computer Science
James D. Z. Ma Department of Electrical and Computer Engineering
Introduction to Formal Verification
Objective of This Course
STUDY AND IMPLEMENTATION
ECE-C662 Introduction to Behavioral Synthesis Knapp Text Ch
3rd Lecture: QMA & The local Hamiltonian problem (CNT’D)
CS 583 Fall 2006 Analysis of Algorithms
Quantum Computation and Information Chap 1 Intro and Overview: p 28-58
Jie-Hong R. Jiang 江介宏 DEE/GIEE National Taiwan University
Our old list of problems
Presentation transcript:

4/11/2005 Applied Logic & Computation for System Design - An introductory invitation Jie-Hong R. Jiang 江介宏 National Taiwan University

Science & engineering System design is both a scientific and an engineering task Science Discovering hidden truths of natural/artificial systems (in theory) Engineering Searching effective solutions to optimization problems (in practice)

Interdisciplinary study System design maps computation tasks to physical systems Computer science Automata and logic Algorithms and complexity Electrical engineering Circuits and systems Control and communication Physics

Logic? Reason! Logic is the foundation of math Math is the foundation of science Logic is the foundation of science Aristotle ( B.C.)

Applied logic? Reason the correctness of the constructed systems Demonstrating the absence or existence of some properties in a design A silly bug (big bang - present)

Computation? Logic in action! Charles Babbage ( )

Applied Computation? Analyze, optimize, and verify the designed systems

System modeling Models of computation Classical systems FSMs, timed/hybrid automata, Petri nets, dataflow process network, etc. Quantum systems Hamiltonian formulation of quantum computation − Perturbation theory and quantum search

System synthesis Closing the gap between synthesis and verification Certificate synthesis tools Breaking the infinite loop between synthesis and physical design Design closure Design in uncertainty Statistical optimization Interface/unknown component synthesis System Level Register Transfer Level Gate Level Transistor Level Layout Level Mask Level

System analysis Timing/power analysis Efficient FSM initialization FSM composability analysis

System verification Invariant verification of systems under specialized transformations Reduction techniques Property-dependent abstraction/refinement Similarity exploitation RTL decision procedures SAT extensions Conformance checking between different design levels Transaction level to register transfer level conformance checking RTL to gate level equivalence checking

For more info (warning: under construction)