This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Basis Sets for Synthesis of Switching Functions
April 1992 (vol. 41 no. 4)
pp. 489-493

The synthesis of switching function f(x/sub 1/, x/sub 2/, . . ., x/sub n/) from a given family of functions g/sub i/(x/sub 1/, x/sub 2/, . . ., x/sub n/), 1>or=i>or=k, using a complete set of logic primitives is considered. Necessary and sufficient conditions for the synthesis of f from the g/sub i/'s are derived using the concept of a basis set. The independence between the basis property and the completeness of a set of logic primitives is shown, the conditions for extending a set (g/sub 1/, g/sub 2/, . . ., g/sub j/), j>n, to a basis set are found. Thus, the selection of a basis set and the logic primitives can be treated as separate problems. Finally, it is shown that there is a unique generalized Reed-Muller expansion for any f in terms of the basis functions (g/sub i/).

[1] M. Davio, "Ring-sum expansions of Boolean functions," inProc. Symp. Comput. and Automata, New York, 1971, pp. 411-418.
[2] S. Kundu, "Design and synthesis of modular networks," Ph.D. dissertation, Univ. of Southern California, Los Angeles, June 1979.
[3] S. Karunanithi and A. D. Friedman, "Some new types of logical completeness,"IEEE Trans. Comput., vol. C-27, pp. 998-1005, Nov. 1978.
[4] M. Y. Osman and C. D. Weiss, "Universal base functions and modules for realizing arbitrary switching functions,"IEEE Trans. Comput., vol. C-21, pp. 985-995, Sept. 1972.
[5] G. I. Opsahl, "Optimum logic modules,"IEEE Trans. Comput., vol. C- 21, pp. 90-96, Jan. 1972.
[6] Y. N. Patt, "A complex logic module for the synthesis of combinational switching circuits," inProc. AFIP Spring Joint Comput. Conf., 1967, pp. 699-705.
[7] F. P. Preparata, "On the design of universal Boolean functions,"IEEE Trans. Comput., vol. C-20, pp. 418-423, Apr. 1971.
[8] F. P. Preparata, "Universal logic modules of a new type,"IEEE Trans. Comput., vol. C-21, pp. 585-588, June 1972.
[9] A. Renyi, "On random generating elements of a finite Boolean algebra,"Acta. Sci. Math., (Szeged), vol. 22, pp. 75-81, 1961.
[10] S. Swamy, "On generalized Reed-Muller Expansions,"IEEE Trans. Comput., vol. C-21, pp. 1008-1009, Sept. 1972.
[11] M. Davio, J. Deschamps, and A. Thayse,Discrete and Switching Functions. New York: McGraw-Hill, 1978.
[12] P. R. Halmos,Lectures on Boolean Algebras. Princeton, NJ: Van Nostrand, 1963.

Index Terms:
synthesis; switching function; completeness; basis set; logic primitives; Reed-Muller expansion; logic design; switching functions.
Citation:
S. Kundu, "Basis Sets for Synthesis of Switching Functions," IEEE Transactions on Computers, vol. 41, no. 4, pp. 489-493, April 1992, doi:10.1109/12.135561
Usage of this product signifies your acceptance of the Terms of Use.