简化布尔前pression i.t.o发生变化 [英] Simplify boolean expression i.t.o variable occurrence
问题描述
如何简化一个给定的boolean前pression与许多变量(> 10),从而使每个变量的出现的次数被最小化
How to simplify a given boolean expression with many variables (>10) so that the number of occurrences of each variable is minimized?
在我的情况下,一个变量的值,必须考虑短暂的,即,具有重新计算每个访问(同时仍然静止当然)。我为此需要试图解决的功能前,以尽量减少次数的变量已被评估的数目。
In my scenario, the value of a variable has to be considered ephemeral, that is, has to recomputed for each access (while still being static of course). I therefor need to minimize the number of times a variable has to be evaluated before trying to solve the function.
考虑函数
F(A,B,C,D,E,F)=(ABC)+(ABCD)+(ABEF)
f(A,B,C,D,E,F) = (ABC)+(ABCD)+(ABEF)
使用递归的分配和吸收法一个用大作
Recursively using the distributive and absorption law one comes up with
F'(A,B,C,E,F)= AB(C +(EF))
f'(A,B,C,E,F) = AB(C+(EF))
我现在不知道是否有一个算法或方法来解决这个任务,在最短的运行时间。
I'm now wondering if there is an algorithm or method to solve this task in minimal runtime.
在本例中只使用奎因 - 麦克罗斯基上面给出
Using only Quine-McCluskey in the example above gives
F'(A,B,C,E,F)=(ABEF)+(ABC)
f'(A,B,C,E,F) = (ABEF) + (ABC)
这是不是最佳我的情况。被保存的假设,与QM第一简化,然后用代数类似上面,以进一步降低是最优的?
which is not optimal for my case. Is it save to assume that simplifying with QM first and then use algebra like above to reduce further is optimal?
推荐答案
它具有布尔电路的多层次的设计。
It features multi-level design of boolean circuits.
有关你的榜样,输入和输出如下所示:
For your example, input and output look as follows:
这篇关于简化布尔前pression i.t.o发生变化的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!