loading...
Some Optimizations of Hardware Multiplication by Constant Matrices
Santiago de Compostela, Spain June 15-June 18
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.2003.120765616th IEEE Symposium on Computer Arith ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nicolas Boullis, École Normale Supérieure de Lyon
Arnaud Tisserand, École Normale Supérieure de Lyon
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.
Citation:
Nicolas Boullis, Arnaud Tisserand, "Some Optimizations of Hardware Multiplication by Constant Matrices," arith, pp.20, 16th IEEE Symposium on Computer Arithmetic (ARITH-16 '03), 2003
Usage of this product signifies your acceptance of the Terms of Use.