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 条
[41]   Loop-Free Route Updates for Software-Defined Networks [J].
Foerster, Klaus-Tycho ;
Ludwig, Arne ;
Marcinkowski, Jan ;
Schmid, Stefan .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2018, 26 (01) :328-341
[42]   Resilient Network and Loop-Free Forwarding Using Time Synchronization [J].
Varshney, Tunisha ;
Verma, Karan .
OPTICAL AND WIRELESS TECHNOLOGIES, OWT 2017, 2018, 472 :383-389
[43]   Low overhead loop-free routing in wireless sensor networks [J].
Grenoble Alps University, Grenoble Institute of Technology, CNRS Grenoble Informatics Laboratory, Grenoble ;
38000, France .
IEEE Int. Conf. Wirel. Mob. Comput., Netw. Commun., WiMob, 2015, (443-451) :443-451
[44]   An enhanced solution for generating loop-free routes in dynamic networks [J].
Wu, J .
PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2002, :261-265
[45]   Scheduling Loop-free Network Updates: It's Good to Relax! [J].
Ludwig, Arne ;
Marcinkowski, Jan ;
Schmid, Stefan .
PODC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2015, :13-22
[46]   BRIDGE PROTOCOL FOR CREATING A LOOP-FREE TOPOLOGY IN AN EXTENDED LAN [J].
ECONOMOU, EG ;
ROUSSOS, JK ;
PHILOKYPROU, G .
COMPUTER COMMUNICATIONS, 1992, 15 (09) :565-572
[47]   Loop-Free Forwarding Table Updates with Minimal Link Overflow [J].
Shi, Lei ;
Fu, Jing ;
Fu, Xiaoming .
2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, 2009, :2091-+
[48]   Message-efficient dissemination for loop-free centralized routing [J].
Peterson, Haldane ;
Sen, Soumya ;
Chandrashekar, Jaideep ;
Gao, Lixin ;
Guerin, Roch ;
Zhang, Zhi-Li .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2008, 38 (03) :65-74
[49]   Loop-free traffic engineering with path protection in MPLS VPNs [J].
Naraghi-Pour, Mort ;
Desai, Vinay .
COMPUTER NETWORKS, 2008, 52 (12) :2360-2372
[50]   A Tight Lower Bound for Relaxed Loop-Free Updates in SDNs [J].
Zhou, Hao ;
Gao, Xiaofeng ;
Zheng, Jiaqi ;
Chen, Guihai .
2019 39TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2019), 2019, :91-100