Abstract
Network don’t-cares, which represent a degree of freedom in the synthesis and minimization of networks, have been widely used in logic synthesis algorithms, and using don’t-cares usually leads to networks of improved quality. Besides don’t-cares, a larger degree of freedom is represented by Boolean relations and several synthesis methods have been proposed to utilize this flexibility. In this paper, we discuss network optimization algorithms utilizing don’t-cares and Boolean relations. The advantages and disadvantages of using different kinds of don’t-cares and Boolean relations are analyzed, and we present experimental results comparing the effectiveness of these approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Bostick, G. D. Hachtel, R. Jacoby, M. R. Lightner, P. Moceyunas, C. R. Morrison, and Ravenscroft, “The Boulder Optimal Logic Design System,” Proc. ICCAD, 1987, pp. 62–65.
R. K. Brayton, G. D. Hachtel, C. T. McMullen, and A. L. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis, Kluwer Academic Publishers, 1984.
R. K. Brayton, R. Rudell, A. L. Sangiovanni-Vincentelli, and A. R. Wang, “MIS: A Multiple-Level Logic Optimization,” IEEE TCAD, Nov. 1987, pp. 1062–1081.
R. K. Brayton and F. Somenzi, “Boolean Relations and the Incomplete Specification of Logic Networks,” Proc. VLSI 1989.
R. K. Brayton and F. Somenzi “An Exact Minimizer for Boolean Relations,” Proc. ICCAD, 1989.
F. M. Brown, Boolean Reasoning: The Logic of Boolean Equations, Kluwer Academic Publishers, 1990.
R. E. Bryant, “Graph-Base Algorithms for Boolean Function Manipulation,” IEEE TCAD, Vol. C-35, No. 8, Aug. 1986.
E. Cerny, “An Approach to Unified Methodology of Combinational Switching Circuits,” IEEE Transactions on Computers, 27(8), 1977.
K. C. Chen, Y. Matsunaga, S. Muroga and M. Fujita, “A Resynthesis Approach for Network Optimization,” Proc. DAC, 1991, pp. 458–463.
K. C. Chen and M. Fujita, “Concurrent Resynthesis for Network Optimization,” Proc. ICCD 1991, pp. 44–48.
K. C. Chen and M. Fujita, “Efficient Sum-To-One Subsets Algorithm for Logic Optimization,” Proc. DAC, 1992.
K. C. Chen and M. Fujita, “Network Resynthesis for Delay Minimization,” Proc. TAU, 1992.
M. Damiani and G. De Micheli, “Derivation of Don’t care Conditions by Perturbation Analysis of Combinational Multiple-Level Logic Circuits,” Proc. International Workshop on Logic Synthesis, 1991.
A. Ghosh, S. Devadas and A. R. Newton “Heuristic Minimization of Boolean Relations Using Testing Techniques,” Proc. CICC, 1990.
S. J. Hong, R. G. Cain and D. L. Ostapko, “MINI: A Heuristic Approach for Logic Minimization,” IBM J. of Res. and Dev., Vol. 18, pp. 443–458, Sep. 1974.
Y. Kukimoto, M. Fujita, and K. C. Chen, “Application of Boolean Unification to Combinational Logic Synthesis,” Proc. ICCAD, 1991.
B. Lin and F. Somenzi, “Minimization of Symbolic Relations,” Proc. ICCAD, 1990.
S. Muroga, Y. Kambayashi, H. C. Lai, and J. N. Culliney, “The Transduction Method —Design of Logic Networks based on Permissible Functions,” IEEE TC, Oct., 1989.
S. Muroga, X. Q. Xiang, J. Limqueco, L. P. Lin, and K. C. Chen, “A Logic Network Synthesis System, SYLON,” Proc. ICCD, 1989, pp. 324–328.
H. Savoj and R. K. Brayton, “The Use of Observability and External Don’t Care for the Simplification of Multi-Level Networks,” Proc. DAC, 1990, pp. 297–301.
H. Savoj and R. K. Brayton, “The Use of Image Computation Techniques in Extracting Local Don’t Cares and Network Optimization,” Proc. International Workshop on Logic Synthesis, 1991.
Y. Watanabe and R. K. Brayton, “Heuristic Minimization of Multiple-Valued Relations,” Proc. ICCAD 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Chen, KC., Fujita, M. (1993). Network Optimization Using Don’t-Cares and Boolean Relations. In: Sasao, T. (eds) Logic Synthesis and Optimization. The Kluwer International Series in Engineering and Computer Science, vol 212. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3154-8_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3154-8_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6381-1
Online ISBN: 978-1-4615-3154-8
eBook Packages: Springer Book Archive