Three-Valued Simulation with the Inversion Algorithm

dc.contributor.authorMaurer, Peter M.
dc.date.accessioned2009-11-05T16:40:07Z
dc.date.available2009-11-05T16:40:07Z
dc.date.issued2009-11-05T16:40:07Z
dc.description.abstractThe Inversion Algorithm is an event-driven logic simulation technique that is competitive with Levelized Compiled Code Simulation. Previous versions of the Inversion Algorithm have been limited to purely binary simulation. The algorithm presented here extends the Inversion Algorithm to three-valued simulation while preserving the desirable properties of the two-valued algorithm. Because of the richer transformation structure used in three-valued simulation, the scheduling technique is significantly more complex than that of the two-valued algorithm. The procedure for collapsing simultaneous events is also significantly more complex. Once a three-valued net achieves a stable binary value, it is possible to replace the three-valued simulation with a more efficient two-valued simulation. Experimental data shows that the three-valued algorithm is also competitive with levelized compiled code simulation.en
dc.format.extent278126 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/2104/5447
dc.language.isoen_US
dc.licenseGPLen
dc.subjectThree-Valued Simulationen
dc.subjectDigital Simulationen
dc.titleThree-Valued Simulation with the Inversion Algorithmen
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Inv3v.pdf
Size:
271.61 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.96 KB
Format:
Item-specific license agreed upon to submission
Description: