Asummability testing

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.