Exact Minimization of FPRMs Using Multi-Terminal Exor TDDs

  • Tsutomu Sasao
  • Fumitaka Izuhara

Abstract

This chapter presents methods to derive a fixed polarity Reed-Muller expression (FPRM) and a Kronecker expression (KRO) having the minimum number of products for a given logic function. The minimization methods use EXOR ternary decision diagrams (ETDDs) and multi-terminal binary decision diagrams (MTBDDs) to represent extended truth vectors and weight vectors, respectively. Various techniques to reduce computation time and memory storage are developed. Experimental results up to 94 inputs are shown. The presented method outperforms existing methods.

Keywords

EDAC 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Ph. W. Besslich, “Efficient computer method for EXOR logic design,” IEE Proc., vol. 130, Part E, pp. 203–206, 1983.Google Scholar
  2. [2]
    B. Becker, R. Drechsler and N. Göckel “A genetic algorithm for minimization of fixed polarity Reed-Muller expressions,” Proc. International Conference on Artificial Neural Networks and Genetic Algorithm, April 1995.Google Scholar
  3. [3]
    G. Bioul, M. Davio and J. P. Deschamps: “Minimization of ring- sum expansions of Boolean functions,” Philips Res. Rpts., vol. 28, pp. 17–36, 1973.MathSciNetMATHGoogle Scholar
  4. [4]
    R. K. Brayton, G. D. Hachtel, C. T. McMullen, and A. L. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis, Boston, MA. Kluwer, 1984.MATHCrossRefGoogle Scholar
  5. [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. (Also Chapter 4 of this book).Google Scholar
  6. [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.Google Scholar
  7. [7]
    M. Davio, J.-P. Deschamps, and A. Thayse, Discrete and Switching Functions, McGraw-Hill International, 1978.MATHGoogle Scholar
  8. [8]
    R. Drechsler, M. Theobald, and B. Becker, “Fast FDD based minimization of generalized Reed-Muller forms,” Proc. European Design Automation Conf., 1994.Google Scholar
  9. [9]
    H. Fujiwara, Logic Testing and Design for Testability, The MIT Press, 1985.Google Scholar
  10. [10]
    D. Green, Modern Logic Design, Addison-Wesley Publishing company, 1986.Google Scholar
  11. [11]
    D. H. Green,“Reed-Muller canonical forms with mixed polarity and their manipulations,” Proc. IEE, vol. 137. pt.E, No.l, 1990. pp. 110–113.Google Scholar
  12. [12]
    P. K. Lui and J. Muzio, “Boolean matrix transforms for the parity spectrum and the minimization of modulo-2 canonical expansions,” IEE Proc. vol. 138, No. 6, pp. 411–417.Google Scholar
  13. [13]
    M. Matsuura and T. Sasao, “Heuristic optimization programs for fixed polarity Reed-Muller expressions and Kronecker expressions,” (in preparation).Google Scholar
  14. [14]
    A. Mukhopadhyay and G. Schmitz, “Minimization of Exclusive OR and logical Equivalence of switching circuits,” IEEE Trans. Comput., C-19, pp. 132–140, 1970.CrossRefGoogle Scholar
  15. [15]
    U. Kebschull and W. Rosenstiel, “Efficient graph based computation and manipulation of functional decision diagrams,” Proc. EDAC′98, pp. 43–47, 1993.Google Scholar
  16. [16]
    M. A. Perkowski, L. Csanky, A. Sarabi, and I. Schaefer, “Fast minimization of mixed-polarity AND-XOR canonical networks,” Proc. ICCD-92, pp. 33–36, Oct. 1992.Google Scholar
  17. [17]
    D. K. Pradhan, “Universal test sets for multiple fault detection in AND-EXOR arrays,” IEEE Trans.on Comput., Vol. C-27, No. 2, pp. 181–187.Google Scholar
  18. [18]
    S. M. Reddy, “Easily testable realization for logic functions,” IEEE Trans. on Comput., C-21, pp. 1083–1088, 1972.Google Scholar
  19. [19]
    K. K. Saluja and E. H. Ong, “Minimization of Reed-Muller canonic expansion,” IEEE Trans. on Comput., C-28, pp. 535–537,1979.MathSciNetCrossRefGoogle Scholar
  20. [20]
    K. K. Saluja and S. M. Reddy, “Fault detecting test sets for Reed-Muller canonic networks,” IEEE Trans. on Comput., Vol. C-24, No. 10, pp. 995–998, 1975.MathSciNetCrossRefGoogle Scholar
  21. [21]
    A. Sarabi and M. A. Perkowski, “Fast exact and quasi-minimal minimization of highly testable fixed polarity AND/XOR canonical networks,” Proc. Design Automation Conference 1992, June 1992, pp. 20–35.Google Scholar
  22. [22]
    T. Sasao and P. Besslich, “On the complexity of MOD-2 sum PLA’s,” IEEE Trans, on Comput, vol. 32, No. 2, pp. 262–266, Feb. 1990.CrossRefGoogle Scholar
  23. [23]
    T. Sasao, “Transformation of multiple-valued input two-valued output functions and its application to simplification of exclusive-or sum-of-products expressions,” Proc. ISMVL-91, pp. 270–279, May. 1991.Google Scholar
  24. [24]
    T. Sasao, “AND-EXOR expressions and their optimization,” in (Sasao e.d.) Logic Synthesis and Optimization, Kluwer Academic Publishers, 1993.CrossRefGoogle Scholar
  25. [25]
    T. Sasao, “EXMIN2: A simplification algorithm for exclusive-OR-Sum-of- products expressions for multiple-valued input two-valued output functions,” IEEE Trans, on Computer-Aided Design of Integrated Circuits and Systems, Vol. 12, No. 5, May 1993, pp. 621–632.CrossRefGoogle Scholar
  26. [26]
    C. C. Tsai and M. Marek-Sadowska, “Efficient minimization algorithms for fixed polarity and/xor canonical networks,” Great Lake Symp. VLSI, pp. 76–79, 1993.Google Scholar
  27. [27]
    S. Yang, “Logic synthesis and optimization benchmark user guide, version 3.0”, MCNC, Jan. 1991.Google Scholar

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Tsutomu Sasao
    • 1
  • Fumitaka Izuhara
    • 1
  1. 1.Department of Computer Science and ElectronicsKyushu Institute of TechnologyIizukaJapan

Personalised recommendations