The evolutionary design of digital VLSI hardware
Year: 2005
Type: dissertation
Abstract: Evolutionary Algorithms (EAs) are a class of powerful stochastic search techniques, which were inspired by natural evolution.They work by iteratively improving a population of solutions, according to one or more objective functions.Evolutionary algorithms are capable of producing near-optimal solutions to highly complex search problems;In this thesis, multi-objective evolutionary algorithms are applied to the design of efficient digital ASIC core designs.Specifically, the thesis addresses the evolutionary synthesis of multiplierless linear filters, multiplierless linear transforms, and polynomial transform designs.The designs are constructed from high-level arithmetic components such as adders and subtracters, according to a user-supplied behavioural specification.The designs are evaluated according to three different objectives: functionality, low area requirements, and low longest-path delay.In order to evaluate these objectives, accurate hardware models are developed.Evolutionary algorithms are often applied to scheduling problems.This thesis investigates the possibility of performing scheduling and allocation in parallel with circuit evolution.Two possibilities are considered: scheduling for sequential operation and pipeline scheduling.The choice of solution representation and evolutionary operators can have an enormous impact on the performance of an evolutionary algorithm.In this thesis, solutions are represented with graphs.Graphs are found to be a powerful and intuitive representation for circuit designs, although the complexity of the evolutionary operators tends to be higher than with other encodings.Various graph evolutionary operators are developed, including a novel non-destructive graph crossover operator.This thesis also proposes a class of local search operators.These operators can significantly improve the performance of an EA.The improvement is achieved in two ways: by reducing the computational cost of evaluating a design, and by automatically finding optimal settings for some of the design parameters.These local search operators are initially applied to linear designs, and are later adapted for devices with polynomial responses.X Vector of system inputs.x(t) Time domain input.x(z) Frequency domain input. YVector of system outputs.y(t) Time domain output. y(z) Frequency domain output.Evolutionary algorithms are a class of powerful stochastic search techniques, which were inspired by natural evolution.EAs can find near-optimal solutions to highly complex problems.EM can be applied to problems with discontinuous, multimodal search spaces, and to multiobjective problems. OverviewThis thesis investigates the evolutionary design of three important classes of digital hardware:• multiplierless FIR filters,• multiplierless linear transforms,• polynomial transforms. Thesis contentsThis thesis is structured as follows.Chapters 2 and 3 contain descriptions of existing literature.Chapter 2 describes relevant techniques for the design and modelling of digital hardware.Chapter 3 describes stochastic search techniques, including evolutionary algorithms, as well as investigating how they have been tm
Source: ERA
Author: R. Thomson
Institution: University of Edinburgh
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2278877004
