Towards an optimised VLSI design algorithm for the constant matrix multiplication problem

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

@InProceedings{Kinane:2006:ISCAS,
  author =       "A. Kinane and V. Muresan and N. O'Connor",
  title =        "Towards an optimised VLSI design algorithm for the
                 constant matrix multiplication problem",
  booktitle =    "Proceedings of the IEEE International Symposium on
                 Circuits and Systems, ISCAS 2006",
  year =         "2006",
  month =        "21-24 " # may,
  publisher =    "IEEE",
  note =         "4 pp., CD-ROM",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "0-7803-9389-9",
  DOI =          "doi:10.1109/ISCAS.2006.1693782",
  abstract =     "The efficient design of multiplierless implementations
                 of constant matrix multipliers is challenged by the
                 huge solution search spaces even for small scale
                 problems. Previous approaches tend to use hill-climbing
                 algorithms risking sub-optimal results. The proposed
                 algorithm avoids this by exploring parallel solutions.
                 The computational complexity is tackled by modelling
                 the problem in a format amenable to genetic programming
                 and hardware acceleration. Results show an improvement
                 on state of the art algorithms with future potential
                 for even greater savings.",
  notes =        "Centre for Digital Video Process., Dublin City Univ.,
                 Ireland",
}

Genetic Programming entries for Andrew Kinane Valentin Muresan Noel E O'Connor

Citations