• DocumentCode
    3141132
  • Title

    Automatic Generation of Cells for Recurrence Structures

  • Author

    Bilgory, Avlnoam ; Gajski, Daniel D.

  • Author_Institution
    University of Illinois at Urbana-Champaign, Urbana, IL
  • fYear
    1981
  • fDate
    29-1 June 1981
  • Firstpage
    306
  • Lastpage
    313
  • Abstract
    This paper describes a method for automatic translation of functional into structural descriptions for Boolean recurrence systems. The solution of a recurrence system is accomplished by a network that requires at most four different types of cells. Given any Boolean recurrence of any order, the cell generator module defines the Boolean equations of these cells.
  • Keywords
    Boolean-recurrence solvers; gate compilers; logic-design automation; Automation; Capacitance; Computer science; Delay effects; Equations; Logic; Manufacturing processes; Network synthesis; Silicon; Very large scale integration; Boolean-recurrence solvers; gate compilers; logic-design automation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation, 1981. 18th Conference on
  • Type

    conf

  • DOI
    10.1109/DAC.1981.1585368
  • Filename
    1585368
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3141132