Digital Electronics: Integrated Circuits and Digital Logic

Vocabulary flashcards covering topics on Integrated Circuits (ICs), Digital Logic gates, and Boolean Algebra laws.

Integrated Circuit (IC)

A complete electronic circuit fabricated on a single piece of semiconductor material, typically silicon, known as a chip.

Small Scale Integration (SSI)

A scale of IC integration that typically contains up to $12$ gates.

Medium Scale Integration (MSI)

A scale of IC integration that contains between $13$ and $99$ gates.

Large Scale Integration (LSI)

A scale of IC integration that contains between $100$ and $9999$ gates.

Very Large Scale Integration (VLSI)

A scale of IC integration that contains between $10000$ and $99999$ gates.

Ultra Large Scale Integration (ULSI)

A scale of IC integration that contains between $100000$ and $999999$ gates.

Gigascale Integration (GSI)

A scale of IC integration that contains $1000000$ or more gates.

Monolithic IC

An integrated circuit where all components and interconnections are fabricated on a single semiconductor substrate (chip).

Film IC

An integrated circuit where components are formed by depositing thin or thick films of resistive, conductive, or insulating materials on an insulating substrate.

Hybrid (Multichip) IC

An integrated circuit consisting of a combination of monolithic ICs and discrete components mounted on a common substrate.

Analog IC

An integrated circuit that processes and amplifies continuous signals, such as those found in audio amplifiers or radio frequency circuits.

Digital IC

An integrated circuit that processes and operates on discrete signals, typically representing binary values ($0$s and $1$s).

Digital Circuits

Electronic circuits that operate using discrete, quantized values, most commonly representing binary logic levels: a high voltage state ('1') and a low voltage state ('0').

Logic Gates

The fundamental building blocks of digital circuits that perform basic logical operations on one or more binary inputs to produce a single binary output.

AND Gate

A logic gate whose output is '1' only if all inputs are '1'.

OR Gate

A logic gate whose output is '1' if at least one input is '1'.

NOT Gate (Inverter)

A logic gate whose output is the inverse of the input; if the input is '0', the output is '1', and vice-versa.

NAND Gate

A logic gate whose output is '0' only if all inputs are '1' (NOT-AND).

NOR Gate

A logic gate whose output is '1' only if all inputs are '0' (NOT-OR).

XOR Gate (Exclusive OR)

A logic gate whose output is '1' if the inputs are different.

XNOR Gate (Exclusive NOR)

A logic gate whose output is '1' if the inputs are the same.

Truth Table

A systematic way to represent the behavior of a logic gate or digital circuit by listing all possible combinations of input values and the corresponding output value for each combination.

2-Input AND Gate Truth Table

A truth table showing that output Y is 1 only when both Input A and Input B are 1.

Universal Gates

Logic gates (NAND and NOR) that can be used to construct any other logic gate (AND, OR, NOT).

Boolean Algebra

A branch of algebra that deals with variables whose values can only be true or false (typically represented by $1$ and $0$), forming the mathematical foundation for digital logic design.

Boolean Variables

Variables that can take on only one of two distinct values, typically represented as $0$ (False) and $1$ (True).

Identity Law

Boolean algebra rules stating that $A \cdot 1 = A$ and $A + 0 = A$.

Null Law

Boolean algebra rules stating that $A \cdot 0 = 0$ and $A + 1 = 1$.

Idempotent Law

Boolean algebra rules stating that $A \cdot A = A$ and $A + A = A$.

Complement Law

Boolean algebra rules stating that $A \cdot A' = 0$ and $A + A' = 1$.

Commutative Law

Boolean algebra rules stating that $A \cdot B = B \cdot A$ and $A + B = B + A$.

Associative Law

Boolean algebra rules stating that $(A \cdot B) \cdot C = A \cdot (B \cdot C)$ and $(A + B) + C = A + (B + C)$.

Distributive Law

Boolean algebra rules stating that $A \cdot (B + C) = (A \cdot B) + (A \cdot C)$ and $A + (B \cdot C) = (A + B) \cdot (A + C)$.

DeMorgan's Theorems

Theorems stating that the negation of an OR is the AND of the negations, $(A + B)' = A' \cdot B'$, and the negation of an AND is the OR of the negations, $(A \cdot B)' = A' + B'$.

Sum of Products (SOP)

A standard form for Boolean expressions where the expression is an OR of AND terms, with each AND term typically representing a minterm.

Product of Sums (POS)

A standard form for Boolean expressions where the expression is an AND of OR terms, with each OR term typically representing a maxterm.