dc.creator | Simoglou S., Sotiriou C., Blias N. | en |
dc.date.accessioned | 2023-01-31T09:56:14Z | |
dc.date.available | 2023-01-31T09:56:14Z | |
dc.date.issued | 2020 | |
dc.identifier | 10.1109/ASYNC49171.2020.00008 | |
dc.identifier.isbn | 9781728154954 | |
dc.identifier.issn | 15228681 | |
dc.identifier.uri | http://hdl.handle.net/11615/78987 | |
dc.description.abstract | In this paper, we demonstrate that conventional STA-based, functional, gate-level simulation of asynchronous circuits with cycles is only as accurate as the STA engine used. This is, firstly because cycle cuts create local slew errors at cutpoints, and secondly because slew propagation may not be upper-bounded across multiple cut points in the same cycle. The use of an ASTA engine, which does not cut cycles, and properly bounds slews across cycles is a possible solution, which can indeed serve as an upper bound over SPICE, transistor level similations. We contrast STA and ASTA-based SDF-Annotated gate-level simulation results, with transistor level SPICE results, and demonstrate the impact of timing errors. © 2020 IEEE. | en |
dc.language.iso | en | en |
dc.source | Proceedings - International Symposium on Asynchronous Circuits and Systems | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85091983244&doi=10.1109%2fASYNC49171.2020.00008&partnerID=40&md5=47898f5838bea8522ecceba2d9b13ea8 | |
dc.subject | Asynchronous sequential logic | en |
dc.subject | Engines | en |
dc.subject | Errors | en |
dc.subject | Timing circuits | en |
dc.subject | Asynchronous circuits | en |
dc.subject | Cut point | en |
dc.subject | Gate level simulation | en |
dc.subject | Timing errors | en |
dc.subject | Transistor level | en |
dc.subject | Upper Bound | en |
dc.subject | SPICE | en |
dc.subject | IEEE Computer Society | en |
dc.title | Timing errors in sta-based gate-level simulation | en |
dc.type | conferenceItem | en |