Paper 2023/201
DenseQMC: an efficient bit-slice implementation of the Quine-McCluskey algorithm
, SnT, University of LuxembourgAbstract
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 .
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint.
- Keywords
- Boolean minimizationTwo-level minimizationQuine-McCluskeyImplementationBit-slice
- Contact author(s)
- aleksei @ affine group
- History
- 2023-02-20: approved
- 2023-02-15: received
- See all versions
- Short URL
- https://ia.cr/2023/201
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/201,
author = {Aleksei Udovenko},
title = {DenseQMC: an efficient bit-slice implementation of the Quine-McCluskey algorithm},
howpublished = {Cryptology ePrint Archive, Paper 2023/201},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/201}},
url = {https://eprint.iacr.org/2023/201}
}
