This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Minimization Algorithms for Multiple-Valued Programmable Logic Arrays
February 1991 (vol. 40 no. 2)
pp. 167-177

The performance of various heuristic algorithms for minimizing realizations of multiple-valued functions by the charge-coupled device (CCD) and CMOS programmable logic arrays (PLAs) of H.G. Kerkhoff and J.T. Butler (1986) and J.G. Samson (1988), respectively, is analyzed. The functions realized by the PLAs are in sum-of products form, where the sum is ordinary addition truncated to the highest logic value and the product represents the MIN operation of functions of the input variables that are the interval literal operations. Three heuristics, proposed by G. Pomper and J.A. Armstrong (1981), P.W. Besslich (1986), and G.W. Dueck and D.M. Miller (1987), are compared over sets of random and random-symmetric functions. An exact minimization method that is a tree search using backtracking is described. A reduction in the search space is achieved by considering constrained implicant sets and by eliminating some implicants altogether. Even with this improvement, the time required for exact minimization is extremely high when compared to all three heuristics. The case involving only prime implicants is considered, and it is shown that such implicants have marginal value compared to constrained implicant sets. The basis of comparison is the average number of product terms.

[1] E.A. Bender and J.T. Butler, "On the size of PLA's required to realize binary and multiple-valued functions,"IEEE Trans. Comput., pp. 82-98, Jan. 1989.
[2] E.A. Bender, J. T. Butler, and H. G. Kerkhoff, "Comparing the SUM with the MAX for use in four-vaulted PLA's," inProc. 15th Int. Symp. Multiple-Valued Logic, May, 1985, pp. 30-35.
[3] P. W. Besslich, "Heuristic minimization of MVL functions: A direct cover approach,"IEEE Trans. Comput., pp. 134-144, Feb. 1986.
[4] R. Brayton, G. Hachtel, C. McMullen, and A. Sangio-Vincentelli,Logic Minimization Algorithms for VLSI Synthesis. Boston, MA: Kluwer Academic, 1984.
[5] J. T. Butler and H. G. Kerkhoff, "Analysis of input and output configurations for use in four-valued programmable logic arrays," inProc. IEE-E: Comput. Digital Techniques, July 1987, pp. 168-176.
[6] G. W. Dueck and D. M. Miller, "A direct cover MVL minimization using the truncated sum," inProc. 17th Int. Symp. Multiple-Valued Logic, May 1987, pp. 221-227.
[7] J. F. Gimpel, "A method of producing a Boolean function having an arbitrarily prescribed prime implicant table,"IEEE Trans. Electron. Comput., pp. 485-488, June 1965.
[8] R.M. Karp, "Reducibility among combinatorial problems," inComplexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. New York: Plenum, 1972, pp. 85-103.
[9] H. G. Kerkhoff and J.T. Butler, "Design of a high-radix programmable logic array using profiled peristaltic charge-coupled devices," inProc. 16th Int. Symp. Multiple-Valued Logic, May 1986, pp. 100-103.
[10] H. G. Kerkhoff and J.T. Butler, "A module compiler for the design of high-radix CCD PLA's,"Int. J. Electron, pp. 797-805, Nov. 1989.
[11] Y. H. Ko, "Design of multiple-valued programmable logic arrays," M.S. Thesis, Naval Postgraduate School, Monterey, CA, Dec. 1988.
[12] H.-L. Kuo and K.-Y. Fang, "The multiple-valued programmable logic array and its application in modular design," inProc. Int. Symp. Multiple-Valued Logic, May 1985, pp. 10-18.
[13] D. M. Miller and J. C. Muzio, "On the minimization of many-valued functions," inProc. Int. Symp. Multiple-Valued Logic, May 1979, pp. 294-299.
[14] G. Pomper and J. A. Armstrong, "Representation of multivalued functions using the direct cover method,"IEEE Trans. Comput., pp. 674-679, Sept. 1981.
[15] J. G. Samson, "Design of a PLA in multiple-valued logic," report "250 uurs opdracht," M.S. Thesis, Univ. of Twente, June 1988.
[16] T. Sasao,Programmable Logic Arrays: How to Make and How to Use, ISBN4-526-02026-5 C3054, NIKKAN KOGYOU Pub. Co. 1986 (in Japanese).
[17] T. Sasao, "On the optimal design of multiple-valued PLA's,"IEEE Trans. Comput., pp. 582-592, Apr. 1989.
[18] P. P. Tirumalai and J. T. Butler, "On the realization of multiple-valued logic functions using CCD PLA's," inProc. 14th Symp. Multiple-Valued Logic, May 1984, pp. 33-42.
[19] P. P. Tirumalai and J. T. Butler, "Prime and non-prime implicants in the minimization of multiple-valued logic functions," inProc. 19th Int. Symp. Multiple-Valued Logic, May 1989, pp. 272-279.

Index Terms:
minimisation algorithms; multiple-valued programmable logic arrays; performance; heuristic algorithms; multiple-valued functions; charge-coupled device; CMOS; sum-of products; MIN operation; random-symmetric functions; tree search; backtracking; constrained implicant sets; charge-coupled device circuits; CMOS integrated circuits; logic arrays; many-valued logics; minimisation.
Citation:
P.P. Tirumalai, J.T. Butler, "Minimization Algorithms for Multiple-Valued Programmable Logic Arrays," IEEE Transactions on Computers, vol. 40, no. 2, pp. 167-177, Feb. 1991, doi:10.1109/12.73587
Usage of this product signifies your acceptance of the Terms of Use.