Automated electronic design 1.Introduction 2.Area of problems 3.Approaches and solutions 4.Other related Ideas 5.Conclusions By Alexander Mitev.

Slides:



Advertisements
Similar presentations
ARCHITECTURES FOR ARTIFICIAL INTELLIGENCE SYSTEMS
Advertisements

DSPs Vs General Purpose Microprocessors
CS6800 Advanced Theory of Computation
Frequency modulation and circuits
Architecture Representation
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
ECE 551 Digital System Design & Synthesis Lecture 08 The Synthesis Process Constraints and Design Rules High-Level Synthesis Options.
NATIONAL INSTITUTE OF SCIENCE & TECHNOLOGY Presented by: Susman Das Technical Seminar Presentation FPAA for Analog Circuit Design Presented by Susman.
Hardware Implementation of Antenna Beamforming using Genetic Algorithm Kevin Hsiue Bryan Teague.
Object-Oriented Analysis and Design
1 Wendy Williams Metaheuristic Algorithms Genetic Algorithms: A Tutorial “Genetic Algorithms are good at taking large, potentially huge search spaces and.
Extensible Processors. 2 ASIP Gain performance by:  Specialized hardware for the whole application (ASIC). −  Almost no flexibility. −High cost.  Use.
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, Java Version, Third Edition.
Web Ontology Language for Service (OWL-S). Introduction OWL-S –OWL-based Web service ontology –a core set of markup language constructs for describing.
Behavioral Design Outline –Design Specification –Behavioral Design –Behavioral Specification –Hardware Description Languages –Behavioral Simulation –Behavioral.
Chess Review May 10, 2004 Berkeley, CA Platform-based Design for Mixed Analog-Digital Designs Fernando De Bernardinis, Yanmei Li, Alberto Sangiovanni-Vincentelli.
Genetic Algorithms Learning Machines for knowledge discovery.
Simulation Models as a Research Method Professor Alexander Settles.
© 2006 Pearson Addison-Wesley. All rights reserved2-1 Chapter 2 Principles of Programming & Software Engineering.
Platform-based Design for Mixed Analog-Digital Designs Fernando De Bernardinis, Yanmei Li, Alberto Sangiovanni-Vincentelli May 10, 2004 Analog Platform.
Genetic Algorithms: A Tutorial
On Roles of Models in Information Systems (Arne Sølvberg) Gustavo Carvalho 26 de Agosto de 2010.
Development in hardware – Why? Option: array of custom processing nodes Step 1: analyze the application and extract the component tasks Step 2: design.
Evolutionary algorithms
Digital Electronics. Introduction to Number Systems & Codes Digital & Analog systems, Numerical representation, Digital number systems, Binary to Decimal.
Chap. 1 Overview of Digital Design with Verilog. 2 Overview of Digital Design with Verilog HDL Evolution of computer aided digital circuit design Emergence.
ON LINE TEST GENERATION AND ANALYSIS R. Šeinauskas Kaunas University of Technology LITHUANIA.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
CMOS Design Methods.
1 5. Application Examples 5.1. Programmable compensation for analog circuits (Optimal tuning) 5.2. Programmable delays in high-speed digital circuits (Clock.
ENG6090 RCS1 ENG6090 Reconfigurable Computing Systems Hardware Description Languages Part 5: Modeling Structure.
IEEE ICECS 2010 SysPy: Using Python for processor-centric SoC design Evangelos Logaras Elias S. Manolakos {evlog, Department of Informatics.
VHDL IE- CSE. What do you understand by VHDL??  VHDL stands for VHSIC (Very High Speed Integrated Circuits) Hardware Description Language.
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
TOPIC : SYNTHESIS INTRODUCTION Module 4.3 : Synthesis.
1 MODELING MATTER AT NANOSCALES 4. Introduction to quantum treatments The variational method.
1 CSCD 326 Data Structures I Software Design. 2 The Software Life Cycle 1. Specification 2. Design 3. Risk Analysis 4. Verification 5. Coding 6. Testing.
Of 33 lecture 1: introduction. of 33 the semantic web vision today’s web (1) web content – for human consumption (no structural information) people search.
CS 1308 – Computer Literacy and the Internet Building the CPU.
Volgograd State Technical University Applied Computational Linguistic Society Undergraduate and post-graduate scientific researches under the direction.
ELEE 4303 Digital II Introduction to Verilog. ELEE 4303 Digital II Learning Objectives Get familiar with background of HDLs Basic concepts of Verilog.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.
1 5. Application Examples 5.1. Programmable compensation for analog circuits (Optimal tuning) 5.2. Programmable delays in high-speed digital circuits (Clock.
Digital Design Using VHDL and PLDs ECOM 4311 Digital System Design Chapter 1.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
Principles in the Evolutionary Design of Digital Circuits J. F. Miller, D. Job, and V. K. Vassilev Genetic Programming and Evolvable Machines.
From Use Cases to Implementation 1. Structural and Behavioral Aspects of Collaborations  Two aspects of Collaborations Structural – specifies the static.
From Use Cases to Implementation 1. Mapping Requirements Directly to Design and Code  For many, if not most, of our requirements it is relatively easy.
Multi-cellular paradigm The molecular level can support self- replication (and self- repair). But we also need cells that can be designed to fit the specific.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
SUBJECT : DIGITAL ELECTRONICS CLASS : SEM 3(B) TOPIC : INTRODUCTION OF VHDL.
Invitation to Computer Science, C++ Version, Fourth Edition
B.Sc. Thesis by Çağrı Gürleyük
ECE 551: Digital System Design & Synthesis
Structural style Modular design and hierarchy Part 1
Invitation to Computer Science, Java Version, Third Edition
IP – Based Design Methodology
The performance requirements for DSP applications continue to grow and the traditional solutions do not adequately address this new challenge Paradigm.
HIGH LEVEL SYNTHESIS.
Dr. Unnikrishnan P.C. Professor, EEE
Presented By: Darlene Banta
Search.
Traveling Salesman Problem by Genetic Algorithm
Search.
♪ Embedded System Design: Synthesizing Music Using Programmable Logic
From Use Cases to Implementation
Presentation transcript:

Automated electronic design 1.Introduction 2.Area of problems 3.Approaches and solutions 4.Other related Ideas 5.Conclusions By Alexander Mitev

Introduction - Why to automate ? - Time cycles, cost, quality - Computer design vs. hand made

Introduction - Digital vs. Analog DIGITALANALOG Circuit scaleLARGESMALL Design methodologyVHDLSCHEMATIC DesignSYSTEMATICINTUITIVE Synthesis systemCURRENTLY USEDNOT YET Behavior of the transistors SIMPLECOMPLEX SalaryHIGHHIGHER???

Introduction The art of analog circuit design

Area of problems Complex behavior of analog circuits No common rule how to synthesize The imperfection of computer modeling The rising complexity of formal solutions The highest degree of freedom of analog circuits Mostly the solutions in analog design is approved after simulation or real test.

Available solutions – Genetic programming -Achieves this goal of automatic programming by genetically breeding a population of computer programs using the principles of Darwinian natural selection and biologically inspired operations. -Genetic operations include reproduction, crossover (sexual recombination), mutation, and architecture-altering operations patterned after gene duplication and gene deletion in nature. -The main generational loop of a run of genetic programming consists of the fitness evaluation, Darwinian selection, and the genetic operations.

Available solutions – Genetic programming -Genome – a collection of genes, representing parameters of the problem to be optimized - Example of genome:

Available solutions – Genetic programming, example 1 Goal – Best solution for the transistor widths and resistor value for R1 Genome – 76 bit, approximately 7.5x10 25 possible designs

Available solutions – Genetic programming, example 1 Results: Result in 163’th generation Total work time: Pentium min

Available solutions – Genetic programming, example 2 Goal – Filter Synthesis Limitation: bandwidth, minimal component Fitness calculation:

Available solutions – Genetic programming, example 2 Best individual at generation 40

Available solutions – Genetic programming, example 2 - Solution after the 100’th generation - Minimal elements and exact pass bandwidth. - Total CPU time - 7h 43min.

Available solutions – Genetic programming, example 2

Available solutions – Genetic programming, example 3 - Goal Low pass filter using parallel GA - Genome 400 bytes ; individuals max - Best result 23’th generation - Total working time 6 SUN workstation 4 hours

Available solutions – Genetic programming: Summary -Benefits: -Novel approach by simulating natural selection -Mostly with GA could be solved problems faster than by hand. Shortcoming (regarding this research) -Time dependable -Domain dependable, presently available for filters and amplifiers -No guarantee to solve the problem

Available solutions – Automated design by reusing CBR: the basic idea is to solve a new problems by comparing them with old ones that have been solved in the past Major method – testing for similarity. Base with “past experience”, Intelligent retrieval Intelligent retain – if a new solution is available Generalizing this idea by considering the common sense of Intellectual product (IP)

The reuse - cycle - Retrieval – an IP is selected corresponding to the respective specifications

The reuse - cycle - Retrieval – an IP is selected corresponding to the respective specifications -Instantiation: If an IP has been selected the necessary design is instantiated, OR

The reuse - cycle -Retrieval – an IP is selected corresponding to the respective specifications -Instantiation: If an IP has been selected the necessary design is instantiated, OR -The design flow is defined to meet the constraints

The reuse - cycle -Retrieval – an IP is selected corresponding to the respective specifications -Instantiation: If an IP has been selected the necessary design is instantiated, OR -The design flow is defined to meet the constraints -Retain – if it has been decided to store the synthesized circuit

Solution – Reuse

Design by reuse Algebraic description of Libraries Basic requirement : LB, LF library Kb – behavior to be synthesized Vb – behavior parameters Db- allowed parameters Kf – design flow to be synthesized Vf – des. flow parameters Df- allowed des. flow parameters

Design by reuse LB library – parameterized design LB – store certain design, which can be instantiated Kb – parameterized specification of the synthesized behavior Vb – specification parameters Db – allowed parameters

Design by reuse Specifications b and b’ are: - identical - equal (same behavior) - extension b<b’ Example 32 bit adder and 16 bit adder

Design by reuse LF library – design flow for synthesis LF – store certain design flow Kf – parameterized design flow Vf – specification parameters Db – allowed parameters values

Design by reuse Algebraic description of Libraries Reuse library LIB Ki – parameters for behavior and des. flow Vi – both parameters from Vb and Bf Di- allowed parameters values

Design by reuse Reuse component IP I = (Ki, Vi, Di) Instance if |Di|=1 Configurable if |Di|>1 Ki – parameters for behavior and des. flow Vi – specification parameters from Vb and Bf Di- allowed parameters values

Design by reuse

Similarity of IP’s For each parameter in Vi is calculated similarity of the allowed parameters Rv – relevance factor, stating the importance ov V for the hole design

Design by reuse Constraint management

Design by reuse Constraint management

Design by reuse - example READEE project – CBR technology of design and IP reuse Realization as a WEB based service. Problem domain – selection of DSP processors Similarity measure – application and DSP-specific information ( Example : consuming power ) Performance or qualifying is based on abstract table model including many application orientated properties

Design by reuse - example DSP operations table: 1. Operations, such as arithmetic, logic etc. 2. Performance profile : filter (parameters) ; FFT (parameters, #simples) ; general purpose options Task of evaluation model supporting similarity calculations: 1. Clock frequency is derived as a function of consuming power 2. User specified performance profile is mapped to the main data code.

Design by reuse - example DSP function taxonomy

Design by reuse - summary Benefits: -Knowledge based approach -No iterations, quick solution (if there is a solution) -With retain mechanism – theoretically provide solutions for all possible problems Drawbacks: 1.Design for reuse 2.Numerous parameters, one another dependable 3.In many cases scalable design is impossible

Design by reuse Define domain of problem set (ex. Noise, gain etc.) Determine all domain of parameters ( ex. frequency, resistance, etc). V – V [p 1, p 1, ….p n ] Level-1: L1 base - Separate the Analog circuit in simple modules with known parameters (ex. Transistor, capacitor etc). L1- L1[T i, V i ] Leve-2 : L2 base – Topological low level description (CE transistor, Differ. Pair.) L2 – L2(L1 k, V k )

Design by reuse Hence we have description of all analog building blocks The instantiate base describes all available design circuits Now we can reuse different block according problem specification

Design by reuse Simplifying of circuit by substitution with building blocks

Ideas for automated electronic design By decomposition the circuit into submodules or building blocks we can get these advantages: 1. instantiate each block, not the hole circuit 2. if we symbolic describe behavior of each block we can make some prediction of the total behavior of the circuit. More important is the reverse operation – to make a relation from behavior to building modules.

Ideas for automated electronic design 3. If we can make a complete set of building blocks. It will be one step ahead to use one special case of reuse – software reuse similar to HDL based languages. Presently is available analog extension of VHDL but only for elementary elements ( transistors, diodes) Problems : –Rising complexity of symbolic representation with the size of circuit –Every circuit maintain one symbolic representation, but not vice versa.

Conclusion, feature work 1. The key of the analog design is in distinguishing of the topologies. 2. Common ontology for analog design. (not seen yet in the topic of automated analog design). Example: Hi-Fi audio amplifier includes: filters, amplifying modules, comparators etc). 3.Each element of this ontology has to be provided with detailed parametric specifications: - all allowed parameters ; - all scalable parameters. 4.We can reuse the elements not the hole circuit

Conclusion, feature work 3.Scenario for design flow could be possible to simulate based on the symbolic description (expression) of the problem by evaluating and/or reusing. 4.Mechanism for decomposition major problem to minor subproblems.