On the Complexity of Mod-2 Sum PLA’s

IEEE Transactions on Computers

Volumn 39, Issue 2, 1990, Pages 262-266

  Sasao, Tsutomu ^a   Besslich, Philipp ^b  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

Complexity; easily testable circuits; Exclusive OR sumof products; functions; logic minimization; programmable logic array; symmetric

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; OPTIMIZATION;

EXCLUSIVE-OR ARRAYS; EXOR ARRAYS; LOGIC FUNCTIONS; MINIMIZATION ALGORITHMS; PROGRAMMABLE LOGIC ARRAYS; UPPER BOUNDS;

LOGIC CIRCUITS;

EID: 0025387007     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.45212     Document Type: Article

References (26)

1. 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.
2. —, “Input variable assignment and output phase optimization of PLA’s,” IEEE Trans. Comput., vol. C-33, pp. 879-894, Oct. 1984.
3. S. Even, I. Kohavi, and A. Paz, “On minimal modulo-2 sums of products for switching functions,” IEEE Trans. Electron. Comput., vol. EC-16, pp. 671-674, Oct. 1967.
4. A. Mukhopadhyay and G. Schmitz, “Minimization of Exclusive OR and logical equivalence of switching circuits,” IEEE Trans. Comput., vol. C-19, pp. 132-140, 1970.
5. J. P. Robinson and C.-L. Yeh, “A method for modulo-2 minimization,” IEEE Trans. Comput., vol. C-31, pp. 800-801, 1982.
6. P. Tirumalai and J. T. Butler, “On the realization of multiple-valued logic functions using CCD PLA’s,” in Proc. 14 Int. Symp. Multiple - Valued Logic, May 1984, pp. 33-42.
7. G. W. Dueck and D. M. Miller, “A 4-valued PLA using the MOD- SUM,” in Proc. 15 Int. Symp. Multiple-Valued Logic, May 1986, pp. 232-240.
8. T. Sasao and P. W. Besslich, “On the complexity of PLA’s with EXOR arrays,” IECEJ Tech. Rep., FTS 86-17, Nov. 1986.
9. I. S. Reed, “A class of multiple-error-correcting codes and the decoding scheme,” IRE Trans. Inform. Theory, vol. PGIT-4, pp. 38-49, 1954.
10. D. E. Muller, “Application of Boolean algebra to switching circuit design and to error detection,” IRE Trans. Electron. Comput., vol. EC-3, pp. 6-12, 1954.
11. G. Bioul, M. Davio, and J. P. Deschamps, “Minimization of ring-sum expansions of Boolean functions,” Philips Res. Rep., vol. 28, pp. 17-36, 1973.
12. D. H. Green and I. S. Taylor, “Multiple-valued switching circuit design by means of generalized Reed-Muller expansions,” Digital Processes, vol. 2, pp. 63-81, 1976.
13. P. W. Besslich and H. Bassmann, “Synthesis of Exclusive- O R logic functions,” Berichte Elekrotechnik, ISSN 0724-1933, No. 3.87, Universitat Bremen, FB-1, P.O. Box 330 440, D-2800 Bremen 33, West Germany.
14. P. W. Besslich, “Spectral processing of switching functions using signal-flow transformations,” Spectral Techniques and Fault Detection, in M. Karpovsky, Ed. Orlando, FL: Academic, 1985, pp. 91-141.
15. S. J. Hong, R. G. Cain, and D. L. Ostapko, “MINI: A heuristic approach for logic minimization,” IBM J. Res. Develop., vol. 18, pp. 443-458, Sept. 1974.
16. H. Fleisher, M. Tavel, and J. Yeager, “A computer algorithm for minimizing Reed-Muller canonical forms,” IEEE Trans. Comput., vol. C-36, no. 2, pp. 247-250, Feb. 1987.
17. M. Helliwell and M. Perkowski, “A fast algorithm to minimize multi-output mixed-polarity generalized Reed-Muller forms,” in Proc. 25th Design Automat. Conf., June 1988, pp. 427-432.
18. T. Sasao and M. Higashida, “On a design algorithm for and-EXOR PLA’s with input decoders,” The 20th FTC Workshop, Jan. 1989 (in Japanese).
19. M. A. Harrison, Introduction to Switching and Automata Theory. New York: McGraw-Hill, 1965.
20. S. Muroga, Logic Design and Switching Theory. New York: Wiley, 1979.
21. N. Koda and T. Sasao, “Table for minimum exclusive- O R sum-of-products for 4-variable functions,” in preparation.
22. L. Hellerman, “A catalog of three-variable OR-invert and AND-invert logical circuits,” IEEE Trans. Electron. Comput., vol. EC-12, pp. 198-223, June 1963.
23. S. M. Reddy, “Easily testable realization for logic functions,” IEEE Trans. Comput., vol. C-21, pp. 1083-1088, 1972.
24. H. Fujiwara and K. Kinoshita, “A design procedure of programmable logic arrays with universal tests,” IEEE Trans. Comput., vol. C-30, pp. 823-828, Nov. 1981.
25. K. A. Hua, J.-Y. Jou, and J. A. Abraham, “Built-in tests for VLSI finite-state machines,” in Proc. IEEE 14th Fault-Tolerant Comput. Syst. Conf.,1984, pp. 292-297.
26. T. Sasao and H. Fujiwara, “A design of and- EXOR PLA’s with universal tests,” IECEJ Tech. Rep., FTS 86-26, Feb. 1987 (in Japanese).