Scribd
Upload
1 views

Binary Logic and Logic Gates

The document provides an overview of binary logic and logic gates, including truth tables for various logic operations such as AND, OR, and XOR. It discusses the laws of binary logic, the addition of binary numbers, and the design of a circuit for automatic coolant application based on specific temperature and speed conditions. Additionally, it presents the simplification of logic expressions and illustrates the application of these concepts through a numerical example.

Uploaded by

Safal Raj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
1 views

Binary Logic and Logic Gates

The document provides an overview of binary logic and logic gates, including truth tables for various logic operations such as AND, OR, and XOR. It discusses the laws of binary logic, the addition of binary numbers, and the design of a circuit for automatic coolant application based on specific temperature and speed conditions. Additionally, it presents the simplification of logic expressions and illustrates the application of these concepts through a numerical example.

Uploaded by

Safal Raj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Binary logic and logic gates

Signals / variables which can take up only 2 values - Binary variables


Truth tables for some logic operations

A B A’ B’ A+B A.B AꚚB A#B


1 1 0 0 1 1 0 0
1 0 0 1 1 0 1 1
0 1 1 0 1 0 1 1
0 0 1 1 0 0 0 1

A’ – Complement of A
A+B – A OR B
A.B – A AND B
AꚚB – A XOR B
A#B – Arbitrary logic operator (A.B)’
Binary logic operations

 Law of complements  Commutative laws  Distributed laws

 a + a’ = 1 a+b=b+a  a . (b + c) = a. b + a . c
 a . a’ = 0 a.b=b.a
a+1=1
a.0=0
a.1=a
 Associative laws  De Morgan’s laws
a+0=a
 a + (b . c) = (a + b) . (a + c)  (a + b)’ = a’ . b’
 (a . b)’ = a’ + b’
Symbols of logic gates
Addition of two bits Truth tables

 Decimal  Binary Carry Sum A B Sum Carry

1+1=2  1 + 1 = 10 20 × 0 + 21 × 1 = 2 1 1 1 0
1+0=1  1 + 0 = 01 20 × 1 + 21 × 0 = 1 1 0 0 1
0+1=1  0 + 1 = 01 20 × 1 + 21 × 0 = 1 0 1 0 1
0+0=0  0 + 0 = 00 20 × 0 + 21 × 0 = 0 0 0 0 0
Sum Carry
Truth tables
A B A.B AꚚB
1 1 1 0
1 0 0 1
0 1 0 1
0 0 0 0
An half adder can add two bits
Addition of three bits Truth tables
Sum Carry A B C Sum Carry
 Decimal  Binary
1 1 1 1 1
 1 + 1 + 1 = 3 = 11 0
2 ×1+2 ×1=3 1
1 1 0 0 1
 1 + 1 + 0 = 2 = 10 20 × 0 + 21 × 1 = 2
 1 + 0 + 1 = 2 = 10 20 × 0 + 21 × 1 = 2 1 0 1 0 1
 1 + 0 + 0 = 1 = 01 20 × 1 + 21 × 0 = 1 1 0 0 1 0
 0 + 1 + 1 = 2 = 10 20 × 0 + 21 × 1 = 2 0 1 1 0 1
 0 + 1 + 0 = 1 = 01 20 × 1 + 21 × 0 = 1 0 1 0 1 0
 0 + 0 + 1 = 1 = 01 20 × 1 + 21 × 0 = 1
0 0 1 1 0
 0 + 0 + 0 = 0 = 00 20 × 0 + 21 × 0 = 0
0 0 0 0 0
Addition of three bits(contd.)

 Sum takes a value 1 if


 The method is called ‘sum of product terms’
 A and B and C are all 1 or
 A is 1 and B is 0 and C is 0 or
Hence, Sum = A.B.C + A.B’.C’+A’.B.C’ + A’.B’.C
 A is 0 and B is 1 and C is 0 or
 A is 0 and B is 0 and C is 1

 Carry takes a value 1 if

 A and B and C are all 1 or Hence, Carry = A.B.C + A.B.C’+A.B’.C + A’.B.C


 A is 1 and B is 1 and C is 0 or
 A is 1 and B is 0 and C is 1 or
 A is 0 and B is 1 and C is 1
Addition of three bits(contd.)

 Simplification of carry

Carry = A.B.C + A.B.C’+A.B’.C + A’.B.C

= A.B.C + A.B.C’+ A.B.C + A.B’.C + A.B.C + A’.B.C

= A.B. (C + C’) + A.C. (B + B’) + B.C. (A + A’) (Distributed laws)

= A.B.1 + A.C.1 + B.C.1 (Law of complements)

= A.B + A.C + B.C


Addition of three bits(contd.)

 Simplification of sum

Sum = A.B.C + A.B’.C’+A’.B.C’ + A’.B’.C

= A. (B.C + B’.C’) + A’. (B.C’ + B’.C) (Distributed laws)

Now
(B.C’ + B’.C) = B Ꚛ C And

(B.C + B’.C’)’ = (B.C)’. (B’.C’)’ = (B’ + C’).(B + C) (De Morgan’s laws)

= B.B’ + B.C’ + B’.C + C.C’ = 0 + B.C’ + B’.C + 0 = B.C’ + B’.C = B Ꚛ C

Hence, (B.C + B’.C’) = (B Ꚛ C)’

A. (B.C + B’.C’) + A’. (B.C’ + B’C) = A.(B Ꚛ C)’ + A’.(B Ꚛ C) = A Ꚛ B Ꚛ C


Numerical (Binary logic)

 There is a grinding machine in which coolant is to be applied automatically if


 The temperature ≥ 600C, surface speed ≥ 20 m/s, and table feed ≤ 15 m/min
 The temperature ≥ 600C, surface speed < 20 m/s, and table feed >15 m/min
 The temperature ≥ 600C, surface speed ≥ 20 m/s, and table feed >15 m/min
If the sensors are set up in such a way that the following variables

A = 0 when temperature < 600C


= 1 when temperature ≥ 600C

B = 0 when surface speed < 20 m/s


= 1 when surface speed ≥ 20 m/s

C = 0 when table feed ≤ 15 m/min


=1 when table feed >15 m/min

 Make circuit which would send one output signal S = 1 when coolant is supposed to be applied, otherwise
0
Solution to the Numerical Problem
Truth tables
A B C Output
Output (S) = A.B.C + A.B.C’+ A.B’.C
1 1 1 1
1 1 0 1 = A.B.C + + A.B’.C + A.B.C’ + A.B.C
1 0 1 1
= A.C. (B+B’) + A.B. (C+C’)
1 0 0 0
0 1 1 0 = A.C + A.B
0 1 0 0
= A. (B + C)
0 0 1 0
0 0 0 0

You might also like