Multiobjective evolution of approximate multiple constant multipliers

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{Petrlik:2013:DDECS,

• author = "Jiri Petrlik and Lukas Sekanina",
• title = "Multiobjective evolution of approximate multiple constant multipliers",
• booktitle = "16th IEEE International Symposium on Design and Diagnostics of Electronic Circuits Systems (DDECS 2013)",
• year = "2013",
• month = "8-10 " # apr,
• pages = "116--119",
• keywords = "genetic algorithms, genetic programming, adders, circuit optimisation, logic design, multiplying circuits, MCM, adders, approximate multiple constant multiplier design, delay minimisation, digital circuit, functional equivalence, multiobjective Cartesian genetic programming, multiobjective evolution, shifters",
• DOI = "doi:10.1109/DDECS.2013.6549800",
• abstract = "Multiple constant multiplier (MCM) is a digital circuit which multiplies its single input by N constants. As MCMs are composed of adders and shifters, their implementation cost is relatively low. In this paper, we propose a method for design of approximate multiple constant multipliers where the requirement on functional equivalence between the specification and implementation is relaxed in order to further reduce the area on a chip or minimise delay. The proposed method is based on multiobjective Cartesian Genetic Programming. It provides many trade-off solutions among accuracy, area and delay.",
• notes = "Also known as \cite{6549800}",

}

Genetic Programming entries for Jiri Petrlik Lukas Sekanina

Citations