Ranga Vemuri
ABSTRACT
The notion of the normal form structural (NFS) implementation of an algorithmic behavioral specification is introduced. The NFS implementation of a behavioral specification is shown to be unique among all the register transfer (RT) level structures implementing the specification. An algorithm to transform a given structure into the equivalent normal form structure is presented. The notion of the NFS implementations is used in proving the completeness of a set of RT-level transformations. On the practical side, the NFS is used as a reference structure with respect to which the performance of other behaviorally equivalent structures is measured.
- M. C. McFarland, "Mathematical Models for Formal Verification a Design Automation System", Ph.D. dissertation, CMU, July 1981.Google Scholar
- W. Rosentiel, "Optimizations in High-level Synthesis", Microprocessing and Microprogramming, pp. 347--352, 1986. Google ScholarDigital Library
- E. A. Snow, "Automation of Module Set Independent Register-Transfer Level Design", Ph.D. dissertation, CMU, April 1978.Google Scholar
- Ranga Vemuri, "A Transformational Approach to Register Transfer Level Design-Space Exploration", Ph.D. Thesis, Case Western Reserve University, January 1989. Google ScholarDigital Library
- Ranga Vemuri, "On the Effectiveness of a System of RT-Level Transformations for Design-Space Exploration", Proc. 32nd Midwest Symposium on circuits and Systems, IEEE-CS press, Aug. 1989.Google Scholar
- Ranga Vemuri, "A Formal Model for Register Transfer Level Structures and Its Applications in Verification and Synthesis", IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, Belgium, Nov 89.Google Scholar
- R. A. Walker and D. E. Thomas, "Design Representation and Transformation in the System Architect's Workbench", ICCAD, pp. 166--169, 1987.Google Scholar
Recommendations
Eager Normal Form Bisimulation
LICS '05: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer ScienceThis paper describes two new bisimulation equivalences for the pure untyped call-by-value ?-calculus, called enf bisimilarity and enf bisimilarity up to ?. They are based on eager reduction of terms to eager normal form (enf), analogously to co-...
SystemCoDesigner—an automatic ESL synthesis approach by design space exploration and behavioral synthesis for streaming applications
With increasing design complexity, the gap from ESL (Electronic System Level) design to RTL synthesis becomes more and more crucial to many industrial projects. Although several behavioral synthesis tools exist to automatically generate synthesizable ...
Comments