Abstract
A redundancy check procedure is presented which is intended to reduce the computation time of the branch- and-bound algorithm for designing minimal NOR networks under various network constraints, such as fan-in, fan-out limitations and level restrictions. Several properties of NOR networks which form the theoretical basis for the redundancy check procedure are also discussed. A computational procedure incorporating some of these properties was implemented and tested. The results show that this procedure is quite effective in reducing the computation time of the branch-and-bound algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Muroga, “Logical design of optimal digital networks by integer programming,” inAdvances in Information System Science, Vol. 3, ed. by J. T. Tou (Plenum Press, NewYork, 1970), pp. 283–348.
S. Muroga,Threshold Logic and Its Applications (Wiley-International, 1971).
S. Muroga and T. Ibaraki,“Design of optimal switching networks by integer programming,”IEEE Trans. on Computers C-21(6):573–582 (1972).
C. R. Baugh, T. Ibaraki, T. K. Liu, and S. Muroga, “Optimum network design using NOR and NOR-AND gates by integer programming,” Report No. 293, Department of Computer Science, University of Illinois, January 1969.
T. K. Liu, K. Hohulin, L. E. Shiau, and S. Muroga, “Logical design of optimal one-bit full adder by integer programming,”IEEE Trans. on Computers C-23(1):63–70 (1974).
E. S. Davidson, “An algorithm for NAND decomposition of combinational switching functions,” Ph.D. dissertation, Department of Electrical Engineering and Coordinated Science Laboratory, University of Illinois, 1968.
T. Nakagawa and H. C. Lai, “A branch-and-bound algorithm for optimal NOR networks (the algorithm description),” Report No. 438, Department of Computer Science, University of Illinois, April 1971.
T. Nakagawa, H. C. Lai, and S. Muroga, “Pruning and branching methods for designing optimal networks by the branch-and-bound method,” Report No. 471, Department of Computer Science, University of Illinois, August 1971.
T. Nakagawa and H. C. Lai, “Reference manual of FORTRAN program ILLOD(NOR-B) for optimal NOR networks,” Report No. 488, Department of Computer Science, University of Illinois, December 1971.
E. Davidson, “An algorithm for NAND decomposition under network constraints,”IEEE Trans. on Computers C-18(12):1098–1109 (1969).
Author information
Authors and Affiliations
Additional information
This work was supported in part by the National Science Foundation under Grant No. NSF GJ-503.
Rights and permissions
About this article
Cite this article
Lai, H.C., Nakagawa, T. & Muroga, S. Redundancy check technique for designing optimal networks by branch-and-bound method. International Journal of Computer and Information Sciences 3, 251–271 (1974). https://doi.org/10.1007/BF00977257
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00977257