Show simple item record

dc.contributor.authorMaurer, Peter M.
dc.date.accessioned2009-11-05T16:36:19Z
dc.date.available2009-11-05T16:36:19Z
dc.date.issued2009-11-05T16:36:19Z
dc.identifier.urihttp://hdl.handle.net/2104/5446
dc.description.abstractThe Inversion Algorithm is an event driven algorithm whose performance meets or exceeds that of Levelized Compiled Code simulation, even when the activity rate is unrealistically high. Existing implementations of the Inversion Algorithm are based on the Zero Delay model. This paper presents an implementation which is based on the Unit-Delay model. Although the most basic form of the Inversion Algorithm can be converted to Unit Delay with little difficulty, special considerations must be taken to avoid scheduling conflicts. The main problems discussed in this paper are avoiding scheduling conflicts, and minimizing the amount of storage space required to do so. These problems are made considerably more difficult by the deletion of NOT gates and the collapsing of various connections. These optimizations transform the simulation into a multi-delay simulation under the transport delay model. A complete solution to the scheduling problem is presented under these conditions.en
dc.format.extent129648 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.subjectUnit Delay Simulationen
dc.subjectEvent-Driven Simulationen
dc.subjectDigital Simulationen
dc.titleUnit Delay Scheduling for the Inversion Algorithmen
dc.licenseGPLen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record