Εμφάνιση απλής εγγραφής

dc.creatorSimoglou S., Sotiriou C., Blias N.en
dc.date.accessioned2023-01-31T09:56:14Z
dc.date.available2023-01-31T09:56:14Z
dc.date.issued2020
dc.identifier10.1109/ASYNC49171.2020.00008
dc.identifier.isbn9781728154954
dc.identifier.issn15228681
dc.identifier.urihttp://hdl.handle.net/11615/78987
dc.description.abstractIn 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.isoenen
dc.sourceProceedings - International Symposium on Asynchronous Circuits and Systemsen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85091983244&doi=10.1109%2fASYNC49171.2020.00008&partnerID=40&md5=47898f5838bea8522ecceba2d9b13ea8
dc.subjectAsynchronous sequential logicen
dc.subjectEnginesen
dc.subjectErrorsen
dc.subjectTiming circuitsen
dc.subjectAsynchronous circuitsen
dc.subjectCut pointen
dc.subjectGate level simulationen
dc.subjectTiming errorsen
dc.subjectTransistor levelen
dc.subjectUpper Bounden
dc.subjectSPICEen
dc.subjectIEEE Computer Societyen
dc.titleTiming errors in sta-based gate-level simulationen
dc.typeconferenceItemen


Αρχεία σε αυτό το τεκμήριο

ΑρχείαΜέγεθοςΤύποςΠροβολή

Δεν υπάρχουν αρχεία που να σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στις ακόλουθες συλλογές

Εμφάνιση απλής εγγραφής