By Topic

Analysis of composition techniques for combinational switching functions using reduced ordered Binary Decision Diagrams (ROBDDs)

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)
Halder, N. ; Dept. of Electron. & Radio Eng., Kyung Hee Univ., Yongin ; Tariqul Islam, A.B.M. ; Elahi, M.F. ; Song, J.B.

Binary decision diagrams (BDDs) provide a canonical and compact representation of Boolean functions. The canonical property makes it possible to easily detect many useful properties of Boolean functions such as size of the support set, symmetry between variables etc. Furthermore, BDDs compact representation coupled with the use of data structures for caching intermediate computations allows the effective implementation of many Boolean operations. In this paper, we present a new methodology and implementation details of the composition techniques of two combinational switching functions using reduced ordered binary decision diagrams ROBDDs. For instance, given two switching functions A and B, we present the composition formulas AnlandB,A or B,ArarrB etc using ROBDDs. In this regard, we have used the concept of Shannonpsilas expansion to directly build ROBDDs. An adequate number of examples have been used to make our method clear.

Published in:

Computer and information technology, 2007. iccit 2007. 10th international conference on

Date of Conference:

27-29 Dec. 2007