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

Tjahjadi Wongsonegoro

dblp:32/2370 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1998
—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 · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware simulation
functional simulation
0.011998
Hybrid Techniques for Fast Functional Simulation · DAC 1998
Electronic design automation › hardware verification and test
hardware verification
0.011998
Hybrid Techniques for Fast Functional Simulation · DAC 1998
Electronic design automation
logic synthesis
0.011998
Hybrid Techniques for Fast Functional Simulation · DAC 1998

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

compiled code simulation · 0.0BDD-based simulation · 0.0
YearPublicationVenuePosition
1998 Hybrid Techniques for Fast Functional Simulation
abstract
W e implement and experiment with techniques for the functional simulation of very large digital systems. We consider techniques that are a hybrid of classical compiled code simulation and recent branching program based simulation in order to resolve memory performance problems inherent to BDD based cycle simulation. Specifically, predefined functional units (“macros”) are extracted from the circuit and evaluated directly instead of building BDDs for them. The functionality of those macros, such as multipliers, filters, etc., can in turn be verified by simulation of their gate-level implementations respectively or by formal verification techniques. Our results demonstrate that this approach leads to considerably faster simulation.
Yufeng Luo, Tjahjadi Wongsonegoro, Adnan Aziz
DAC2