Towards an optimised VLSI design algorithm for the constant matrix multiplication problem
Kinane, Andrew and Muresan, Valentin and O'Connor, Noel E. (2006) Towards an optimised VLSI design algorithm for the constant matrix multiplication problem. In: ISCAS 2006 - IEEE International Symposium on Circuits and Systems, 21-24 May 2006, Kos, Greece.
Full text available as:
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.
|Item Type:||Conference or Workshop Item (Paper)|
|Uncontrolled Keywords:||VLSI; computational complexity; genetic algorithms; integrated circuit design; integrated logic circuits; matrix multiplication; multiplying circuits;|
|Subjects:||Computer Science > Algorithms|
|DCU Faculties and Centres:||Research Initiatives and Centres > Centre for Digital Video Processing (CDVP)|
|Publisher:||Institute of Electrical and Electronics Engineers|
|Copyright Information:||Copyright © 2006 IEEE. Reprinted from ISCAS 2006 - IEEE International Symposium on Circuits and Systems. 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 Dublin City University'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 email@example.com. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.|
|Deposited On:||05 Mar 2008 by DORAS Administrator. Last Modified 02 Feb 2009 16:37|
Archive Staff Only: edit this record