• DocumentCode
    981437
  • Title

    Asummability testing

  • Author

    Sarje, Anil K.

  • Author_Institution
    University of Roorkee, Department of Electronics & Communication Engineering, Roorkee, India
  • Volume
    18
  • Issue
    22
  • fYear
    1982
  • Firstpage
    938
  • Lastpage
    940
  • Abstract
    Sarje and Biswas have developed an algorithm for generating pairs of minterms forming a given 2-sum. In the letter this procedure has been generalised for obtaining k-summable k-tuples. This simple process for generating k-summable k-tuples basically requires generation of 2-summable pairs. Having obtained these k-tuples, it is a trivial matter to test k-asummability of switching functions.
  • Keywords
    switching functions; 2-summable pairs; k-assumability; k-summable k-tuples; pairs of minterms; switching functions;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19820644
  • Filename
    4246989
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=981437