Some Optimizations of Hardware Multiplication by Constant Matrices

This paper presents some improvements on the optimization of hardware multiplication by constant matrices. We focus on the automatic generation of circuits that involve constant matrix multiplication (CMM), i.e. multiplication of a vector by a constant matrix. The proposed method, based on number recoding and dedicated common sub-expression factorization algorithms was implemented in a VHDL generator. The obtained results on several applications have been implemented on FPGAs and compared to previous solutions. Up to 40% area and speed savings are achieved.

• Type: Conference
• Year: 2003
• Where: ARITH
• Authors: Nicolas Boullis, Arnaud Tisserand
• Keywords: Applied Computing, ARITH 2003, Constant Matrices, Constant Matrix, Constant Matrix Multiplication