• DocumentCode
    2890698
  • Title

    Calculating resettability and reset sequences

  • Author

    Pixley, C. ; Beihl, G.

  • Author_Institution
    Microelectronics & Computer Technology Corp., Austin, TX, USA
  • fYear
    1991
  • fDate
    11-14 Nov. 1991
  • Firstpage
    376
  • Lastpage
    379
  • Abstract
    A synchronous sequential design is resettable if there is a finite sequence of primary input vectors (called a reset or synchronizing sequence) and a single state (called a reset state) such that application of the reset sequence to any initial state of the design drives the design into the reset state. New, efficient algorithms are presented to decide if a design is essentially and actually resettable, to find essential and actual reset sequences, to find the set of essential reset states and an actual reset state, and to check that an alleged essential or actual reset sequence essentially or actually resets a design. These algorithms are based on the results of a theory of design equivalence presented by C. Pixley (1990), and C. Pixley and G. Beihl (1991). The algorithms are implemented in the MCC CAD Sequential Equivalence Tool and future optimizations among well-established lines promise greater speed and applicability to much larger designs.<>
  • Keywords
    logic CAD; logic testing; sequential circuits; MCC CAD Sequential Equivalence Tool; design equivalence; finite sequence; primary input vectors; reset sequences; resettability; synchronous sequential design; Algorithm design and analysis; Boolean functions; Circuit synthesis; Circuit testing; Clocks; Computational modeling; Drives; Hardware; Logic design; Sequential analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer-Aided Design, 1991. ICCAD-91. Digest of Technical Papers., 1991 IEEE International Conference on
  • Conference_Location
    Santa Clara, CA, USA
  • Print_ISBN
    0-8186-2157-5
  • Type

    conf

  • DOI
    10.1109/ICCAD.1991.185280
  • Filename
    185280