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

Shung-Chih Chen

dblp:64/3442 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2010
—ORCID · none

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

Systems, architecture and hardware · 6 · 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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test › fault simulation
diagnostic fault simulation
0.011997
Diagnostic fault simulation for synchronous sequential circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997
Electronic design automation › hardware verification and test
fault simulation
0.011997
Diagnostic fault simulation for synchronous sequential circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997
Electronic design automation
hardware verification and test
0.011997
Diagnostic fault simulation for synchronous sequential circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997
Electronic design automation › hardware verification and test
sequential circuit testing
0.011997
Diagnostic fault simulation for synchronous sequential circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997

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

indistinguishability fault list · 0.0distributed simulation · 0.0
YearPublicationVenuePosition
2010 A low-power IP design of Viterbi decoder with dynamic threshold setting
abstract
In this paper, a low-power design of Viterbi decoder is presented. Based on the adaptive Viterbi algorithm, we use a dynamic setting method to set various threshold values for different decoding stages under a particular SNR and efficient reduce the average number of survivor paths. Furthermore, a flexible soft intellectual property core and an auxiliary software system for low-power Viterbi decoder are proposed. In the VLSI realization, we apply the clock-gating technique to disable the activation of registers for nonsurvivor paths. Hence, the power consumption can be reduced. Compared with others, our design requires the lower power consumption for the same SNR condition.
Yi-Ming Lin, Wan-Ching Liu, Li-Yuan Chang, Chih-Yuan Lien, Pei-Yin Chen, Shung-Chih Chen
ISCAS6
1997 Serial diagnostic fault simulation for synchronous sequential circuits
Shung-Chih Chen, Jer-Min Jou
Integr.1
1997 Diagnostic fault simulation for synchronous sequential circuits
abstract
In this paper, a time and memory-efficient diagnostic fault simulator for sequential circuits is first presented. A distributed diagnostic fault simulator is then presented based on the sequential algorithm to improve the speed of the diagnostic process. In the sequential diagnostic fault simulator, the number of fault-pair output response comparisons has been minimized by using an indistinguishability fault list that stores the faults that are indistinguishable from each fault. Due to the symmetrical relationship of the fault-pair distinguishability, fault list sizes are reduced. Therefore, the different diagnostic measures of a given test set can be generated very quickly using a small amount of memory. To further speed up the process of finding the indistinguishable fault list for each fault, a distributed approach is proposed and developed. The major idea for this approach is that each processor constructs the indistinguishable fault lists for a certain percentage of faults only. Experimental results show that the sequential diagnostic fault simulator runs faster and uses less memory than a previously developed one and that the distributed algorithm even achieves superlinear speedup for a very large sequential benchmark circuit, s35932. To the authors' knowledge, no distributed diagnostic fault simulation system for sequential circuits has been proposed before.
Shung-Chih Chen, Jer-Min Jou
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1995 Distributed Diagnostic Fault Simulation for Synchronous Sequential Circuits by Dynamic Fault Partitioning
abstract
In this paper, a distributed diagnostic fault simulation for sequential circuits by dynamic fault partitioning is proposed, in which the indistinguishable faults for all the detectable faults are obtained from different machines. Several ISCAS89 benchmark circuits have been experimented on. For a circuit s35932, less than one hour of CPU time is spent by using 4 SUN SPARC stations II.
Jer-Min Jou, Shung-Chih Chen
ISCAS2
1994 A fast and memory-efficient diagnostic fault simulation for sequential circuits
Jer-Min Jou, Shung-Chih Chen
ICCAD2
1994 A Super Fast & Memory Efficient Diagnostic Simulation Algorithm for Combinatorial Circuits
abstract
In this paper, we present an efficient diagnostic simulation method for combinational circuits. Two concepts are incorporated in this method. We adopt the critical line concept so that only stems, instead of all the faults, need to record the primary output responses and introduce the parallel simulation concept to propagate the effects of all the stems simultaneously. With these two approaches, our diagnostic simulator is efficient in speed and memory usage compared to an existed one.>
Jer-Min Jou, Shung-Chih Chen, Ren-Der Chen
ISCAS2