본문 바로가기
  • Home

An Improved Quine-McCluskey Algorithm for Circuit Minimization

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2014, 19(3), pp.109-117
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

ABSTRACT

This paper revises the Quine-McCluskey Algorithm to circuit minimization problems. Quine-McCluskey method repeatedly finds the prime implicant and employs additional proceduressuch as trial-and-error, branch-and-bound, and Petrick’s method as a means of circuitminimization. The proposed algorithm, on the contrary, produces an implicant chart beforehand tosimplify the search for the prime implicant. In addition, it determines a set cover to streamline thesearch for 1st and 2nd essential prime implicants. When applied to 3-variable and 4-variableexperimental data, the proposed algorithm has indeed proved to obtain the optimal solutions muchmore simply and accurately than the Quine-McCluskey method.

Citation status

* References for papers published after 2023 are currently being built.