Genetic Algorithm for Parameter Optimization Skyler Weaver Objective: to implement a Genetic Algorithm into myspice to allow parameter optimization of.

Slides:



Advertisements
Similar presentations
Hybrid Infrared and Visible Light Projection for Location Tracking
Advertisements

Abdullah Said Alkalbani University of Buraimi
Date of Birth Design Problem
CSE 370 Sample Final Exam Questions. 1) Logic Minimization CD AB F = Σm(0,6,7,8,9,11,15) + d(1,13)
- 1 - Using an SMT Solver and Craig Interpolation to Detect and Remove Redundant Linear Constraints in Representations of Non-Convex Polyhedra Christoph.
Register Transfer and Microoperations Part2
Fast Algorithms for Finding Nearest Common Ancestors Dov Harel and Robert Endre Tarjan Fast Algorithms for Finding Nearest Common Ancestors SIAM J. COMPUT.
8 October 2013Birkbeck College, U. London1 Introduction to Computer Systems Lecturer: Steve Maybank Department of Computer Science and Information Systems.
15 October 2013Birkbeck College, U. London1 Introduction to Computer Systems Lecturer: Steve Maybank Department of Computer Science and Information Systems.
A Simple ALU Binary Logic.
Multiplikation H. Malz. Multiplikation H. Malz Operanden laden.
CGPage: 1 We can define a window as a rectangular region of the world coordinate space, and the viewport as a rectangular region of the device coordinate.
CS 105 Tour of the Black Holes of Computing
Monika Gope Lecturer IICT, KUET
1 Non-uniform Crossover in Genetic Algorithm Methods to Speed up the Generation of Test Patterns for Sequential Circuits Michael Dimopoulos - Panagiotis.
1 Interconnect and Packaging Lecture 3: Skin Effect Chung-Kuan Cheng UC San Diego.
Truth Tables & Logic Expressions
Truth Tables and Boolean Algebra Benchmark Companies Inc PO Box Aurora CO
Basics Combinational Circuits Sequential Circuits
B AB CD C A D m0m1m3m2 m4 m5m7m6 m12 m8m9m11 m10 m13 m15m14 Input combo mintermExpressio n 0000m0A’B’C’D’ 0001m1A’B’C’D 0010m2A’B’CD’
Topics Adders Half Adder Full Adder Subtracter Half Subtracter
Genetic Algorithm.
CS1022 Computer Programming & Principles
Binary Lesson 3 Hexadecimal. Counting to 15 Base Base Base 16 Base Base Base 16 Two Ten (Hex) Two Ten (Hex)
Binary Lesson 3 Hexadecimal. Counting to 15 Base Base Base 16 Base Base Base 16 Two Ten (Hex) Two Ten (Hex)
 How many neurons are to be used?  How the neurons are to be connected to form a network.  Which learning algorithm to use?  How to train the neural.
A First Course in Genetic Algorithms
Digital Logic & Design Lecture No. 3. Number System Conversion Conversion between binary and octal can be carried out by inspection.  Each octal digit.
ELECTRONICS TECHNOLOGY Digital Devices I Karnaugh Maps
Advanced Mate Selection in Evolutionary Algorithms.
Evolving Edge detection Final project by Rubshtein Andrey ( )
Internet Engineering Czesław Smutnicki Discrete Mathematics – Combinatorics.
MIPS Assembly Tutorial
Multiplication – Microprocessor
Shannon Expansion Given Boolean expression F = w 2 ’ + w 1 ’w 3 ’ + w 1 w 3 Shannon Expansion of F on a variable, say w 2, is to write F as two parts:
Exact and heuristics algorithms
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Valery Frolov.  The algorithm  Fitness function  Crossover  Mutation  Elite individuals  Reverse mutations  Some statistics  Run examples.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
1 Genetic Algorithms. CS The Traditional Approach Ask an expert Adapt existing designs Trial and error.
Game of Life Changhyo Yu Game of Life2 Introduction Conway’s Game of Life  Rule Dies if # of alive neighbor cells =< 2 (loneliness) Dies.
Research Trends in AI Maze Solving using GA Muhammad Younas Hassan Javaid Danish Hussain
1 Genetic Algorithms. CS 561, Session 26 2 The Traditional Approach Ask an expert Adapt existing designs Trial and error.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Binding and Kinetics for Experimental Biologists Lecture 2 Evolutionary Computing : Initial Estimate Problem Petr Kuzmič, Ph.D. BioKin, Ltd. WATERTOWN,
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Universidad de los Andes-CODENSA The Continuous Genetic Algorithm.
Evolving a Sigma-Pi Network as a Network Simulator by Justin Basilico.
Fuzzy Genetic Algorithm
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Genetic Algorithms Abhishek Sharma Piyush Gupta Department of Instrumentation & Control.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Genetic Search Algorithms Matt Herbster. Why Another Search?  Designed in the 1950s, heavily implemented under John Holland (1970s)  Genetic search.
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
►Search and optimization method that mimics the natural selection ►Terms to define ٭ Chromosome – a set of numbers representing one possible solution ٭
The Implementation of Genetic Algorithms to Locate Highest Elevation By Harry Beddo.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Using GA’s to Solve Problems
MAE 552 Heuristic Optimization
A Study of Genetic Algorithms for Parameter Optimization

Modified Crossover Operator Approach for Evolutionary Optimization
Applications of Genetic Algorithms TJHSST Computer Systems Lab
Introduction to Genetic Algorithm and Some Experience Sharing
GA.
Presentation transcript:

Genetic Algorithm for Parameter Optimization Skyler Weaver Objective: to implement a Genetic Algorithm into myspice to allow parameter optimization of multiple parameters and multiple goal specifications.

Introduction Optimization allows you to set circuit outputs and solve for parameters Circuit outputs are “goals” Many optimization routines require a good initial guess –Many local minima –Slow gradient F(x1,x2,x3,…) Genetic Algorithm doesn’t have this problem!!!

Choose variables Create population of randomized parameters Determine fitness of individuals and rank them Solution? “mate” fittest individuals to create new population Mutate new population Solution found The concept

The approach Bit array represents “DNA” : RRRR CCCC LLLL FFMF MFMF FMMM } crossover } mutation Get values for R, C, L and run simulation father mother

Does it work? Successful sexual crossover Positive mutation occurred Vdd supply Vsig in div 0 1 R1 supply div ~ R2 div 0 ~ R3 in out ~ L1 supply out ~ 1e-6 1e-3 C1 out 0 ~ 1e-12 1e-9 ~ DC div 0.5 ~ DC Vdd ~ AC out 0.5 1e6 ~ AC out 0.4 2e6 DC Goals: dc[3] = ( ) 100.0% dc[5] = ( ) 100.0% AC Goals: ac[4] = Hz ac[4] = Hz R1 supply div R2 div R3 in out Vdd supply Vsig in div C1 out pF L1 supply out uH