Skip to main content
SpringerLink
Log in

Representations of Logic Functions Using EXOR Operators

  • Chapter
Representations of Discrete Functions

Abstract

Logic functions are usually represented by logical expressions or decision diagrams using AND and OR operators. However, some functions have more compact representations with EXOR operators. This chapter surveys representations of logic functions using EXOR operators.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Becker, R. Drechsler and M. Theobald, “On the implementation of a package for efficient representation and manipulation of functional decision diagrams,” IFIP 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, September 1993.

    Google Scholar 

  2. B. Becker, R. Drechsler, and M. Theobald, “OKFDDs versus OBDDs and OFDDs,” International Workshop on Logic Synthesis, Lake Tahoe, May 1995.

    Google Scholar 

  3. R. K. Brayton, G. D. Hachtel, C. T. McMullen, and A. L. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis, Boston, MA. Kluwer, 1984.

    Book  MATH  Google Scholar 

  4. R. E. Bryant, “Graph-based algorithms for Boolean function manipulation,” IEEE Trans. Comput. Vol. C-35, No. 8, Aug. 1986, pp. 677–691.

    Article  Google Scholar 

  5. E. M. Clarke, M. Fujita, P.C. McGeer, K.L. McMillan and J. C. Yang, “Multi-terminal binary decision diagrams: An efficient data structure for matrix representation” Int. Workshop on Logic Synthesis, May 1993, pp. 6A 1–15.

    Google Scholar 

  6. E. M. Clarke, K.L. McMillan, X. Zhao, M. Fujita, P.C. McGeer, and J. C. Yang, “Spectral transforms for large Boolean functions with application to technology mapping,” Int. Workshop on Logic Synthesis, May 1993, pp. P6b 1–15. (Also Chapter 4 of this book).

    Google Scholar 

  7. L. Csanky, M. A. Perkowski, and I. Schäfer, “Canonical restricted mixed polarity exclusive-or sums of products and the efficient algorithm for their minimization,” Proc. IEE, Part. E, Vol. 140, No. 1, pp. 69–77, Oct. 1993.

    Google Scholar 

  8. M. Davio, J-P. Deschamps, and A. Thayse, Discrete and Switching Functions, McGraw-Hill International, 1978.

    MATH  Google Scholar 

  9. D. Debnath and T. Sasao, “GRMIN: a heuristic simplification algorithm for generalized Reed-Muller expressions,” IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, August 1995.

    Google Scholar 

  10. R. Drechsler, A. Sarabi, M. Theobald, B. Becker and M.A. Perkowski, “Efficient representation and manipulation of switching functions based on ordered Kronecker functional decision diagrams,” Proc. 1994 Design Automation Conference, June 1994, pp. 415–419.

    Google Scholar 

  11. R. Drechsler, M. Theobald, and B. Becker, “Fast FDD based minimization of generalized Reed-Muller forms,” In European Design Automation Conf, 1994, pp.2–7.

    Google Scholar 

  12. R. Drechsler, B. Becker and A. Jahnke, “On variable ordering and decomposition type choice in OKFDDs,” IFIP WG. 10.5 Workshop on Applications of the Reed-Muller Expansions in Circuit Design, August 1995.

    Google Scholar 

  13. R. Drechsler and B. Becker, “Dynamic minimization of OKFDDs,” IFIP WG. 10.5 Workshop on Applications of the Reed-Muller Expansions in Circuit Design, August 1995. (Also Chapter 7 of this book).

    Google Scholar 

  14. M. Escobar and F. Somenzi, “Synthesis of AND-EXOR expressions via satisfiability,” IFIP WG. 10.5 Workshop on Applications of the Reed-Muller Expansions in Circuit Design, August 1995.

    Google Scholar 

  15. S. Even, I. Kohavi and A. Paz, “On minimal modulo-2 sums of products for switching functions,” IEEE Trans. Electronic Computers, Vol. EC-16, pp. 671–674, Oct. 1967.

    Article  Google Scholar 

  16. H. Fujiwara, Logic Testing and Design for Testability, The MIT Press, 1985.

    Google Scholar 

  17. J. Gergov and C. Meinel, “Mod-2-OBDD’s: a generalization of OBDD’s and EXOR-sum-of-products,” IFIP 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, September 1993.

    Google Scholar 

  18. D. Green, Modern Logic Design, Addison-Wesley Publishing Company, 1986.

    Google Scholar 

  19. D. H. Green, “Families of Reed-Muller canonical forms,” International Journal of Electronics, Vol. 63. No. 2, pp. 259–280, Jan. 1991.

    Article  Google Scholar 

  20. M.A. Heap, W.A. Rogers, and M.R. Mercer, “A synthesis algorithm for two-level XOR based circuits,” IEEE 1992 International Conference on Computer Design: VLSI in Computers and Processors, ICCD’92, 459–62, 1992.

    Google Scholar 

  21. U. Kebschull, E. Schubert and W. Rosenstiel, “Multilevel logic synthesis based on functional decision diagrams,” EDAC 92, 1992, pp. 43–47.

    Google Scholar 

  22. U. Kebschull and W. Rosenstiel, “Efficient graph based computation and manipulation of functional decision diagrams,” In Proc. EDAC’98, pp. 43–47, 1993.

    Google Scholar 

  23. N. Koda and T. Sasao, “LP equivalence class of logic functions,” IFIP 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, Hamburg, Sept. 16–17, 1993.

    Google Scholar 

  24. P. K. Lui and J. Muzio, “Boolean matrix transforms for the parity spectrum and the minimization of modulo-2 canonical expansions,” Proc. IEE. vol. 138, No. 6, pp. 411–417, Nov. 1991.

    Google Scholar 

  25. A. Mukhopadhyay and G. Schmitz, “Minimization of exclusive OR and logical equivalence of switching circuits,” IEEE Trans. Comput., C-19, pp. 132–140, 1970.

    Article  Google Scholar 

  26. L. McKenzie, L. Xu and A. Almaini, “Graphical representation of generalized Reed-Muller expansions,” IFIP 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, Hamburg, Sept. 16–17, 1993.

    Google Scholar 

  27. G. Papakonstantinou, “Minimization of modulo-2 sum of products,” IEEE Trans. on Comput., Vol. C-28, pp. 163–167, Feb. 1979.

    Article  MathSciNet  Google Scholar 

  28. M. Perkowski and M. Chrzanowska-Jeske, “An exact algorithm to minimize mixed-radix exclusive sums of products for incompletely specified Boolean functions,” Proc. ISCAS, pp. 1652–1655, June 1990.

    Google Scholar 

  29. M. A. Perkowski, L. Csanky, A. Sarabi, and I. Schäfer, “Fast minimization of mixed-polarity AND-XOR canonical networks,” Proc. ICCD-92, pp. 33–36, Oct. 1992.

    Google Scholar 

  30. M. A. Perkowski, A. Sarabi, and I. Schäfer, “Multi-level logic synthesis based on Kronecker and Boolean ternary decision diagrams for incompletely specified functions,” (to appear VLSI journal).

    Google Scholar 

  31. S. M. Reddy, “Easily testable realization for logic functions,” IEEE Trans. Computers, Vol. C-21, No. 11, pp. 1183–1188.

    Google Scholar 

  32. U. Rollwage, “The complexity of mod-2 sum PLA’s for symmetric functions,” IFIP 10.5 Workshop on Application of the Reed-Muller Expansion in Circuit Design, Sept. 1993.

    Google Scholar 

  33. K. K. Saluja and S. M. Reddy, “Fault detecting test set for Reed-Muller canonic networks,” IEEE Trans. on Comput., Vol. C-24, No. 10, pp. 995–998, 1975.

    Article  MathSciNet  Google Scholar 

  34. T. Sasao, “Input variable assignment and output phase optimization of PLA’s,” IEEE Trans. on Comput., Vol. C-33, No. 10, pp. 879–894, Oct. 1984.

    Article  MathSciNet  Google Scholar 

  35. T. Sasao, “HART: A hardware for logic minimization and verification,” IEEE International Conference on Computer Design: VLSI in Computer, ICCD’85, New York, pp. 713–718, Oct. 7–10, 1985.

    Google Scholar 

  36. T. Sasao and P. Besslich, “On the complexity of MOD-2 Sum PLA’s,” IEEE Trans. Comput., vol. 39, No. 2, pp. 262–266, Feb. 1990.

    Article  Google Scholar 

  37. T. Sasao, “Transformation of multiple-valued input two-valued output functions and its application to simplification of exclusive-or sum-of-products expressions,” Proc. International Symposium on Multiple- Valued Logic, pp. 270–279, May 1991.

    Google Scholar 

  38. T. Sasao (ed.), Logic Synthesis and Optimization, Kluwer Academic Publishers 1993–01.

    Google Scholar 

  39. T. Sasao, “Ternary decision diagram and their applications,” International Workshop on Logic Synthesis, Lake Tahoe, May 1993, pp. 6c, 1–11. (Also Chapter 12 of this book).

    Google Scholar 

  40. T. Sasao, “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, vol. 12, No. 5, May 1993, pp. 621–632.

    Article  Google Scholar 

  41. T. Sasao, “An exact minimization of AND-EXOR expressions using BDDs,” IFIP 10.5 Workshop on Application of the Reed-Muller Expansion in Circuit Design, Sept. 1993.

    Google Scholar 

  42. T. Sasao and J. T. Butler, “A design method for look-up table type FPGA by pseudo-Kronecker expansion,” Proc. International Symposium on Multiple-Valued Logic, May 1994, pp. 97–106.

    Google Scholar 

  43. T. Sasao, “Easily testable realization for generalized Reed-Muller expressions,” IEEE The 3rd Asian Test Symposium, November 15–17, 1994, Nara Japan, pp. 157–162.

    Google Scholar 

  44. T. Sasao and D. Debnath, “An exact minimization algorithm for generalized Reed-Muller expressions” IEEE Asia-Pacific Conference on Circuits and Systems (APCCAS’94), December 5–8, 1994, Taipei, Taiwan, pp. 460–465.

    Google Scholar 

  45. T. Sasao and F. Izuhara, “Exact minimization of AND-EXOR expressions using multi-terminal EXOR ternary decision diagram,” IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, August 1995. (Also Chapter 8 of this book).

    Google Scholar 

  46. T. Sasao, S. Wada, H. Hamachi, and M. Matsuura, “Multi-level logic synthesis based on pseudo-Kronecker decision diagrams and logic transformation,” IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, August 1995.

    Google Scholar 

  47. T. Sasao, “A design Method for AND-OR-EXOR three-level networks,” International Workshop on Logic Synthesis, Lake Tahoe, May 1995.

    Google Scholar 

  48. N. Song, and M. Perkowski, “EXORCISM-MV-2: Minimization of exclusive-sum-of-products expressions for multiple-valued input incompletely specified functions,” 1993 International Symposium on Multiple-Valued Logic, May 24, 1993. pp. 132–137.

    Google Scholar 

  49. S. Toida and N. S. V. Rao, “On test generation for combinational circuits consisting of AND and EXOR gates,” Digest of Papers of 1992 IEEE VLSI Test Symposium. Design, Test and Application: ASICs and Systems-on-a-Chip, pp. 113–118,1992.

    Google Scholar 

  50. C.C. Tsai and M. Marek-Sadowska, “Efficient minimization algorithms for fixed polarity and/xor canonical networks,” In Great Lake Symposium VLSI, pp. 76–79, 1993.

    Google Scholar 

  51. D. Varma and E. A. Trachtenberg, “Computation of Reed-Muller expansions of incompletely specified Boolean functions from reduced representations,” IEE Proc. E, 1991, vol. 138, pp. 85–92.

    Google Scholar 

  52. K. Yasuoka, “Ternary decision diagrams to represent ringsum-of-products forms,” IFIP WG. 10.5 Workshop on Applications of the Reed-Muller Expansions in Circuit Design, August 1995.

    Google Scholar 

  53. S. Yang, “Logic synthesis and optimization benchmark user guide,” version 3.0, MCNC, Jan. 1991.

    Google Scholar 

  54. A. Zakrevskij, “Minimum polynomial implementation of systems of incompletely specified Boolean functions,” IFIP WG. 10.5 Workshop on Applications of the Reed-Muller Expansions in Circuit Design, August 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Electronics, Kyushu Institute of Technology, Iizuka, Japan

    Tsutomu Sasao

Authors
  1. Tsutomu Sasao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Electronics, Kyushu Institute of Technology, Iizuka, Japan

    Tsutomu Sasao

  2. Fujitsu Laboratories of America Inc., Santa Clara, California, USA

    Masahiro Fujita

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Kluwer Academic Publishers

About this chapter

Cite this chapter

Sasao, T. (1996). Representations of Logic Functions Using EXOR Operators. In: Sasao, T., Fujita, M. (eds) Representations of Discrete Functions. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1385-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-1385-4_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-8599-1

  • Online ISBN: 978-1-4613-1385-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation