This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Transduction Method-Design of Logic Networks Based on Permissible Functions
October 1989 (vol. 38 no. 10)
pp. 1404-1424
Based on the new concept of permissible functions, a heuristic procedure to design logic networks with as few gates as possible, without guaranteeing the minimality of designed networks, is developed. This procedure, which is drastically different from conventional logic-design procedures, is called the transduction method, because an initial network designed by any conventionally known logic-d

[1] C. R. Baugh, T. Ibaraki, and S. Muroga, "Computational experience in all integer, binary variable, integer programming problems using Gomory's all integer algorithm," Rep. 259, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Apr. 1968.
[2] C. R. Baugh, T. Ibaraki, and S. Muroga, "Results in using Gomory's all-integer algorithm to design optimum logic networks,"Oper. Res., pp. 1090-1096, July-Aug. 1971.
[3] J. N. Culliney, "On the synthesis by integer programming of optimal NOR gate networks for four variable switching functions," Master thesis, Rep. 480, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Sept. 1971.
[4] J. N. Culliney, "Program manual: NOR network transduction based on connectable and disconnectable conditions (Reference manual of NOR network transduction programs NETTRA-G1 and NETTRA-G2)," UIUCDCS-R-75-698, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Feb. 1975.
[5] J. N. Culliney, H. C. Lai, and Y. Kambayashi, "Pruning procedures for NOR networks using permissible functions (Principles of NOR network transduction programs NETTRA-PG-1, NETTRA-P1, and NETTRA-P2)," UIUCDCS-R-74-690, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Nov. 1974.
[6] D. L. Dietmeyer and P. R. Schneider, "A computer-oriented factoring algorithm for NOR logic design,"IEEE Trans. Electron. Comput., vol. EC-14, pp. 868-874, Dec. 1965.
[7] D. T. Ellis, "A synthesis of combinational logic with NAND or NOR elements,"IEEE Trans. Electron. Comput., vol. EC-14, pp. 701- 705, Oct. 1965.
[8] K. R. Hohulin, "Network transduction programs based on connectable and disconnectable conditions with fan-in and fan-out restrictions (A description of NETTRA-G1-FIFO and NETTRA-G2-FIFO)," UIUCDCS-R-75-719, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Apr. 1975.
[9] K. C. Hu, "NOR(NAND) network design: Error-compensation procedures for fan-in and fan-out restricted networks (NETTRA-E1-FIFO and NETTRA-E2-FIFO)," UIUCDCS-R-77-847, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Jan. 1977.
[10] K. C. Hu, "Level-restricted NOR network transduction procedures," UIUCDCS-R-77-849, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Jan. 1977.
[11] K. C. Hu, "Programming manual for the NOR network transduction system," UIUCDCS-R-77-887, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Aug. 1977.
[12] K. C. Hu and S. Muroga, "NOR(NAND) network transduction system (The principle of NETTRA system)," UIUCDCS-R-77-885, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Aug. 1977.
[13] Y. Kambayashi and J. N. Culliney, "NOR network transduction procedures based on connectable and disconnectable conditions (Principles of NOR network transduction programs NETTRA-G1 and NET-TRA-G2)," UIUCDCS-R-76-841, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Dec. 1976.
[14] Y. Kambayashi, H. C. Lai, J. N. Culliney, and S. Muroga, "NOR network transduction based on error compensation (Principles of NOR network transduction programs NETTRA-E1, NETTRA-E2, NET-TRA-E3)," UIUCDCS-R-75-737, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, June 1975.
[15] Y. Kambayashi, H. C. Lai, and S. Muroga, "Transformations of NOR networks," Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, to be published.
[16] Y. Kambayashi and S. Muroga, "Network transduction based on permissible functions (General principles of NOR network transduction NETTRA programs)," UIUCDCS-R-76-804, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, June 1976.
[17] H. C. Lai, "Program manual: NOR network transduction by generalized gate merging and substitution (Reference manual of NOR network transduction programs NETTRA-G3 and NETTRA-G4)," UIUCDCS-R-75-714, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Apr. 1975.
[18] H. C. Lai and J. N. Culliney, "Program manual: NOR network pruning procedures using permissible functions (Reference manual of NOR network transduction programs NETTRA-PG1, NETTRA-P1, and NETTRA-P2)," UIUCDCS-R-74-686, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Nov. 1974.
[19] H. C. Lai and J. N. Culliney, "Program manual: NOR network transduction based on error compensation (Reference manual of NOR network transduction programs NETTRA-E1, NETTRA-E2, and NETTRA-E3)," UIUCDCS-R-75-732, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, June 1975.
[20] H. C. Lai and Y. Kambayashi, "NOR network transduction by generalized gate merging and substitution procedures (Principles of NOR network transduction programs NETTRA-G3 and NETTRA- G4)," UIUCDCS-R-75-728, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, June 1975.
[21] H. Lee and E. S. Davidson, "A transform for NAND network design,"IEEE Trans. Comput., vol. C-21, pp. 12-20, Jan. 1972.
[22] J. G. Legge, "The design of NOR networks under fan-in and fan-out constaints (A programming manual for FIFOTRAN-G1)," UIUCDCS-R-74-661, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, June 1974.
[23] T. K. Liu, K. R. Hohulin, L. E. Shiau, and S. Muroga, "Optimal one-bit full adders with different types of gates,"IEEE Trans. Comput., vol. C-23, pp. 63-70, Jan. 1974.
[24] G. A. Maley and J. Earle,The Logical Design of Transistor Digital Computers. Englewood Cliffs, NJ: Prentice-Hall, 1963.
[25] S. Muroga, "Logical design of optimal digital networks by integer programming," inAdvances in Information Systems Science, Vol. 3, J. T. Tou, Ed. New York: Plenum, 1970, pp. 283-348, ch. 5.
[26] S. Muroga,Threshold Logic and Its Applications. New York: Wiley, 1971, ch. 14. (Now available from Krieger, Malabar, FL 32950-0007.)
[27] S. Muroga,Logic Design and Switching Theory. New York: Wiley, 1979.
[28] S. Muroga,VLSI System Design. New York: Wiley; 1982.
[29] S. Muroga and H. C. Lai, "Minimization of logic networks under a generalized cost function,"IEEE Trans. Comput., vol. C-25, pp. 893-907, Sept. 1976.
[30] T. Nakagawa, H. C. Lai, and S. Muroga, "Pruning and branching methods for designing optimal networks by the branch-and-bound method," Rep. 471, Dep. Comput. Sci., Univ. Illinois, Urbana, IL, Aug. 1971.Also Int. J. Comput. Inform. Sci., pp. 251-271, Sept. 1974.
[31] T. Nakagawa, H. C. Lai, and S. Muroga, "Design algorithm of optimal NOR networks by the branch-and-bound approach,"Int. J. Comput. Aided Design, Sept. 1989.
[32] B. Plangsiri, "NOR network transduction procedures, 'merging of gates' and 'substitution of gates', for fan-in and fan-out restricted networks (NETTRA-G3-FIFO and NETTRA-PG1-FIFO)," UIUCDCS-R-74-688, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Dec. 1974.
[33] Y. H. Su and C. W. Nam, "Computer-aided synthesis of multiple-output multilevel NAND networks with fan-in and fan-out constraints,"IEEE Trans. Comput., vol. C-20, pp. 1445-1455, Dec. 1971.

Index Terms:
permissible functions; heuristic procedure; logic networks; transduction method; logic circuits; logic design.
Citation:
S. Muroga, Y. Kambayashi, H.C. Lai, J.N. Culliney, "The Transduction Method-Design of Logic Networks Based on Permissible Functions," IEEE Transactions on Computers, vol. 38, no. 10, pp. 1404-1424, Oct. 1989, doi:10.1109/12.35836
Usage of this product signifies your acceptance of the Terms of Use.