By Topic

Weights Binary Decision Diagram (WBDD) and its application to Matrix Multiplication

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
$33 $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)
T. Bhuvaneswari ; Faculty of Engineering and Technology, Multimedia University, Melaka, 75450 Malaysia ; V. C. Prasad ; Ajay Kumar Singh ; P. W. C. Prasad

Binary decision diagrams (BDDs) are the most frequently used data structure for handling Boolean functions because of their excellent efficiency in terms of time and space. Algebraic decision diagrams (ADDs) have been used to solve general purpose problems such as matrix multiplication, logic synthesis and formal verification. We propose a new type of BDD called weights binary decision diagram (WBDD). We apply the proposed BDD for matrix multiplication. We express weights as binary values and the matrix can be represented by a collection of matrices taken for each weight bit. Since the Boolean expressions are for weight values, the computations are easier and faster compared to ADDs.

Published in:

Innovative Technologies in Intelligent Systems and Industrial Applications, 2009. CITISIA 2009

Date of Conference:

25-26 July 2009