According to our discussion in the class there isn’t exact way to find out hazard free function minimal form using Quine-McCluskey algorithm. But many exact logic minimization algorithms are based on the Quine-McCluskey algorithm. The Quine-McCluskey algorithm solves the two-level logic minimization problem.
It has three steps:
1. Generate the prime implicants of a function;
2. Construct a prime implicant table; and
3. Generate a minimal cover of this table.
In this paper by Steven M. Nowick you can find one of the two-level hazard-free logic minimization algorithm which is based on the constrained version of the Quine-McCluskey algorithm. Only certain implicants may be included in a hazard-free cover, and covering requirements are more restrictive.
It has three steps:
1. Generate the prime implicants of a function;
2. Construct a prime implicant table; and
3. Generate a minimal cover of this table.
In this paper by Steven M. Nowick you can find one of the two-level hazard-free logic minimization algorithm which is based on the constrained version of the Quine-McCluskey algorithm. Only certain implicants may be included in a hazard-free cover, and covering requirements are more restrictive.
۱ نظر:
"it seems with knowing effect of fan-in on the w/l size can guess changes of VIH, VIL ,VOL , VOH and at the end noise margin telorance,
ofcourse with need to consider worst state "
ارسال یک نظر