An Analysis and Implementation of the Switching Sequence Table Method [1]

This paper details the algorithm implementation of the Switching Sequence Table method in asynchronous sequential circuit Boolean switching system design. The algorithm is theoretically analysed in terms of its computational complexity and validated through actual experiments. It discusses the multidimensional problem of various parameters and their impact on performance. It then presents analytical evidence that reducing this multidimensional problem to a standard, one-dimensional problem is feasible. The authors consider method challenges when implementing computing modules for the Switching Sequence Table method.