Abstract
A minimum ESOP (Exclusive-OR Sum-of-Products) form of a logic function f is an AND-EXOR 2-level expression of f having the minimum number of product terms. In the paper we deal with multiple-valued 2-input logic functions f, and give an algorithm to find a minimum ESOP form of a given function f in polynomial time.
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
Fleisher, H., Tavel, M., Yeager, J.: A computer algorithm for minimizing Reed-Muller canonical forms. IEEE Transactions on Computers 36(2), 247–250 (1987)
Gaidukov, A.: Algorithm to derive minimum ESOP for 6-variable function. In: Proceedings of the Fifth International Workshop on Boolean Problems, Freiberg (2002)
Hirayama, T., Nishitani, Y., Sato, T.: A faster algorithm of minimizing AND-EXOR expressions. IEICE Trans. Fundamentals E85-A(12), 2708–2714 (2002)
Mizuki, T., Otagiri, T., Sone, H.: An application of ESOP expressions to secure computations. Journal of Circuits, Systems, and Computers 16(2), 191–198 (2007)
Sasao, T.: EXMIN2: a simplification algorithm for exclusive-or sum-of-products expressions for multiple-valued-input two-valued-output functions. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 12(5), 621–632 (1993)
Sasao, T.: Switching Theory for Logic Synthesis. Kluwer Academic Publishers, Boston (1999)
Sasao, T., Besslich, P.: On the complexity of mod-2 sum PLA’s. IEEE Transactions on Computers 39(2), 262–266 (1990)
Song, N., Perkowski, M.A.: Minimization of exclusive sum-of-products expressions for multiple-valued input, incompletely specified functions. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15(4), 385–395 (1996)
Stergiou, S., Papakonstantinou, G.: Exact minimization of ESOP expressions with less than eight product terms. Journal of Circuits, Systems and Computers 13(1), 1–15 (2004)
Stergiou, S., Voudouris, D., Papakonstantinou, G.: Multiple-value exclusive-or sum-of-products minimization algorithms. IEICE Trans. Fundamentals E87-A(5), 1226–1234 (2004)
Ye, Y., Roy, K.: An XOR-based decomposition diagram and its application in synthesis of AND/XOR networks. IEICE Trans. Fundamentals E80-A(10), 1742–1748 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mizuki, T., Tsubata, H., Nishizeki, T. (2009). Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions. In: Chen, J., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2009. Lecture Notes in Computer Science, vol 5532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02017-9_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-02017-9_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02016-2
Online ISBN: 978-3-642-02017-9
eBook Packages: Computer ScienceComputer Science (R0)