Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chin-Heng Liu

dblp:187/4093 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Electronic design automation · 81% Integrated circuit design · 19%
Theoretical computer science
2 papers
Computational complexity · 54% Logic in computer science · 46%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
logic synthesis
0.822020
A New Necessary Condition for Threshold Function Identification · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020
Threshold Function Identification by Redundancy Removal and Comprehensive Weight Assignments · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2019
Electronic design automation › logic synthesis › threshold logic synthesis
threshold function identification
0.822020
A New Necessary Condition for Threshold Function Identification · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020
Threshold Function Identification by Redundancy Removal and Comprehensive Weight Assignments · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2019
Integrated circuit design › digital circuit design › threshold logic
threshold logic gate
0.412019
Threshold Function Identification by Redundancy Removal and Comprehensive Weight Assignments · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2019
Computational complexity
boolean function analysis
0.112020
A New Necessary Condition for Threshold Function Identification · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020
Logic in computer science › algebraic logic › boolean algebra › boolean function representation
threshold logic
0.112019
Threshold Function Identification by Redundancy Removal and Comprehensive Weight Assignments · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2019

Methods — techniques the papers use, named apart from their topics

unateness property · 0.9necessary condition · 0.9weight assignment · 0.8redundancy removal · 0.8
YearPublicationVenuePosition
2020 A New Necessary Condition for Threshold Function Identification
abstract
This article proposes a new necessary condition and the corresponding speedup strategies to the threshold function (TF) identification problem. The state-of-the-art to this identification problem could be very time-consuming when the function-under-identification is a non-TF with the unateness property. The proposed new necessary condition can be seamlessly integrated into this identification algorithm. As compared with the state-of-the-art, the improved identification algorithm with the proposed necessary condition can more effectively and efficiently detect non-TFs. Furthermore, according to the experimental results, the ratio of CPU time overhead in the process of checking the proposed necessary condition for identifying all the 8-input TF is only 0.1%.
Chia-Chun Lin, Chin-Heng Liu, Yung-Chih Chen, Chun-Yao Wang
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
2019 Threshold Function Identification by Redundancy Removal and Comprehensive Weight Assignments
abstract
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.
Chin-Heng Liu, Chia-Chun Lin, Yung-Chih Chen, Chia-Cheng Wu, Chun-Yao Wang, Shigeru Yamashita
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2018 A Hybrid Approach to Equivalent Fault Identification for Verification Environment Qualification
abstract
Fault-based verification technique is a method to qualify a verification environment. The better verification environment can detect output differences between the fault-free and fault-injected circuits with a higher probability. Since different injected faults could cause the same output response under all stimuli, which are called equivalent faults, maximally identifying these equivalent faults can improve the efficiency of verification environment qualification without sacrificing its quality. The 2016 CAD Contest at ICCAD posed the problem of identifying equivalent faults in the circuits. This paper presents our work in the Contest with some improvements.
Chia-Cheng Wu, Tung-Yuan Lee, Yung-An Lai, Hsin-Pei Wang, De-Xuan Ji, Yan-Ping Chang, Teng-Chia Wang, Chin-Heng Liu, Chun-Yao Wang, Yung-Chih Chen
ACM Great Lakes Symposium on VLSI8