![bit funtion on logix pro bit funtion on logix pro](https://www.inadet.com.mx/wp-content/uploads/2021/04/WhatsApp-Image-2021-04-22-at-16.11.21.jpeg)
You are entirely free to do it the old way with 256 rows.
![bit funtion on logix pro bit funtion on logix pro](https://i.ytimg.com/vi/muVX7g5vLqo/maxresdefault.jpg)
How would I, as a student, be expected to devise a new system for a truth table? The answer is, you don’t have to. I felt that this truth table was made only because whoever made it knew that it had to be made this way. This is the exact question I had when I first studied this truth table. Y(AB) = A3B3′ + x3A2B2′ + x3x2A1B1′ + x3x2x1A0B0′Įmploying the same principles we used above, we get the following equation Similarly, deriving equations for the remaining instances, we get the following equation And this entire instance can be written as x3A2B2′. From the equation for A=B above, A3=B3 can be represented as x3. Moving on to the next instance of A>B, we can see that it occurs at A3=B3 and A2>B2. Since there are only 0s and 1s in a binary system. For this to be possible in a binary system, A3 has to be equal to 1, and B3 has to be equal to 0. We find the first instance of A>B at the top of the table where A3>B3. Since there are multiple occasions where this particular condition is high, we will OR (add) each of those individual occasions. We will compare each bit of the two 4-bit numbers, and based on that comparison and the weight of their positions, we will draft a truth table.Ī3B3 A2B2 A1B1 A0B0 A>B AB3 x x x 1 0 0 A3B2 x x 1 0 0 A3=B3 A2B1 x 1 0 0 A3=B3 A2=B2 A1B0 1 0 0 A3=B3 A2=B2 A1=B1 A0B So we will do things a bit differently here. The truth table for a 4-bit comparator would have 4^4 = 256 rows.
BIT FUNTION ON LOGIX PRO HOW TO
The logic circuit of a 2-bit comparator How to design a 4– bit comparator?