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, i.e., multiplication of a vector by a constant matrix. The proposed method, based on number recodin...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 2005-10, Vol.54 (10), p.1271-1282
Main Authors: Boullis, N., Tisserand, A.
Format: Article
Language:English
Subjects:
Algorithms
common subexpressions sharing
Computer Arithmetic
Computer Science
Digital arithmetic
Field programmable gate arrays
FIR digital filters
FIR filter
Generators
Hardware
Hardware design languages
Index Terms- Computer arithmetic
Mathematical analysis
Matrices
Matrix methods
Matrix multiplication
Multiplication
multiplication by constants
Optimization
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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, i.e., multiplication of a vector by a constant matrix. The proposed method, based on number recoding and dedicated common subexpression factorization algorithms, was implemented in a VHDL generator. Our algorithms and generator have been extended to the case of some digital filters based on multiplication by a constant matrix and delay operations. The obtained results on several applications have been implemented on FPGAs and compared to previous solutions. Up to 40 percent area and speed savings are achieved.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2005.168