By Topic

Functional decomposition through structural analysis of decision diagrams-the binary and multiple-valued cases

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

2 Author(s)
Macchiarulo, L. ; Dipt. di Elettronica, Politecnico di Torino, Italy ; Civera, P.

The problem of disjoint functional decomposition is both an important and difficult task for theoretical reasons and synthesis purposes. The use of efficient representation techniques (decision diagrams) permits a novel approach, which surpasses the preceding ones by identifying graph-structures rather than algebraic relations. In this paper we present a demonstration of a new fact about functional decomposition, and a necessary and sufficient criterion to identify feasible decompositions of a generic function. We implemented and validated the algorithm integrating it in a decision diagram package

Published in:

VLSI Design, 1999. Proceedings. Twelfth International Conference On

Date of Conference:

7-10 Jan 1999