Cart (Loading....) | Create Account
Close category search window

Design study of (2 x 2) core architecture for matrix multiplications via programmable graph architecture

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

5 Author(s)
Jun-Hee Mun ; Dept. of Electr. & Comput. Eng., Stony Brook Univ., NY ; Peng, M. ; Sangjin Hong ; Doboli, A.
more authors

This paper presents a 2 times 2 core architecture for matrix multiplications via the programmable graph architecture approach proposed earlier. A larger matrix-matrix multiplication can be carried out through sub-matrix decomposition. The iterative operation is completely performed with simple arithmetic operations and memory accesses. The core architecture is structurally described using Verilog and its functionality has been verified. Performance of the operation and factors influencing the execution are analyzed

Published in:

SOC Conference, 2005. Proceedings. IEEE International

Date of Conference:

19-23 Sept. 2005

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.