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

Volumn 15, Issue 4, 1996, Pages 385-395

  Song, Ning ^a,b   Perkowski, Marek A ^a  

^a Lattice Semiconductor Corporation   (United States)

^b Portland State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; LOGIC CIRCUITS; LOGIC GATES; MANY VALUED LOGICS; MINIMIZATION OF SWITCHING NETS;

BINARY INPUT FUNCTIONS; EXCLUSIVE SUM OF PRODUCTS EXPRESSIONS; EXORLINK;

COMPUTER AIDED LOGIC DESIGN;

EID: 0030123476     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.494702     Document Type: Article

References (24)

1. P. W. Besslich, "Efficient computer method for EXOR logic design," IEE Proc. Pt. E, vol. 130, 1983, pp. 203-206.
2. P. W. Besslich and M. W. Riege, "An efficient program for logic synthesis of Mod-2 sum expressions," in Proc. EUROASIC, Paris, France, 1991, pp. 136-141.
3. D. Brand and T. Sasao, "Minimization of AND-EXOR expressions using rewrite rules," IEEE Trans. Comput., vol. 42, pp. 568-576, May 1993.
4. L. Csanky, M. A. Perkowski, and I. Schäfer, "Canonical restricted mixed-polarity exclusive sums of products and the efficient algorithm for their minimization," in Proc. IEEE Int. Sytnp. Circuits Syst., San Diego, CA, May 1992, pp. 17-20.
5. H. Fleisher, M. Tavel, and J. Yeager, "A computer algorithm for minimizing Reed-Muller canonical forms," IEEE Trans. Comput., vol. C-36. pp. 247-250, Feb. 1987.
6. H. Fujiwara, "Logic testing and design for testability," in Comput. Syst. Series. Cambridge, MA: Mass. Inst. Tech., 1986.
7. D. H. Green, "Rccd-Muller canonical forms with mixed polarity and their manipulations." in Proc. IEE, Pt. E vol. 137, Jan. 1990, pp. 103-113.
8. M. Helliwell and M. A. Perkowski, "A fast algorithm to minimize multioutput mixed-polarity generalized Reed-Muller forms," in Proc. 25th ACM/IEEE Design Automation Conf., Anaheim, CA, June 1988, pp. 427132.
9. G. Papakonstantinou, "Minimization of modulo-2 sum of products," IEEE Trans. Comput., vol. C-28, pp. 163-167, Feb. 1979.
10. M. A. Perkowski, M. Helliwell, and P. Wu, "Minimization of multiplevalued input multi-output mixed-radix exclusive sums of products for incompletely specified boolean functions," in Proc. 19th Int. Symp. Multiple-Valued Logic, May 1989, pp. 256-263.
11. M. A. Perkowski and M. Chrzanowska-Jeske, "An exact algorithm to minimize mixed-radix exclusive sums of products for incompletely specified boolean functions," in Proc. Int. Symp. Circuits Syst., New Orleans, LA, May 1990, pp. 1652-1655.
12. D. K. Pradhan, Fault-Tolerant Computing, Theory and Techniques, vol. I. Englewood Cliffs, NJ: Prentice-Hall, 1987.
13. J. P. Robinson and C. L. Yeh, "A method for modulo-2 minimization." IEEE Trans. Comput., vol. C-31, pp. 800-801, Aug. 1982.
14. R. Rudell and A. Sangiovanni-Vincentelli, "ESPRESSO-MV: Algorithms for multiple-valued logic minimization," in Proc, IEEE Custom Integrated Circuits Conf., 1985, pp. 230-234.
15. T. Sasao, "Multiple-valued decomposition of generalized boolean functions and the complexity of programmable logic arrays," IEEE Trans. Comput., vol. C-30, pp. 635-643, Sept. 1981.
16. "EXMIN: A simplification algorithm for exclusive-OR-sumof-products expressions for multiple-valued input two-valued output functions," in Proc. 20th Int. Symp. Multiple-Valued Logic, May 1990, pp. 128-135.
17. T. Sasao and P. W. Besslich, "On the complexity of mod-2 sum p/as," IEEE Trans. Comput, vol. 39, pp. 262-266, Feb. 1990.
18. T. Sasao, "EXMIN2: A simplification algorithm for cxclusive-OR-sum-of-products expressions for multiple-valued-input two-valued-output functions," IEEE Trans. Computer-Aided Design, vol. 12, pp. 621-632, May 1993.
19. "An exact minimization of AND-EXOR expressions using BDD's," in Proc. IFIP WG 10.5 Workshop Appl. Reed-Muller Expansion Circuit Design, Wilhelm Schickard-Institut fuer Informatik, 1993, pp. 91-98.
20. J. M. Saul, "An improved algorithm for the minimization of mixed polarity Reed-Muller representations," in Proc. Int. Conf. Comput. Design: VLSI Comput. Processors, Sept. 1990, pp. 372-375.
21. I. Schäfer and M. A. Pcrkowski, "Multiple valued generalized Reed-Muller forms," in Proc. IEEE 21st Int. Symp. Multiple-Valued Logic, May 1991, pp. 4018.
22. N. Song, "Minimization of exclusive sum of products expressions for multiple-valued input incompletely specified functions," Master's degree thesis, EE Dept, Portland State Univ., OR, 1992.
23. S. Y. H Su and P. T. Cheng, "Computer minimization of multivalued switching functions," IEEE Trans. Comput, vol. C-21, pp. 995-1003, Sept. 1972.
24. X. Wu, X. Chen, and S. L. Hurst, "Mapping of Reed-Muller coefficients and the minimization of exclusive-OR switching functions," IEEE Proc. Pt. E, Jan. 1982, vol. 129, pp. 5-20.