초록

용어보기논문에서 용어와 풀이말을 자동 추출한 결과로, 시범 서비스 중입니다. AI-Helper

Abstract ▼ AI-Helper

Threshold Logic Gate(TLG) which composes Threshold Logic Network(TLN) can implement linear separable Boolean functions. Futhermore, to implement linearly nonseparable function into TLN, firstly the function must be decomposed into unate subfunctions. And, these unate function must be decomposed int...

Threshold Logic Gate(TLG) which composes Threshold Logic Network(TLN) can implement linear separable Boolean functions. Futhermore, to implement linearly nonseparable function into TLN, firstly the function must be decomposed into unate subfunctions. And, these unate function must be decomposed into linearly separable subfunctions. However, the existing methods could not decompose the function into the optimal number of linearly separable subfunctions. In this paper we have suggested an algorithm for decomposing a function that is linearly nonseparable into the optimal number of unate subfunctions We have proposed a method to construct a unate check table which can easily determine whether the function is unate We have also suggested another algorithm that decomposes the unate but linearly nonseparable functions into the optimal number of linear separable subfunctions And, we have proposed a method to constuct a partial order table and a weight-threshold table which can easily assign the value of weights and threshold to determine if the function is linearly seaprable. Experimental results using the algorithms proposed in this paper have shown that the any given function can be implemented into two layer TLN with the optimal number of TLGs. Especially, we have taken the don't care terms, which have been largly ignored m the existing methods, to yield a TLN with even more optimal number of TLG.