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

Chun-Jung Chen

dblp:66/1730 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2009
—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 · 67% Performance modeling and evaluation · 33%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
circuit simulation
0.011995
Relaxation-based transient sensitivity computations for MOSFET circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1995
Electronic design automation › circuit simulation
relaxation-based simulation
0.011995
Relaxation-based transient sensitivity computations for MOSFET circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1995
Performance modeling and evaluation › statistical analysis › sensitivity analysis
transient sensitivity analysis
0.011995
Relaxation-based transient sensitivity computations for MOSFET circuits · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1995

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

waveform relaxation · 0.0pruning · 0.0iterated timing analysis · 0.0
YearPublicationVenuePosition
2009 A Shuffled Message-passing Decoding Method for Memory-based LDPC Decoders
abstract
The convergence speed of shuffled message passing decoding (MPD) is faster than that of standard two phase message passing (TPMP) decoding. Due to complex memory access and requirement of large storage space, the shuffled MPD is not suitable for hardware implementation especially for high-rate LDPC codes. In this paper, we propose a modified shuffled MPD which can achieve a similar convergence speed but with reduced complexity in memory access and storage space as compared to the conventional shuffled MPD. We implement a rate-5/6 LDPC decoder based on the proposed algorithm.
Yeong-Luh Ueng, Chung-Jay Yang, Chun-Jung Chen
ISCAS3
2003 Towards Error-Free and Personalized Web-Based Courses
abstract
Providing appropriate learning content to each student is a key to the success of a Web-based distance learning system. Student test results can be an important feedback for the instructor to re-evaluate the course content. A test result feedback (TRF) model that analyzes the relationship between student learning time and corresponding test result is developed The model can give the instructor crucial information for course content refinement. It can also suggest the student with a personalized make-up course or appropriate advanced courses for further study. All these can be done automatically without interfering the student learning and/or increasing the instructor working load In our design, all Web courses are dynamically assembled with selected course units.
Hui-Huang Hsu, Chun-Jung Chen, Wen-Pin Tai
AINA2
1995 Relaxation-based transient sensitivity computations for MOSFET circuits
abstract
In this paper, we propose two new methods for computing the transient sensitivities of large scale MOSFET circuits, which exploit the relaxation-based circuit simulation techniques, the waveform relaxation (WR) method and the iterated timing analysis (ITA) method. Sufficient conditions are stated and proven, which are quite mild for MOSFET circuits, for convergence of these new methods. A pruning scheme, which prunes the sensitivity circuits, takes the positions of the design parameters as well as the outputs of interest into account and saves any redundant subcircuit computation even though that subcircuit may not be latent. By modifying the original WR and ITA algorithms, we also present practical computational algorithms which can process multiple design parameters. These practical algorithms retain most of the structures of the original algorithms, which can easily be implemented into available relaxation-based circuit simulators. These new methods have been implemented and the experimental results for several circuits are shown to demonstrate their effectiveness.>
Chun-Jung Chen, Wu-Shiung Feng
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1991 Transient Sensitivity Computation for Waveform Relaxation Based Timing Simulation
abstract
A method to compute the transient sensitivities for waveform relaxation (WR)-based circuit simulation is presented. By partitioning the circuit into subcircuits, one computes the transient sensitivities for each 'active' subcircuit and then propagates the calculated results to the succeeding subcircuits to iterate for the entire sensitivities. Experimental results show that the proposed method provides sensitivity waveforms which are very close to those obtained by the direct method in a reasonably short time, and works well even though the circuit contains feedback loops.>
Chun-Jung Chen, Jyuo-Min Shyu, Wu-Shiung Feng
ICCAD1