How should I consider signals with thresholds when reducing Boolean expressions?

24 Views Asked by At

Let's say I have a simple logic circuit comprised of three signals (A, B, and C) that go through two AND gates and one OR gate as follows:

$$Q = (AC)+(BC)$$

But C will have different thresholds depending on whether it's ANDed with A or B. Arbitrarily, let's say the threshold of C is 5 when ANDed with A, and 2 when ANDed with B. How do I represent this in my truth table? Should I consider C as two separate signals?

My actual circuit diagram is much more complicated, and "C" feeds into a number of different AND gates. The difficulty I'm facing is when I reduce the much more complex Boolean function. I don't want to erroneously factor out "C" from my equations if really I should be considering every instance where I've assigned a threshold as a separate, specific signal. In other words, should I really consider my function to be more along the lines of

$$Q=(AD)+(BE)$$

What would my corresponding truth table look like?