Design and implementation of a high-speed matrix multiplier based on word-width decomposition
Sangjin Hong
Kyoung-Su Park
Jun-Hee Mun
Dept. of Electr. & Comput. Eng, State Univ. of New York, Stony Brook, NY, USA;
This paper appears in: Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
Publication Date: April 2006
Volume: 14,
Issue: 4
On page(s): 380- 392
ISSN: 1063-8210
INSPEC Accession Number: 8938395
Digital Object Identifier: 10.1109/TVLSI.2006.874302
Current Version Published: 2006-05-30
Abstract
This paper presents a flexible 2×2 matrix multiplier architecture. The architecture is based on word-width decomposition for flexible but high-speed operation. The elements in the matrices are successively decomposed so that a set of small multipliers and simple adders are used to generate partial results, which are combined to generate the final results. An energy reduction mechanism is incorporated in the architecture to minimize the power dissipation due to unnecessary switching of logic. Two types of decomposition schemes are discussed, which support 2's complement inputs, and its overall functionality is verified and designed with a field-programmable gate array (FPGA). The architecture can be easily extended to a reconfigurable matrix multiplier. We provide results on performance of the proposed architecture from FPGA post-synthesis results. We summarize design factors influencing the overall execution speed and complexity.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
