The optimisation of multiplier-free directed graphs: an approach using genetic algorithms

DR Bull, A Aladjidi

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

1 Citation (Scopus)
253 Downloads (Pure)

Abstract

This paper considers the problem of realising directed graphs using evolutionary optimisation methods. Graphs are constrained to have edge gains equal to powers of two and signal values at internal vertices are required to be weighted by elements of a given coefficient vector. The objective is to synthesise a graph with minimum complexity. The method is developed for the case of a single multiplicative coefficient using vertex cardinality as a measure of solution fitness and extended to the more general case of a multi-element coefficient vector with additional optimisation constraints. The potential of the approach is demonstrated using examples based on FIR digital filters
Translated title of the contributionThe optimisation of multiplier-free directed graphs: An approach using Genetic Algorithms
Original languageEnglish
Title of host publicationUnknown
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages197 - 200
Number of pages3
Volume2
ISBN (Print)07803915x, 078031915X
DOIs
Publication statusPublished - May 1994
EventInternational Symposium on Circuits and Systems - London, United Kingdom
Duration: 1 May 1994 → …

Conference

ConferenceInternational Symposium on Circuits and Systems
CountryUnited Kingdom
CityLondon
Period1/05/94 → …

Bibliographical note

Conference Proceedings/Title of Journal: Proc. IEEE Int. Sym. on Circuits and Systems
Rose publication type: Conference contribution

Terms of use: Copyright © 1994 IEEE. Reprinted from IEEE International Symposium on Circuits and Systems, 1994. (ISCAS '94).

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org.

By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Fingerprint Dive into the research topics of 'The optimisation of multiplier-free directed graphs: an approach using genetic algorithms'. Together they form a unique fingerprint.

Cite this