Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions

(Extended Abstract)
  • Takaaki Mizuki
  • Hitoshi Tsubata
  • Takao Nishizeki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5532)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Fleisher, H., Tavel, M., Yeager, J.: A computer algorithm for minimizing Reed-Muller canonical forms. IEEE Transactions on Computers 36(2), 247–250 (1987)zbMATHCrossRefGoogle Scholar
  2. 2.
    Gaidukov, A.: Algorithm to derive minimum ESOP for 6-variable function. In: Proceedings of the Fifth International Workshop on Boolean Problems, Freiberg (2002)Google Scholar
  3. 3.
    Hirayama, T., Nishitani, Y., Sato, T.: A faster algorithm of minimizing AND-EXOR expressions. IEICE Trans. Fundamentals E85-A(12), 2708–2714 (2002)Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Sasao, T.: Switching Theory for Logic Synthesis. Kluwer Academic Publishers, Boston (1999)zbMATHGoogle Scholar
  7. 7.
    Sasao, T., Besslich, P.: On the complexity of mod-2 sum PLA’s. IEEE Transactions on Computers 39(2), 262–266 (1990)CrossRefGoogle Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Stergiou, S., Voudouris, D., Papakonstantinou, G.: Multiple-value exclusive-or sum-of-products minimization algorithms. IEICE Trans. Fundamentals E87-A(5), 1226–1234 (2004)Google Scholar
  11. 11.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Takaaki Mizuki
    • 1
  • Hitoshi Tsubata
    • 2
  • Takao Nishizeki
    • 2
  1. 1.Cyberscience CenterTohoku UniversitySendaiJapan
  2. 2.Graduate School of Information SciencesTohoku UniversitySendaiJapan

Personalised recommendations