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.

Mohan Harihara

dblp:52/770 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · none

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

Systems, architecture and hardware · 2 · 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
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
hardware verification and test
0.011994
Redundancy identification and removal in combinational circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Electronic design automation
logic synthesis
0.011994
Redundancy identification and removal in combinational circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Electronic design automation › hardware verification and test
testability improvement
0.011994
Redundancy identification and removal in combinational circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994

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

circuit structure analysis · 0.0
YearPublicationVenuePosition
1994 Redundancy identification and removal in combinational circuits
abstract
Identification and removal of redundancy in digital circuits is important for improving their testability as well as reducing their area. This paper presents a method of identifying and removing redundancy in combinational circuits by analyzing circuit structure. Experimental results indicate that the method is quite efficient in execution time, but may not identify all undetectable faults. It is expected to be suitable for integration into a logic synthesis system. It can also be used as a preprocessor for a test pattern generation program or for a test pattern generation based redundancy removal program.>
Prem R. Menon, Hitesh Ahuja, Mohan Harihara
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
1989 Identification of undetectable faults in combinational circuits
abstract
Identification of undetectable faults is essential for preventing test invalidation due to the occurrence of such faults, and for improving the efficiency of test generation. Methods for identifying undetectable faults in combinational circuits by analyzing regions between fanout stems and reconvergent gates are presented. These methods have been successful in identifying many of the undetectable faults in several benchmark circuits, without test generation.>
Mohan Harihara, Prem R. Menon
ICCD1