• DocumentCode
    3263915
  • Title

    Reliability and fault-masking in n-variable NOR trees

  • Author

    Dunning, Marion ; Kolman, Bernard

  • fYear
    1965
  • fDate
    6-8 Oct. 1965
  • Firstpage
    126
  • Lastpage
    142
  • Abstract
    This paper presents an algorithm for finding, for any given Boolean function, a least cost three-level AND-NOT network having uncomplemented inputs where the cost criterion is the number of gates. The approach taken is similar to the Quine-MeCluskey algorithm for two level AND/OR network synthesis.
  • Keywords
    Boolean functions; Cost function; Network synthesis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Switching Circuit Theory and Logical Design, 1965. SWCT 1965. Sixth Annual Symposium on
  • Conference_Location
    Ann Arbor, MI, USA
  • Type

    conf

  • DOI
    10.1109/FOCS.1965.24
  • Filename
    5397250
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3263915