A novel approach for the identification of totally symmetric Boolean functions in the application of efficient system design

Identification of totally symmetric function (TSF) is one of the important methods to achieve an efficient system design with minimized cost. Finding TSF is sometimes very useful in the application like VLSI testing, logic and physical deign, cryptology etc. apart from its wide use in optimization problems. McCluskey had already established the method of decomposition to compute TSF. Later Biswas came up with an enhanced approach using the method of ordered partition, but the method suffers from excessive and complex computation for functions with large number of variables. We, in this paper, claim that some of Biswas's assertions for finding TSF and its related theorems are incorrect and also logically prove our claim. We also propose a new efficient and simpler solution for finding TSF in much fewer steps than Biswas's method. Result and examples show that the proposed technique works significantly faster than the Biswas's method with the gain of 43% in computational speed.