Threshold Function Identification by Redundancy Removal and Comprehensive Weight Assignments

The identification of threshold function (TF), which determines whether a Boolean function can be represented by an linear threshold logic gate (LTG) or not, is a fundamental but important task in the theories of threshold logic. In this paper, we propose a more efficient and effective algorithm of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computer-aided design of integrated circuits and systems 2019-12, Vol.38 (12), p.2284-2297
Hauptverfasser: Liu, Chin-Heng, Lin, Chia-Chun, Chen, Yung-Chih, Wu, Chia-Cheng, Wang, Chun-Yao, Yamashita, Shigeru
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The identification of threshold function (TF), which determines whether a Boolean function can be represented by an linear threshold logic gate (LTG) or not, is a fundamental but important task in the theories of threshold logic. In this paper, we propose a more efficient and effective algorithm of TF identification by constructing the system of irredundant inequalities and adjusting the weight assignment comprehensively. This is the first non-ILP-based approach that is able to identify all the eight-input TFs. The experimental results demonstrated that the proposed approach is more effective than all the existing non-ILP-based approaches and the LTGs obtained by the proposed approach are optimal for near 100% cases. For TFs with 9-15 inputs, the proposed approach can identify 100 000 randomly generated TFs as well in a reasonable CPU time.
ISSN:0278-0070
1937-4151
DOI:10.1109/TCAD.2018.2878181