Abstract

This paper presents an algorithm for two-level Boolean minimization (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are generated bottom-up, the proposed method uses a top-down approach. Thus, instead of increasing the dimensionality of implicants by omitting literals from their terms, the dimension of a term is gradually decreased by adding new literals. The method is advantageous especially for functions with many input variables (up to thousands) and with only few care terms defined, where other minimization tools are not applicable because of the long runtime. The method has been tested on several different kinds of problems and the results were compared with ESPRESSO.

Keywords

Cite this article

@article{cai-1238,
  author  = {Petr Fišer and Jan Hlavička},
  title   = {BOOM --- A Heuristic Boolean Minimizer},
  journal = {Computing and Informatics},
  volume  = {22},
  number  = {1},
  pages   = {19--51},
  year    = {2003},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2003/1/boom-a-heuristic-boolean-minimizer/}
}
Download .bib