| Efficient circuit partitioning to extend cycle simulation beyond synchronous circuits |
| Full text |
Publisher Site
,
Pdf
(194 KB)
|
| Source
|
International Conference on Computer Aided Design
archive
Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
table of contents
San Jose, California, United States
Pages: 154 - 161
Year of Publication: 1997
ISBN:0-8186-8200-0
|
|
Author
|
|
Charles J. DeVane
|
The MathWorks, Inc., Natick, MA and Viewlogic Systems, Inc., Marlboro, MA
|
|
| Sponsors |
|
| Publisher |
IEEE Computer Society
Washington, DC, USA
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 8, Citation Count: 4
|
|
|
ABSTRACT
Cycle simulation techniques, such as levelized compiled code, can ordinarily be applied only to synchronous designs. They usually cannot be applied to designs containing circuit features like combinational paths, multiple clock domains, generated clocks, asynchronous resets, and transparent latches. This paper presents a novel partitioning algorithm that partitions a non-cycle-simulatable circuit containing these features into sub-circuits that can be cycle simulated. Cycle simulation techniques can be applied to the individual sub-circuits, and the whole collection of sub-circuits can be simulated together using conventional co-simulation techniques. Empirical results demonstrate that this approach brings the benefits of cycle simulation to circuits that were previously impossible to cycle simulate. The partitioning algorithm requires time and space linear in the size of the circuit, and in practice is very fast. We also discuss how the key ideas presented here can be applied to accelerate HDL simulation.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
Zeev Barzilai, J. Lawrence Carter, Barry K. Rosen, and Joseph D. Rutledge. Hss-a high speed simulator. IEEE Transactions on Computer-Aided Design, pages 601- 617, July 1987.
|
 |
3
|
Robert S. French , Monica S. Lam , Jeremy R. Levitt , Kunle Olukotun, A general method for compiling event-driven simulations, Proceedings of the 32nd ACM/IEEE conference on Design automation, p.151-156, June 12-16, 1995, San Francisco, California, United States
[doi> 10.1145/217474.217522]
|
| |
4
|
|
| |
5
|
David M. Lewis. Hierarchical compiled event-driven logic simulation. In Proceedings of the IEEE International Conference on Computer-Aided Design, November 1989.
|
| |
6
|
Patrick C. McGeer , Kenneth L. McMillan , Alexander Saldanha , Alberto L. Sangiovanni-Vincentelli , Patrick Scaglia, Fast discrete function evaluation using decision diagrams, Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, p.402-407, November 05-09, 1995, San Jose, California, United States
|
| |
7
|
L. W. Nagel. Spice2: A comuter program to simulate semiconductor circuits. Technical Report Rep. No ERL-M520, Electronics Research Laboratory, University of California, Berkeley, CA, May 1975.
|
 |
8
|
S. P. Smith , M. R. Mercer , B. Brodk, Demand driven simulation: BACKSIM, Proceedings of the 24th ACM/IEEE conference on Design automation, p.181-187, June 28-July 01, 1987, Miami Beach, Florida, United States
[doi> 10.1145/37888.37915]
|
 |
9
|
L.-T. Wang , N. E. Hoover , E. H. Porter , J. J. Zasio, SSIM: a software levelized compiled-code simulator, Proceedings of the 24th ACM/IEEE conference on Design automation, p.2-8, June 28-July 01, 1987, Miami Beach, Florida, United States
[doi> 10.1145/37888.37889]
|
 |
10
|
|
CITED BY 4
|
|
|
|
|
Valeria Bertacco , Maurizio Damiani , Stefano Quer, Cycle-based symbolic simulation of gate-level synchronous circuits, Proceedings of the 36th ACM/IEEE conference on Design automation, p.391-396, June 21-25, 1999, New Orleans, Louisiana, United States
|
|
|
|
|
|
|
|