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

Harbinder Sikka

dblp:241/4340 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

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

Systems, architecture and hardware · 1

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
1 paper
Electronic design automation · 91% Hardware accelerators and domain-specific architectures · 9%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test
fault coverage
0.412019
High Performance Graph Convolutional Networks with Applications in Testability Analysis · DAC 2019
Electronic design automation
hardware verification and test
0.412019
High Performance Graph Convolutional Networks with Applications in Testability Analysis · DAC 2019
Electronic design automation › hardware verification and test
testability analysis
0.412019
High Performance Graph Convolutional Networks with Applications in Testability Analysis · DAC 2019
Hardware accelerators and domain-specific architectures › machine learning accelerator
graph neural network accelerator
0.112019
High Performance Graph Convolutional Networks with Applications in Testability Analysis · DAC 2019

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

iterative classifier-guided insertion · 0.4graph convolutional network · 0.4
YearPublicationVenuePosition
2019 High Performance Graph Convolutional Networks with Applications in Testability Analysis
abstract
Applications of deep learning to electronic design automation (EDA) have recently begun to emerge, although they have mainly been limited to processing of regular structured data such as images. However, many EDA problems require processing irregular structures, and it can be non-trivial to manually extract important features in such cases. In this paper, a high performance graph convolutional network (GCN) model is proposed for the purpose of processing irregular graph representations of logic circuits. A GCN classifier is firstly trained to predict observation point candidates in a netlist. The GCN classifier is then used as part of an iterative process to propose observation point insertion based on the classification results. Experimental results show the proposed GCN model has superior accuracy to classical machine learning models on difficult-to-observation nodes prediction. Compared with commercial testability analysis tools, the proposed observation point insertion flow achieves similar fault coverage with an 11% reduction in observation points and a 6% reduction in test pattern count.
Yuzhe Ma, Haoxing Ren, Brucek Khailany, Harbinder Sikka, Lijuan Luo, Karthikeyan Natarajan, Bei Yu 0001
DAC4