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

Bong-Hee Park

dblp:54/635 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1993
—ORCID · none

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

Systems, architecture and hardware · 3 · 2 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 › fault simulation
concurrent fault simulation
0.011993
Divergence and scheduling in functional level concurrent fault simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Electronic design automation › hardware verification and test
fault simulation
0.011993
Divergence and scheduling in functional level concurrent fault simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Electronic design automation
hardware verification and test
0.011993
Divergence and scheduling in functional level concurrent fault simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993

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

scheduling · 0.0divergence · 0.0
YearPublicationVenuePosition
1993 Divergence and scheduling in functional level concurrent fault simulation
abstract
Two important components of the concurrent simulation algorithm are divergence and scheduling. The effects of timing specifications in functional modules on divergence and scheduling are examined, and an efficient method for performing these operations is proposed. >
O. Y. Song, Bong-Hee Park, Prem R. Menon
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
1991 Robustly Scan-Testable CMOS Sequential Circuits
abstract
In this paper, two methods of applying two-pattern tests for stuck-open faults in scan-testable CMOS sequential circuits are presented. These methods require shifting in only one pattern and require no special latches in the scan chain. Sufficient conditions for 110bust testability of all single FET stuck-open faults and design techniques for robustly scan-testable CMOS sequential circuits are presented. These techniques lead to realizations with at most two additional inputs and some additional FETS in the first-level gates.
Bong-Hee Park, Prem R. Menon
ITC1
1990 Design of scan-testable CMOS sequential circuits
abstract
It is shown that the detectability of stuck-open faults in CMOS sequential circuits with scan paths containing ordinary shift register latches depends on the state assignment used. A method by which any state table can be realized by a circuit that is scan testable for stuck-open faults is presented. Tests can be applied to these circuits by shifting in only one vector per test, reducing the test application time. The proposed method is applied to five state tables from the MCNC Logic Synthesis and Optimization Benchmarks. It is found that the overhead of the method is in the range of 14% to 29%.>
Bong-Hee Park, Prem R. Menon
ITC1