University of SaskatchewanHARVEST
  • Login
  • Submit Your Research
  • About
    • About HARVEST
    • Guidelines
    • Browse
      • All of HARVEST
      • Communities & Collections
      • By Issue Date
      • Authors
      • Titles
      • Subjects
      • This Collection
      • By Issue Date
      • Authors
      • Titles
      • Subjects
    • My Account
      • Login
      JavaScript is disabled for your browser. Some features of this site may not work without it.
      View Item 
      • HARVEST
      • Electronic Theses and Dissertations
      • Graduate Theses and Dissertations
      • View Item
      • HARVEST
      • Electronic Theses and Dissertations
      • Graduate Theses and Dissertations
      • View Item

      Frontiers For High-Level Synthesis of Digital Circuits

      Thumbnail
      View/Open
      Ghatraju_Laksmikanth_1997_sec.pdf (12.40Mb)
      Date
      1997-04
      Author
      Ghatraju, Laksmikanth
      Type
      Thesis
      Degree Level
      Doctoral
      Metadata
      Show full item record
      Abstract
      This thesis presents a novel approach to the synthesis of combinational and sequential digital circuits from recursive behavioral specifications based on the functional programming paradigm. Recursion removal is accomplished by computing the fixpoints of recursion equations. The techniques used for computing the fixpoints are based on domain theory and frontiers algorithms. Two-level combinational logic synthesis is a direct consequence of the application of the frontiers algorithm, which derives a correct sum-of-products expression. Multi-level logic synthesis is based on the iterative approach used for computing the fixpoints. Algorithms for common sub-expression identification and derivation of factored forms are presented. These algorithms rely on the frontiers approach, further strengthening the choice of a semantics-based approach. Sequential circuits are modeled as finite state machines. Sequential circuit synthesis uses the techniques established for combinational logic synthesis to derive the computational elements needed to realize the corresponding finite state machine. A significant advantage of the approach used here is that the structure of recursion in the original specification is immaterial for hardware synthesis, i.e. any recursive function can be synthesized without the use of a stack. Since the techniques used are semantics-based, synthesis from two denotationally equivalent specifications always results in the same two-level hardware.
      Degree
      Doctor of Philosophy (Ph.D.)
      Department
      Computer Science
      Program
      Computer Science
      Supervisor
      McCrosky, C.
      Copyright Date
      April 1997
      URI
      http://hdl.handle.net/10388/11618
      Collections
      • Graduate Theses and Dissertations
      University of Saskatchewan

      University Library

      © University of Saskatchewan
      Contact Us | Disclaimer | Privacy