Optimisation of Constant Matrix Multiplication Operation Hardware Using a Genetic Algorithm

  • Andrew Kinane
  • Valentin Muresan
  • Noel O’Connor
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3907)


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 three-stage algorithm proposed in this paper partitions the global constant matrix multiplier into its constituent dot products, and all possible solutions are derived for each dot product in the first two stages. The third stage leverages the effective search capability of genetic programming to search for global solutions created by combining dot product partial solutions. A bonus feature of the algorithm is that the modelling is amenable to hardware acceleration. Another bonus feature is a search space reduction early exit mechanism, made possible by the way the algorithm is modelled. Results show an improvement on state of the art algorithms with future potential for even greater savings.


Discrete Cosine Transform Full Adder Product Node Hardware Acceleration Search Space Reduction 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Potkonjak, M., Srivastava, M.B., Chandrakasan, A.P.: Multiple Constant Multiplications: Efficient and Versatile Framework and Algorithms for Exploring Common Subexpression Elimination. IEEE Transactions on Computer-Aided Design of Integrated Circuits 15, 151–165 (1996)CrossRefGoogle Scholar
  2. 2.
    Dempster, A.G., Macleod, M.D.: Digital Filter Design Using Subexpression Elimination and all Signed-Digit Representations. Proc. IEEE International Symposium on Circuits and Systems. 3, 169–172 (2004)Google Scholar
  3. 3.
    Dempster, A.G., Macleod, M.D.: Using all Signed-Digit Representations to Design Single Integer Multipliers using Subexpression Elimination. In: Proc. IEEE International Symposium on Circuits and Systems, vol. 3, pp. 165–168 (2004)Google Scholar
  4. 4.
    Macleod, M.D., Dempster, A.G.: Common subexpression elimination algorithm for low-cost multiplierless implementation of matrix multipliers. IEE Electronics Letters 40, 651–652 (2004)CrossRefGoogle Scholar
  5. 5.
    Boullis, N., Tisserand, A.: Some Optimizations of Hardware Multiplication by Constant Matrices. IEEE Transactions on Computers 54, 1271–1282 (2005)CrossRefGoogle Scholar
  6. 6.
    Macleod, M.D., Dempster, A.G.: Multiplierless FIR Filter Design Algorithms. IEEE Signal Processing Letters 12, 186–189 (2005)CrossRefGoogle Scholar
  7. 7.
    Martinez-Peiro, M., Boemo, E.I., Wanhammar, L.: Design of High-Speed Multiplierless Filters Using a Nonrecursive Signed Common Subexpression Algorithm. IEEE Transations on Circuits and Systems II 49, 196–203 (2002)CrossRefGoogle Scholar
  8. 8.
    Andres, S.D.: On the number of bracket structures of n-operand operations constructed by binary operations. Private communication (2005)Google Scholar
  9. 9.
    Kinane, A., Muresan, V., O’Connor, N.: Towards an Optimised VLSI Design Algorithm for the Constant Matrix Multiplication Problem. In: Proc. IEEE International Symposium on Circuits and Systems, Kos, Greece (2006)Google Scholar
  10. 10.
    Goldberg, D.: A note on Boltzmann tournament selection for genetic algorithms and population-oriented simulated annealing. Complex Systems 4, 445–460 (1990)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Andrew Kinane
    • 1
  • Valentin Muresan
    • 1
  • Noel O’Connor
    • 1
  1. 1.Centre for Digital Video ProcessingDublin City UniversityDublin 9Ireland

Personalised recommendations