• DocumentCode
    1118335
  • Title

    A Method for Obtaining SPOOF´s

  • Author

    Si, Siu-chong ; Susskind, Alfred K.

  • Author_Institution
    Department of Electrical Engineering, Lehigh University
  • Issue
    5
  • fYear
    1975
  • fDate
    5/1/1975 12:00:00 AM
  • Firstpage
    560
  • Lastpage
    562
  • Abstract
    A compatibility relationship on network paths is defined in such a way that the maximal compatibles are isomorphic to the products in the "structure and parity-observing output function" (SPOOF), a subscripted Boolean expression for the network output that uniquely specifies the network structure. For a given network, the path compatibility relations are easy to find, as are the maximal compatibles and hence the SPOOF for the network output. Because the collection of all the path compatibility relations, conveniently displayed in matrix form, completely characterizes the network, the compatibility matrix can be used for a variety of purposes.
  • Keywords
    Compatibility, maximum compatibles, logic-network representation, SPOOF, sum-of-products form, diagnostics, fault testing.; Boolean algebra; Boolean functions; Complex networks; Computational complexity; Computer displays; Design automation; Labeling; Logic testing; Redundancy; Terminology; Compatibility, maximum compatibles, logic-network representation, SPOOF, sum-of-products form, diagnostics, fault testing.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/T-C.1975.224260
  • Filename
    1672853