• DocumentCode
    2891252
  • Title

    Observability relations and observability don´t cares

  • Author

    Savoj, H. ; Brayton, R.K.

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
  • fYear
    1991
  • fDate
    11-14 Nov. 1991
  • Firstpage
    518
  • Lastpage
    521
  • Abstract
    The observability relation O(x,z) or the Boolean relation provides a description of all the flexibility one has in implementing a Boolean network N. The authors represent and use this flexibility in a logic synthesis system by adding a single output node to the Boolean network N. The node function for the new node is O(x,z). The newly constructed network N´ (called the observability network) has only one output and computes 1 for every input x. It is shown that the observability don´t cares (ODCs) for a node y/sub i/ in N´ provide the maximum flexibility for implementing y/sub i/ and subsume the flexibility obtained for y/sub i/ in N even with don´t cares provided at each output. This gives rise to new methods for computing complete ODCs for N´ and hence for N.<>
  • Keywords
    Boolean functions; logic CAD; observability; Boolean network; Boolean relation; logic synthesis system; observability don´t cares; observability relations; Automatic test pattern generation; Computer networks; Contracts; Flexible printed circuits; Logic functions; Minimization methods; Multiprocessor interconnection networks; Network synthesis; Observability; Testing;
  • 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.185320
  • Filename
    185320