Show simple item record

dc.contributor.authorMaurer, Peter M.
dc.date.accessioned2009-11-05T16:45:25Z
dc.date.available2009-11-05T16:45:25Z
dc.date.issued2009-11-05T16:45:25Z
dc.identifier.urihttp://hdl.handle.net/2104/5450
dc.description.abstractThe Inversion Algorithm is an event-driven algorithm, whose performance rivals or exceeds that of Levelized Compiled code simulation, even at activity rates of 50% or more. The Inversion Algorithm has several unique features, the most remarkable of which is the size of the run-time code. The basic Algorithm can be implemented using no more than a page of run-time code, although in practice it is more efficient to provide several different variations of the basic algorithm. The run-time code is independent of the circuit under test, so the algorithm can be implemented either as a compiled code or an interpreted simulator with little variation in performance. Because of the small size of the run-time code, the run-time portions of the Inversion Algorithm can be implemented in assembly language for peak efficiency, and still be retargeted for new platforms with little effort.en
dc.format.extent110069 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.subjectDifferential Simulationen
dc.subjectDigital Simulationen
dc.subjectInversion Algorithmen
dc.titleThe Inversion Algorithm for Digital Simulationen
dc.licenseGPLen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record