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 条
  • [21] Loop-Free Rerouting of Multiple Policies With Overlaps
    Yu, Jinping
    Bi, Jingping
    Zhang, Guoqiang
    Fan, Xinxin
    Li, Zhongcheng
    IEEE COMMUNICATIONS LETTERS, 2018, 22 (07) : 1370 - 1373
  • [22] Loop-free snakes for highly irregular object shapes
    Ji, LL
    Yan, H
    PATTERN RECOGNITION LETTERS, 2002, 23 (05) : 579 - 591
  • [23] Loop-free Markov chains as determinantal point processes
    Borodin, Alexei
    ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES, 2008, 44 (01): : 19 - 28
  • [24] On providing fast protection with remote loop-free alternates
    Csikor, Levente
    Retvari, Gabor
    TELECOMMUNICATION SYSTEMS, 2015, 60 (04) : 485 - 502
  • [25] Distributed fast loop-free transition of routing protocols
    Bekono, Nina
    El Rachkidy, Nancy
    Guitton, Alexandre
    2017 IEEE 86TH VEHICULAR TECHNOLOGY CONFERENCE (VTC-FALL), 2017,
  • [26] On the Plane Geometry Design Method of the Loop-free Hyperbolic Single-layer Cable Structures
    Renjie Liu
    Jiajia Cao
    Hang Zhao
    Suduo Xue
    Guangyong Wang
    Jin Liang
    KSCE Journal of Civil Engineering, 2023, 27 : 4381 - 4391
  • [27] A path-finding algorithm for loop-free routing
    GarciaLunaAceves, JJ
    Murthy, S
    IEEE-ACM TRANSACTIONS ON NETWORKING, 1997, 5 (01) : 148 - 160
  • [28] A LOOP-FREE ALGORITHM FOR GENERATING THE LINEAR EXTENSIONS OF A POSET
    CANFIELD, ER
    WILLIAMSON, SG
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 1995, 12 (01): : 57 - 75
  • [29] A novel loop-free IP fast reroute algorithm
    Enyedi, Gabor
    Retvari, Gabor
    Cinkler, Tibor
    DEPENDABLE AND ADAPTABLE NETWORKS AND SERVICES, PROCEEDINGS, 2007, 4606 : 111 - +
  • [30] On-demand loop-free routing with link vectors
    Garcia-Luna-Aceves, JJ
    Roy, S
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2005, 23 (03) : 533 - 546