
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S. Muroga, Y. Kambayashi, H.C. Lai, J.N. Culliney, "The Transduction MethodDesign of Logic Networks Based on Permissible Functions," IEEE Transactions on Computers, vol. 38, no. 10, pp. 14041424, October, 1989.  
BibTex  x  
@article{ 10.1109/12.35836, author = {S. Muroga and Y. Kambayashi and H.C. Lai and J.N. Culliney}, title = {The Transduction MethodDesign of Logic Networks Based on Permissible Functions}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {10}, issn = {00189340}, year = {1989}, pages = {14041424}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.35836}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  The Transduction MethodDesign of Logic Networks Based on Permissible Functions IS  10 SN  00189340 SP1404 EP1424 EPD  14041424 A1  S. Muroga, A1  Y. Kambayashi, A1  H.C. Lai, A1  J.N. Culliney, PY  1989 KW  permissible functions; heuristic procedure; logic networks; transduction method; logic circuits; logic design. VL  38 JA  IEEE Transactions on Computers ER   
[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 allinteger algorithm to design optimum logic networks,"Oper. Res., pp. 10901096, JulyAug. 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 NETTRAG1 and NETTRAG2)," UIUCDCSR75698, 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 NETTRAPG1, NETTRAP1, and NETTRAP2)," UIUCDCSR74690, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Nov. 1974.
[6] D. L. Dietmeyer and P. R. Schneider, "A computeroriented factoring algorithm for NOR logic design,"IEEE Trans. Electron. Comput., vol. EC14, pp. 868874, Dec. 1965.
[7] D. T. Ellis, "A synthesis of combinational logic with NAND or NOR elements,"IEEE Trans. Electron. Comput., vol. EC14, pp. 701 705, Oct. 1965.
[8] K. R. Hohulin, "Network transduction programs based on connectable and disconnectable conditions with fanin and fanout restrictions (A description of NETTRAG1FIFO and NETTRAG2FIFO)," UIUCDCSR75719, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Apr. 1975.
[9] K. C. Hu, "NOR(NAND) network design: Errorcompensation procedures for fanin and fanout restricted networks (NETTRAE1FIFO and NETTRAE2FIFO)," UIUCDCSR77847, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Jan. 1977.
[10] K. C. Hu, "Levelrestricted NOR network transduction procedures," UIUCDCSR77849, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Jan. 1977.
[11] K. C. Hu, "Programming manual for the NOR network transduction system," UIUCDCSR77887, 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)," UIUCDCSR77885, 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 NETTRAG1 and NETTRAG2)," UIUCDCSR76841, 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 NETTRAE1, NETTRAE2, NETTRAE3)," UIUCDCSR75737, 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)," UIUCDCSR76804, 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 NETTRAG3 and NETTRAG4)," UIUCDCSR75714, 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 NETTRAPG1, NETTRAP1, and NETTRAP2)," UIUCDCSR74686, 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 NETTRAE1, NETTRAE2, and NETTRAE3)," UIUCDCSR75732, 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 NETTRAG3 and NETTRA G4)," UIUCDCSR75728, 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. C21, pp. 1220, Jan. 1972.
[22] J. G. Legge, "The design of NOR networks under fanin and fanout constaints (A programming manual for FIFOTRANG1)," UIUCDCSR74661, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, June 1974.
[23] T. K. Liu, K. R. Hohulin, L. E. Shiau, and S. Muroga, "Optimal onebit full adders with different types of gates,"IEEE Trans. Comput., vol. C23, pp. 6370, Jan. 1974.
[24] G. A. Maley and J. Earle,The Logical Design of Transistor Digital Computers. Englewood Cliffs, NJ: PrenticeHall, 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. 283348, ch. 5.
[26] S. Muroga,Threshold Logic and Its Applications. New York: Wiley, 1971, ch. 14. (Now available from Krieger, Malabar, FL 329500007.)
[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. C25, pp. 893907, Sept. 1976.
[30] T. Nakagawa, H. C. Lai, and S. Muroga, "Pruning and branching methods for designing optimal networks by the branchandbound method," Rep. 471, Dep. Comput. Sci., Univ. Illinois, Urbana, IL, Aug. 1971.Also Int. J. Comput. Inform. Sci., pp. 251271, Sept. 1974.
[31] T. Nakagawa, H. C. Lai, and S. Muroga, "Design algorithm of optimal NOR networks by the branchandbound approach,"Int. J. Comput. Aided Design, Sept. 1989.
[32] B. Plangsiri, "NOR network transduction procedures, 'merging of gates' and 'substitution of gates', for fanin and fanout restricted networks (NETTRAG3FIFO and NETTRAPG1FIFO)," UIUCDCSR74688, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, Dec. 1974.
[33] Y. H. Su and C. W. Nam, "Computeraided synthesis of multipleoutput multilevel NAND networks with fanin and fanout constraints,"IEEE Trans. Comput., vol. C20, pp. 14451455, Dec. 1971.