(Enter summary)
Abstract: This paper considers quasi-reduced multi-valued decision
diagrams with # bits (QRMDD(#)s) to represent twovalued
logic functions. It shows relations between the numbers
of nodes in QRMDD(#)s and values of # for benchmark
functions; an upper bound on the number of nodes in the
QRMDD(#); difference between the upper bound and the
number of nodes in the QRMDD(#)s for random functions;
and the amount of total memory, evaluation time, and areatime
complexity for QRMDD(#)s. Experimental results
... (Update)
Similar documents based on text: More All
1.0: Implementation of Multiple-Output Functions using PQMDDs - Iguchi, Sasao, MATSUURA (2000)
(Correct)
0.8: Realization of Multiple-Output Functions by Reconfigurable .. - Yukihiro Iguchi Tsutomu (2001)
(Correct)
0.7: A Cascade Realization of Multiple-Output Function for.. - Munehiro (2001)
(Correct)
BibTeX entry: (Update)
S. Nagayama, T. Sasao, Y. Iguchi, and M. Matsuura, "Representations of logic functions using QRMDDs," Proc. of International Symposium on Multiple-Valued Logic, pp. 261-267, Boston, Massachusetts, U.S.A, May 15-18, 2002. http://citeseer.ist.psu.edu/nagayama02representations.html More
@misc{ nagayama02representations,
author = "S. Nagayama and T. Sasao and Y. Iguchi and M. Matsuura",
title = "Representations of logic functions using QRMDDs",
text = "S. Nagayama, T. Sasao, Y. Iguchi, and M. Matsuura, Representations of logic
functions using QRMDDs, Proc. of International Symposium on Multiple-Valued
Logic, pp. 261-267, Boston, Massachusetts, U.S.A, May 15-18, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/nagayama02representations.html" }
Citations (may not include all citations):
1726
Graph-based algorithms for boolean function manipulation
- Bryant - 1986
88
Shared binary decision diagram with attributed edges for eff.. (context) - Minato, Ishiura et al. - 1990
52
Fast functional simulation using branching programs (context) - Ashar, Malik - 1995
50
Representations of Discrete Functions (context) - Sasao, Fujita - 1996
44
Fast discrete function evaluation using decision diagrams (context) - McGeer, McMillan et al. - 1995
37
Switching Theory for Logic Synthesis (context) - Sasao
35
the OBDD-representation of general Boolean function (context) - Liaw, Lin - 1992
31
Multi-valued decision diagrams: Theory and Applications (context) - Kam, Villa et al. - 1988
29
FPGA design by generalized functional decomposition (context) - Sasao - 1993
28
Breadth-first manipulation of very large binary-decision dia.. (context) - Ochi, Yasuoka et al. - 1993
24
Neutral netlist of ten combinational benchmark circuits and .. (context) - Brglez, Fujiwara - 1985
23
Multiple-valued logic design tools (context) - Miller - 1993
21
Synthesis of software programs for embedded control applicat..
- Balarin, Chiodo et al. - 1999
20
A method to represent multipleoutput switching functions by ..
- Sasao, Butler - 1996
15
A hardware simulation engine based on decision diagrams
- Iguchi, Sasao et al. - 2000
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.lsi-cad.com/sasao/Papers/pub2002.html): More
Bi-Partition of Shared Binary Decision Diagrams - MATSUURA, SASAO, BUTLER, IGUCHI (2002)
(Correct)
Comparison of Decision Diagrams for Multiple-Output Logic.. - Sasao, IGUCHI, MATSUURA (2002)
(Correct)
Encoding of Boolean Functions and Its Application to LUT.. - Mishchenko, Sasao (2002)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC