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 contribution||The optimisation of multiplier-free directed graphs: An approach using Genetic Algorithms|
|Title of host publication||Unknown|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|Pages||197 - 200|
|Number of pages||3|
|ISBN (Print)||07803915x, 078031915X|
|Publication status||Published - May 1994|
|Event||International Symposium on Circuits and Systems - London, United Kingdom|
Duration: 1 May 1994 → …
|Conference||International Symposium on Circuits and Systems|
|Period||1/05/94 → …|
Bibliographical noteConference Proceedings/Title of Journal: Proc. IEEE Int. Sym. on Circuits and Systems
Rose publication type: Conference contribution
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 firstname.lastname@example.org.
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.