Parallelised Algorithm of Isolated Minterm Detection for Logic Function Simplification

This study compares serial and parallel implementation of isolated minterm detection algorithms. Isolated minterms are detected from 10 different functions. Each function has different sized Karnaugh maps (Kmaps). Both serial and parallel implementations detected same isolated minterms but parallel implementation of algorithm runs faster than serial one. We presented “Finding isolated minterms in simplification of logic functions” in our previous work [1]. In this study, we developed the algorithm, parallelised this algorithm and compare computation times on different benchmarks. 10 different sized functions are tested with both algorithms. Results revealed that parallelised algorithms works faster than serial algorithm especially for big sized logic functions.