Welcome to the resource topic for 2023/201
Title:
DenseQMC: an efficient bit-slice implementation of the Quine-McCluskey algorithm
Authors: Aleksei Udovenko
Abstract: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 GitHub - hellman/Quine-McCluskey: DenseQMC: A bit-slice implementation of the Quine-McCluskey algorithm .
ePrint: https://eprint.iacr.org/2023/201
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .