Universal Logic Modules and Their Applications

IEEE Transactions on Computers

Volumn C-19, Issue 2, 1970, Pages 141-149

  Yau, Stephen S ^a   Tang, Calvin K ^b  

^a NORTHWESTERN UNIVERSITY   (United States)

^b IBM   (United States)

Author keywords

Decomposition; expansion; logic modules for symmetric functions (LMS's); modular realization of logic functions; number of input output terminals; Q modules; Q type; residue functions; serially controlled ULM's (SULM's); tree type (T type); universal logic modules (ULM's); universal sequential circuits

Indexed keywords

AUTOMATA THEORY; INTEGRATED CIRCUITS; LOGIC CIRCUITS; LOGIC DESIGN; SEQUENTIAL MACHINES;

EID: 0014736385     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/T-C.1970.222879     Document Type: Article

References (15)

1. D. C. Forslund and R. Waxman, “The universal logic block (ULB) and its application to logic design,” 1966 Seventh Annual Symp. Switching and Automata Theory, Conf. Rec., pp. 236–250.
2. B. Elspas et al. “Properties of cellular arrays for logic and storage,” Stanford Research Institute, Scientific Rept. 3, Contract AF-19-628-5828 (DDC AD-658832), pp. 59–83, June 1967.
3. S. S. Yau and C. K. Tang, “Universal logic circuits and their modular realizations,” 1968 Spring Joint Computer Conf., AFIPS Proc., vol. 32. Washington, D. C.: Thompson, pp. 297–305, 1968.
4. A. R. Meo, “Modular tree structures,” IEEE Trans. Computers, vol. C-17, pp. 432–442, May 1968.
5. R. Waxman, M. T. McMahon, B. J. Crawford, and A. B. DeAndrade, “Automated logic design techniques applicable to integrated circuitry technology,” 1966 Fall Joint Computer Conf., AFIPS Proc., vol. 29. Washington, D. C.: Spartan, pp. 247–265, 1966.
6. W. F. King, III, “The synthesis of multipurpose logic devices,” 1966 Seventh Annual Symp. Switching and Automata Theory, Conf. Rec., pp. 227–235.
7. P. R. Schneider and D. L. Dietmeyer, “An algorithm for synthesis of multiple-output combinational logic,” IEEE Trans. Computers, vol. C-17, pp. 117–128, February 1968.
8. R. B. Hurley, Transistor Logic Circuits. New York: Wiley, 1961.
9. C. E. Shannon, “The synthesis of two-terminal switching circuits,” Bell Sys. Tech. J., vol. 28, pp. 59–98, January 1949.
10. R. L. Ashenhurst, “The decomposition of switching functions,” Proc. Internatl. Symp. Theory of Switching, vol. 29 in Annals of Computation Lab. Cambridge, Mass.: Harvard University, 1959, pp. 74–116.
11. H. A. Curtis, “A generalized tree circuit,” J. ACM, vol. 8, pp. 484–496, December 1961.
12. —, “Generalized tree circuit—the basic building block of an extended decomposition theory,” J. ACM, vol. 10, pp. 562–581, October 1963.
13. M. A. Harrison, Introduction to Switching and Automata Theory. New York: McGraw-Hill, 1965.
14. W. H. Kautz, “The realization of symmetric switching functions with linear-input logic elements,” IRE Trans. Electronic Computers, vol. EC-10, pp. 371–379, September 1961.
15. R.C. Born and A. K. Scidmore, “Transformation of switching functions to completely symmetric switching functions,” IEEE Trans. Computers, vol. C-17, pp. 596–599, June 1968.