LOOP-FREE THRESHOLD ELEMENT STRUCTURES

被引:0
作者
MOW, CW
FU, KS
机构
[1] Litton Industries Guidance and Control Systems Division, Computer Laboratory, Woodland Hills., Calif.
[2] Department of Electrical Engineering, Purdue University, Lafayette, Ind.
关键词
D O I
10.1109/T-C.1969.222639
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The paper deals with the problem of “compound” and “cascade threshold” element “synthesis” of an arbitrary Boolean function from the “multithreshold weight threshold vector” (MTWTV). The above synthesis procedure is presented to reveal a unique feature of the multithreshold weight threshold vector, from which several realizations of threshold element nets can be obtained from one of the multithreshold weight threshold vectors. Specifically, two alternative forms of “compound threshold networks” are given, and a “cascade threshold network” is achieved free from constraints on the thresholds of the MTWTV. For the compound synthesis, Boolean functions of n variables can be realized with no more than three logic levels, and the number of logic levels needed for cascade threshold network synthesis is bounded by the number of thresholds in the MTWTV. The number of single threshold elements needed for the synthesis is bounded by the number of thresholds in the MTWTV for all of the realizations. An example is given to illustrate the synthesis procedure which requires no cut and try steps. Finally, threshold network structures corresponding to the 221 equivalence classes of 4-variable functions under the “NPN operations” have been tabulated. Copyright © 1969 by The Institute of Electrical and Electronics Engineers, Inc.
引用
收藏
页码:257 / +
页数:1
相关论文
共 50 条
  • [31] A path-finding algorithm for loop-free routing
    GarciaLunaAceves, JJ
    Murthy, S
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 1997, 5 (01) : 148 - 160
  • [32] A LOOP-FREE ALGORITHM FOR GENERATING THE LINEAR EXTENSIONS OF A POSET
    CANFIELD, ER
    WILLIAMSON, SG
    [J]. ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 1995, 12 (01): : 57 - 75
  • [33] A novel loop-free IP fast reroute algorithm
    Enyedi, Gabor
    Retvari, Gabor
    Cinkler, Tibor
    [J]. DEPENDABLE AND ADAPTABLE NETWORKS AND SERVICES, PROCEEDINGS, 2007, 4606 : 111 - +
  • [34] Routing optimization for IP networks with loop-free alternates
    Hartmann, Matthias
    Hock, David
    Menth, Michael
    [J]. COMPUTER NETWORKS, 2016, 95 : 35 - 50
  • [35] ADDRESSLESS UNITS FOR CARRYING OUT LOOP-FREE COMPUTATIONS
    BLIKLE, A
    [J]. JOURNAL OF THE ACM, 1972, 19 (01) : 136 - &
  • [36] LOOP-FREE ALGORITHMS FOR TRAVERSING BINARY-TREES
    FENNER, TI
    LOIZOU, G
    [J]. BIT, 1984, 24 (01): : 33 - 44
  • [37] Efficient Loop-Free Rerouting of Multiple SDN Flows
    Basta, Arsany
    Blenk, Andreas
    Dudycz, Szymon
    Ludwig, Arne
    Schmid, Stefan
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2018, 26 (02) : 948 - 961
  • [38] THE COMPLEXITY OF THE EQUIVALENCE PROBLEM FOR SIMPLE LOOP-FREE PROGRAMS
    IBARRA, OH
    LEININGER, BS
    [J]. SIAM JOURNAL ON COMPUTING, 1982, 11 (01) : 15 - 27
  • [39] On-demand loop-free routing with link vectors
    Garcia-Luna-Aceves, JJ
    Roy, S
    [J]. 12TH IEEE INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS - PROCEEDINGS, 2004, : 140 - 150
  • [40] A More Efficient Diffusing Update Algorithm For Loop-Free Routing
    Zhao, Chuanqiang
    Liu, Yuanan
    Liu, Kaiming
    [J]. 2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 4081 - 4084