Design, Automation and Test in Europe (DATE'05) Volume 1 Munich, Germany March 07-March 11 ISBN: 0-7695-2288-2
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DATE.2005.83
This paper addresses two problems related to disjoint-support decomposition of Boolean functions. First, we present a heuristic for finding a subset of variables, X, which results in the disjoint-support decomposition f(X, Y) = h(g(X), Y) with a good area/delay trade-off. Second, we present a technique for re-synthesis of the original circuit implementing f(X, Y) into a circuit implementing the decomposed representation h(g(X), Y). Preliminary experimental results indicate that the proposed approach has a significant potential.
Citation:
Andr? Martinelli, Elena Dubrova, "Bound Set Selection and Circuit Re-Synthesis for Area/Delay Driven Decomposition," date, vol. 1, pp.430-431, Design, Automation and Test in Europe (DATE'05) Volume 1, 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||