Multi-Threshold Element Networks
スポンサーリンク
概要
- 論文の詳細を見る
Any switching function can be realized by a single k-multithreshold element (k-MTE) having a sufficiently large k. However, if for a certain switching function the number of thresholds becomes very large k, then the practical realization of such k-MTE often presents serious difficulties. One alternative to this is to realize the switching function by a p-MTE network in which each MTE has p thresholds (p<k). In this paper, a study of p-MTE networks with different modes of interconnection has been made. Synthesis procedures are developed for a cascade, a 2-level and a feedforward MTE networks in which each MTE has the identical weight vector for the independent (input) variables. The synthesis precedure for a switching function by cascade p-MTE network in which each MTE may have the different weight vector for the inputs has also been given. This procedure converges for realizing any switching function. Finally, the upper bound for the maximum number of p-MTE needed to realize an arbitrary n-argument switching function is shown.
- 山梨大学の論文