By Topic

A high throughput FPGA implementation of a bit-level matrix-matrix product

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Amira, A. ; Sch. of Comput. Sci., Queen''s Univ., Belfast, UK ; Bouridane, A. ; Milligan, P. ; Sage, P.

This paper presents a novel architecture for a matrix-matrix multiplication algorithm. The paper describes the mathematical model for the algorithm (based on Baugh-Wooley algorithm), the associated design and implementation of the algorithm on a Xilinx FPGA board, and discusses the efficiency of the implementation requiring (N2) and O(2nN) as area and time complexities respectively, where N is the matrix size and n is the word length

Published in:

Circuits and Systems, 2000. Proceedings of the 43rd IEEE Midwest Symposium on  (Volume:1 )

Date of Conference:

2000