Boolean Algebra & Combinational Circuits -

1. Boolean Algebra

Boolean Algebra is the mathematical foundation of digital electronics. It operates on binary variables and logical operations, enabling the analysis and design of digital circuits.

Key Concept: All digital circuits can be represented and simplified using Boolean expressions.

Basic Operations

AND (·) – Output is 1 only if all inputs are 1
OR (+) – Output is 1 if any input is 1
NOT (¯) – Inverts the input

Important Boolean Laws

Law	Expression
Identity	A + 0 = A
Null	A · 0 = 0
Idempotent	A + A = A
Complement	A + Ā = 1
De Morgan	(AB)̄ = Ā + B̄

Boolean Algebra Playground

Basic Operation

A B Operation

Boolean Expression Simplification

Boolean expression simplification reduces the number of logic gates required to implement a circuit. A simpler expression results in lower hardware cost, lower power consumption, and higher reliability.

Goal: Convert a complex Boolean expression into an equivalent but simpler form using Boolean laws or identities.

Common Simplification Rules

A + A = A
A · A = A
A + Ā = 1
A · Ā = 0
A(B + C) = AB + AC
(AB)̄ = Ā + B̄ (De Morgan)

Boolean Expression Trainer

Enter input values and observe how the Boolean expression evaluates. Use this to understand operator behavior and simplification logic.

Expression

F = A · B + A · B̄

A B

Simplification:
F = A(B + B̄) = A · 1 = A

2. Combinational Circuits

A combinational circuit produces outputs based solely on current inputs. There is no memory or feedback.

General Form: Output = f (Present Inputs)

Design Steps

Problem definition
Truth table creation
Boolean expression derivation
Simplification
Gate-level implementation

Half Adder

Adds two single-bit binary numbers.

A	B	Sum	Carry
0	0	0	0
0	1	1	0
1	0	1	0
1	1	0	1

Sum = A ⊕ B
Carry = A · B

Full Adder

Adds three binary bits including carry input.

A	B	Cin	Sum	Cout
0	0	0	0	0
1	1	1	1	1

Sum = A ⊕ B ⊕ Cin
Carry = AB + ACin + BCin

Adder Simulator

Half Adder

A B

Full Adder

A B Cin

Ripple Carry Adder (RCA)

A Ripple Carry Adder is a combinational circuit used to add multi-bit binary numbers. It is constructed by connecting multiple Full Adders in series.

Key Idea:
The carry output of each Full Adder becomes the carry input of the next stage. This carry propagates (ripples) through the circuit.

Structure

Built using multiple Full Adders
Each Full Adder handles one bit
Carry propagates from LSB to MSB

Limitation

Propagation delay increases with number of bits
Slower compared to Carry Look-Ahead Adder

4-Bit Ripple Carry Adder Simulator

This simulator demonstrates how carries propagate across Full Adders.

Inputs

A (4-bit) B (4-bit)

Note:
Addition is performed from LSB → MSB, with carry rippling forward.