DenseQMC: an efficient bit-slice implementation of the Quine-McCluskey algorithm

Autor:	Udovenko, Aleksei
Rok vydání:	2023
Předmět:	Computer Science - Data Structures and Algorithms
Druh dokumentu:	Working Paper
Popis:	This note describes a new efficient bit-slice implementation DenseQMC of the Quine-McCluskey algorithm for finding all prime implicants of a Boolean function in the dense case. It is practically feasible for n <= 23 when run on a common laptop or for n <= 27 when run on a server with 1 TiB RAM. This note also outlines a very common mistake in the implementations of the Quine-McCluskey algorithm, leading to a quadratic slowdown. An optimized corrected implementation of the classic approach is also given (called SparseQMC). The implementation is freely available at https://github.com/hellman/Quine-McCluskey . Comment: 14 pages, 2 figures, 1 table, 4 algorithms, 2 footnotes
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2302.10083 Zobrazit plný text záznamu View this record from Arxiv