You are on page 1of 13

Chapter - Boolean Logic Design

AND A B OR A B X 0 0 0 1 NOT A X = A A X 0 1 1 0

X = AB A B 0 0 1 1 0 1 0 1

X = A +B A B X 0 0 1 1 NOR A B 0 1 0 1 0 1 1 1

NAND A X B X = AB A B 0 0 1 1 0 1 0 1

EOR A B

X 1 1 1 0

X = A+B A B X 0 0 1 1 0 1 0 1 1 0 0 0

X = AB A B X 0 0 1 1 0 1 0 1 0 1 1 0

Boolean Axioms

Idempotent A +A = A Associative A + B + C = A + B + C Commutative A +B = B+ A Distributive A + B C = A + B A + C Identity A +0 = A A 0 = 0 Complement A +A = 1 A A = 0 DeMorgans A + B = A B A B = A + B A = A 1 = 0 A +1 = 1 A 1 = A A B + C = A B + A C A B = B A A B C = A B C A A = A

Example Equation
X = A + B C + A B + C

Write the ladder logic

Some logic form examples

NAND X = A B X = A +B A B X

NOR X = A +B X = A B

EOR X = A B X = A B + A B A B X X

Boolean Example
A = B C D + E + C + F C

Example Description Process Description: A heating oven with two bays can heat one ingot in each bay. When the heater is on it provides enough heat for two ingots. But, if only one ingot is present the oven may become too hot, so a fan is used to cool the oven when it passes a set temperature. Control Description: If the temperature is too high and there is an ingot in only one bay then turn on fan. Define Inputs and Outputs: B1 = bay 1 ingot present B2 = bay 2 ingot present F = fan T = temperature overheat sensor

The equation
F = T B1 B 2

Simplified

Ladder Logic

Simplified Further

Ladder Logic

Circuits can be reverse engineered to Boolean equations


A B C B A C X

And then to Ladder Logic

Simplify the following and write ladder logic


A + B A + B

Simplify the following and write the ladder logic


ABCD + ABCD + A BCD + A BCD

Simplify the following and write the ladder logic


A + B + C + D B + C + A B C + D

Example Case

Problem: Design a controller using an equation that will turn on an output to a cylinder C when only one of two optical sensors, A or B, is on. The system will be disabled if an input switch D is on. Hint: start with a truth table

You might also like