Boolean logic concept
Boolean logic is a mathematical system in which variables take one of two logical values, commonly represented as TRUE and FALSE or 1 and 0. It provides formal methods for describing conditions, logical relationships, and decision-making operations. In digital electronics, Boolean values are associated with distinguishable electrical states interpreted by circuits as binary signals.
Binary logical values
0
Represents the logical value FALSE in conventional positive logic.
1
Represents the logical value TRUE in conventional positive logic.
Physical interpretation
Digital circuits represent logical states using voltage ranges or other physical signal states. A logical zero and logical one do not necessarily correspond to one exact voltage each; actual circuits define acceptable voltage ranges.
Fundamental boolean operations
AND
Symbol
A · B
Meaning
Produces TRUE only when both input values are TRUE.
Truth table
| A | B | Output |
|---|---|---|
0 | 0 | 0 |
0 | 1 | 0 |
1 | 0 | 0 |
1 | 1 | 1 |
OR
Symbol
A + B
Meaning
Produces TRUE when at least one input value is TRUE.
Truth table
| A | B | Output |
|---|---|---|
0 | 0 | 0 |
0 | 1 | 1 |
1 | 0 | 1 |
1 | 1 | 1 |
NOT
Symbol
¬A or A̅
Meaning
Produces the opposite logical value of its input.
Truth table
| A | Output |
|---|---|
0 | 1 |
1 | 0 |
XOR
Symbol
A ⊕ B
Meaning
Produces TRUE when the two input values are different.
Truth table
| A | B | Output |
|---|---|---|
0 | 0 | 0 |
0 | 1 | 1 |
1 | 0 | 1 |
1 | 1 | 0 |
NAND
Symbol
¬(A · B)
Meaning
Produces the opposite output of an AND operation.
Truth table
| A | B | Output |
|---|---|---|
0 | 0 | 1 |
0 | 1 | 1 |
1 | 0 | 1 |
1 | 1 | 0 |
NOR
Symbol
¬(A + B)
Meaning
Produces the opposite output of an OR operation.
Truth table
| A | B | Output |
|---|---|---|
0 | 0 | 1 |
0 | 1 | 0 |
1 | 0 | 0 |
1 | 1 | 0 |
XNOR
Symbol
¬(A ⊕ B)
Meaning
Produces TRUE when the two input values are equal.
Truth table
| A | B | Output |
|---|---|---|
0 | 0 | 1 |
0 | 1 | 0 |
1 | 0 | 0 |
1 | 1 | 1 |
Boolean algebra laws
Identity laws
A + 0 = A
A · 1 = A
Null laws
A + 1 = 1
A · 0 = 0
Idempotent laws
A + A = A
A · A = A
Complement laws
A + ¬A = 1
A · ¬A = 0
Commutative laws
A + B = B + A
A · B = B · A
Associative laws
(A + B) + C = A + (B + C)
(A · B) · C = A · (B · C)
Distributive laws
A · (B + C) = (A · B) + (A · C)
A + (B · C) = (A + B) · (A + C)
Absorption laws
A + (A · B) = A
A · (A + B) = A
De morgans laws
¬(A · B) = ¬A + ¬B
¬(A + B) = ¬A · ¬B
Logic gates
A logic gate is an electronic circuit that implements a Boolean operation. Gates are commonly constructed using transistors and are combined to create more complex digital circuits. NAND and NOR are called universal gates because either one can be used alone as a complete basis for implementing Boolean functions.
Combinational circuits
Meaning
Combinational circuits produce outputs determined by their current input values, without storing a previous internal state.
Examples
Half adders and full adders
Multiplexers and demultiplexers
Encoders and decoders
Comparators
Arithmetic logic units
Sequential circuits
Meaning
Sequential circuits produce outputs based on current inputs and stored internal state. They use memory elements and may be controlled by clock signals.
Examples
Latches
Flip-flops
Registers
Counters
Finite-state controllers
Importance
Sequential logic makes it possible to construct systems that remember previous inputs, track execution states, and coordinate operations over time.
Digital system design
Digital system design involves converting functional requirements into Boolean expressions, simplifying those expressions, constructing logic circuits, and evaluating their behavior. Designers use truth tables, Boolean algebra, Karnaugh maps, state diagrams, hardware description languages, and simulation tools.
Logic simplification
Boolean expressions can often be simplified without changing their logical behavior. Simplification may reduce the number of gates, signal paths, circuit area, power consumption, and propagation delay. Karnaugh maps and algorithmic minimization methods such as Quine-McCluskey are used for particular classes of logic-minimization problems.
Hardware description languages
Languages such as Verilog and VHDL describe digital hardware behavior and structure. They allow designers to model, simulate, synthesize, and verify digital circuits before or during physical implementation.
Advanced topics
Boolean function minimization.
Combinational and sequential circuit analysis.
Finite-state machine design.
Clocking, timing constraints, and propagation delay.
Setup time and hold time.
Synchronous and asynchronous digital design.
Programmable logic devices and FPGA architectures.
Formal verification of digital hardware.
Low-power and fault-tolerant digital circuit design.