Logic Gates: Concepts, Truth Tables and Applications

Logic gates are the building blocks of digital electronics. They perform logical operations on input signals to produce an output.

In digital systems, signals are represented in binary form:

0 → LOW (False)
1 → HIGH (True)

Logic gates are used in computers, calculators, memory devices, and control systems. They operate based on Boolean algebra, introduced by George Boole.

What are Logic Gates?

A logic gate is an electronic circuit that:

Takes one or more binary inputs
Performs a logical operation
Produces a single binary output

Digital systems work with discrete signals (0 and 1), not continuous values.

Basic Logic Gates

1. AND Gate

Operation: Multiplication (·)

Boolean Expression: Y = A · B

Working:

Output is 1 only when both inputs are 1

A	B	Y = A·B
0	0	0
0	1	0
1	0	0
1	1	1

Real-life analogy: A bulb glows only if both switches are ON

2. OR Gate

Operation: Addition (+)

Boolean Expression: Y = A + B

Working

Output is 1 if at least one input is 1

A	B	Y = A + B
0	0	0
0	1	1
1	0	1
1	1	1

3. NOT Gate (Inverter)

Boolean Expression: Y = A̅

Working

It reverses the input

A	Y = NOT A
0	1
1	0

Universal Gates

Universal gates can be used to construct any other logic gate.

1. NAND Gate

Combination: AND + NOT

Expression: Y = (A · B)̅

A	B	Y
0	0	1
0	1	1
1	0	1
1	1	0

Important: Entire digital circuits can be built using only NAND gates

2. NOR Gate

Combination: OR + NOT

Expression: Y = (A + B)̅

A	B	Y
0	0	1
0	1	0
1	0	0
1	1	0

Also a universal gate

Derived Logic Gates

1. XOR Gate (Exclusive OR)

Expression: Y = A ⊕ B

Output is 1 when the inputs are different

A	B	Y
0	0	0
0	1	1
1	0	1
1	1	0

Used in adders, comparators, and error detection

2. XNOR Gate

Expression: Y = (A ⊕ B)̅

Output is 1 when the inputs are the same

A	B	Y
0	0	1
0	1	0
1	0	0
1	1	1

Boolean Algebra Laws

These laws help simplify logic expressions.

1. Identity Law

A + 0 = A

A · 1 = A

2. Null Law

A + 1 = 1

A · 0 = 0

3. Idempotent Law

A + A = A

A · A = A

4. Complement Law

A + A̅ = 1

A · A̅ = 0

5. De Morgan’s Theorems

(A + B)̅ = A̅ · B̅

(A · B)̅ = A̅ + B̅

Truth Tables

A truth table lists all possible input combinations and their outputs.

Used for:

Understanding gate behavior
Verifying expressions
Designing circuits

Logic Gates Using Transistors

Logic gates are built using transistors.

Transistor ON → Output = 1
Transistor OFF → Output = 0

Modern processors contain millions of transistors, forming complex logic circuits.

Applications of Logic Gates

Computers & CPUs → Perform all calculations
Arithmetic circuits → Adders, subtractors
Memory devices → Flip-flops, registers
Control systems → Traffic lights, alarms
Communication systems → Signal processing

Logic Gate Combinations

By combining gates, we can build:

Half Adder
Full Adder
Multiplexer
Decoder
Encoder

Half Adder (Important Concept)

A half adder adds two binary digits.

Outputs:

Sum = A ⊕ B
Carry = A · B

Solved Questions

1. Output of AND followed by NOT

A = 1, B = 0

Step 1: AND

A · B = 0

Step 2: NOT

Output = 1

2. Which gate gives output HIGH when inputs are different?

XOR Gate

3. Prove NAND acts as NOT gate

If inputs are same:

Y = (A · A)̅ = A̅

NAND behaves like NOT gate

4. Find Y = (A + B)̅ + AB for A = 1, B = 1

A + B = 1

(A + B)̅ = 0

AB = 1

Y = 0 + 1 = 1

5. Gate giving output HIGH only when both inputs are LOW

NOR Gate

Expression: Y = (A + B)̅

Conclusion

Logic gates form the foundation of all digital systems. From simple operations to complex processors, everything is built using combinations of these basic gates.

Understanding logic gates is essential for mastering digital electronics, computer architecture, and modern technology.