Abstract
Field programmable gate arrays (FPGA) and other complex programmable devices (CPLD) require new logic minimization techniques since the cost functions used for conventional target implementations are no longer valid. Until now, existing tools are only adapted to the new requirements. However, the underlying approaches for logic minimization and technology mapping remained the same. We present logic minimization techniques that extend classical approaches. Basic function properties as e.g. linearity, monotony, and symmetry of its variables are detected. They are used in decomposition and partial collapsing steps to group variables with common properties within a multi-level Boolean network. The Boolean functions are stored as decision diagrams. Three different Boolean normal forms are used: disjunctive normal form, Reed-Muller expansion, and equivalence polynomial. Therefore, three types of decision diagrams are needed: binary decision diagrams (BDD), functional decision diagrams (FDD), and equivalence decision diagrams (EDD). A multiple domain minimization approach based on decomposition, domain selection, variable ordering, and variable polarity optimization is introduced.
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
U. Kebschull, E. Schubert, and W. Rosenstiel, “Multilevel Logic Synthesis Based on Functional Decision Diagrams”, in Proc. EDAC, 1992, pp. 43–47.
G. Lee and J.-Y. Chang, “Synthesis of Multi-level Reed Muler Circuits using Matrix Transformations”, in IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, 1993, pp. 61–68.
M.A. Perkowski, “A Fundamental Theorem for EXOR Circuits”, in IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, 1993, pp. 52–60.
M.A. Perkowski, A. Sarabi, and F.R. Beyl, “XOR Canonical Forms of Switching Functions”, in IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, 1993, pp. 27–32.
I. Schäfer, M.A. Perkowski, and H. Wu, “Multilevel Logic Synthesis for Cellular FPGAs Based on Orthogonal Expansions”, in IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, 1993, pp. 42–51.
D. Brand and T. Sasao, “Minimization of AND-EXOR Expressions Using Rewrite Rules”, IEEE Trans. on Comp., vol. 42, no. 5, May 1993, pp. 568–576.
T. Sasao, “EXMIN2: A Simplification Algorithm for Exclusive-OR-Sum-of-Products Expressions for Multiple-Valued-Input Two-Valued-Output Functions”, IEEE Trans. on CAD, vol. 12, no. 5, May 1993, pp. 621–632.
T. Sasao, “An Exact Minimization of AND-EXOR Expressions Using BDDs”, in IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, 1993, pp. 91–98.
J.M. Saul, “Logic Synthesis for Arithmetic Circuits Using Reed-Muller Representation”, in Proc. EDAC, 1992, pp. 109–113.
J.M. Saul, “Towards a Mixed Exclusive-/Inclusive-OR Factored Form”, in IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, 1993, pp. 2–5.
T. Sasao and Ph.W. Besslich, “On the Complexity of Mod-2 Sum PLA’s”, IEEE Trans. on Comp., vol. 39, no. 2, Feb. 1990, pp. 262–266.
U. Rollwage, “The Complexity of Mod-2 Sum PLA’s for Symmetric Functions”, in IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, 1993, pp. 6–12.
C. Damm, “How much ExOR Improves on OR?”, in IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, 1993, pp. 13–19.
S.B. Akers, “Binary Decision Diagrams”, IEEE Trans. on Comp., vol. 27, no. 6, June 1978, pp. 509–516.
C. Y. Lee, “Representation of Switching Circuits by Binary-Decision Programs”, in Bell System Tech. Journal, July 1959.
R.E. Bryant, “Graph-Based Algorithms for Boolean Function Manipulation”, IEEE Trans. on Comp., vol. 35, no. 8, Aug. 1986, pp. 677–691.
U. Kebschull and W. Rosenstiel, “Efficient Graph-Based Computation and Manipulation of Functional Decision Diagrams”, in Proc. EDAC 93, 1993.
E. Schubert, U. Kebschull, and W. Rosenstiel, “Some Optimizations for Functional Decision Diagrams”, in IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, 1993, pp. 176–180.
B. Becker, R. Drechsler, and M. Theobald, “On the Implementation of a Package for Efficient Representation and Manipulation of Functional Decision Diagrams”, in IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, 1993, pp. 162–169.
D.H. Green, Modern Logic Design, Addison Wesley, 1986.
U. Kebschull, “Graphische Darstellung und Transformation von Normalformen Boolescher Funktionen”, Tech. Rep. WSI-93–6, Universität Tübingen, 1993.
G. Boole, An Investigation of the Laws of Thought on which are founded the Mathematical Theories of Logic and Probabilities, London, 1854.
D. Bochmann and Ch. Posthoff, Binäre dynamische Systeme, Oldenburg Verlag München Wien, 1981.
M. Schlag, P.K. Chan, and J. Kong, “Empirical Evaluation of Multilevel Logic Minimization Tools for a Lookup-Table Based Field-Programmable Gate Array”, IEEE Trans. on CAD, vol. 12, no. 5, May 1993, pp. 713–722.
S. Yang, “Logic Synthesis and Optimization Benchmarks User Guide”, Tech. Rep., Microelectronics Center of North Carolina, Jan. 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Bullmann, J., Kebschull, U. (1996). Multiple Domain Logic Synthesis. In: Sasao, T., Fujita, M. (eds) Representations of Discrete Functions. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1385-4_9
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1385-4_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8599-1
Online ISBN: 978-1-4613-1385-4
eBook Packages: Springer Book Archive