Combinational and Sequential Circuits

Components like transistors, resistors, capacitors, and diodes are combined to create circuits. These circuits can have multiple inputs and outputs and can be interconnected to form larger systems.

A circuit that has one or more outputs whose value depends only on the input values. These circuits have no memory and their output is determined by the current input state.

A circuit where the output depends on both the current input and the previous state of the circuit. They have memory and can store information. The outputs of these circuits can be modified by the input sequence and are often governed by a clock signal.

A discrete variable in a circuit represented by a specific voltage level. These can be inputs, outputs, or internal connections within the circuit.

A logical operation that gives the opposite value of an input. For example, the complement of 'true' is 'false' and vice versa.

A variable or its complement that appears in a Boolean expression.

A term in a Boolean expression that, if true, guarantees the truth of the entire expression. If any term is true, the output will be true.

A term in a Boolean expression that is formed by ANDing together all variables or their complements. For example, AB, aB, Ab, ab.

A Boolean expression that represents the logical OR operation between two variables, A and B. It's expressed as F(A,B) = A + B.

A method for simplifying complex Boolean expressions by expressing them as a sum (OR operation) of product terms (multiple variables ANDed together).

A method for simplifying Boolean expressions where the expression is represented as a product (AND operation) of sum terms (multiple variables ORed together).

A standard form of a Boolean expression that represents the output based on the index of the minterms that produce a '1' output. It's written as F(A,B) = å(1, 3).

A standard form of a Boolean expression that represents the output based on the index of the maxterms that produce a '0' output. It's written as F(A,B) = Π(0, 2).

Mathematical rules that define the behavior of Boolean operations. They're essential for simplifying and manipulating Boolean expressions.

A set of rules derived from the axioms of Boolean algebra that simplify Boolean expressions by replacing certain patterns with equivalent but simpler expressions.

A theorem in Boolean algebra that states that double inverting a variable returns the original variable. Expressed as !!A = A.

A specific type of Boolean circuit used to select the most significant active input out of multiple binary inputs. It generates a binary output with the same magnitude as the most significant input.

A technique used in logic circuit design to simplify Boolean expressions by representing them as a sum of products or product of sums.

A process of manipulating logic diagrams by adding or removing negation symbols (bubbles) on inputs or outputs, based on De Morgan's theorem.

A type of logic circuit that implements the NOT operation, inverting the output signal. It can be represented by a circle on a logic gate.

A logic gate that produces a '1' (true) output only when both inputs are '0' (false), and a '0' (false) output when either input or both inputs are '1' (true).

A logic gate that produces a '1' (true) output only when both inputs are '1' (true), and a '0' (false) output when either input or both inputs are '0' (false).

A logic gate with two inputs that produces a '1' (true) output only when the inputs are different, meaning one is '0' (false) and the other is '1' (true).

A logic gate with a single input and a single output, producing the same output as the input. Its function is to pass the signal without modification.

A visual method for simplifying Boolean expressions, especially for finding the Sum of Products (SOP) form. It uses a table where each cell represents a specific combination of input values, and '1's indicate the desired output.

A 2x2 table where each cell represents one combination of input values (A & B). '1's indicate a true output. It's used to simplify Boolean functions.

A circuit that selects one of several inputs based on the value of a control or select signal. Think of it like a switch that chooses which input to pass through.

A 'select' signal that determines which input is passed through a multiplexer. It acts as a control switch.

A circuit having N inputs and 2N outputs. Only one output is active at a time, corresponding to the specific combination of inputs. It can be pictured as a set of lights, where only one light is on at a time.

A term used to describe an output signal where only one output is active at a given time, while all other outputs are inactive. It's often used in Decoders.

The time delay between the change in input and the change in output of a circuit. It's usually measured in picoseconds (ps).

The worst-case delay in a circuit. It's the longest time it takes for the output to change in response to an input change.

The best-case delay in a circuit. It's the shortest time it takes for the output to change in response to an input change.

A situation where a single input state transition can unintentionally trigger multiple output transitions, creating a temporary glitch in the circuit.

A type of truth table used for combinational logic circuits, often with several inputs. Each row represents a unique combination of inputs, and the columns represent outputs.

An entry in a combination table that represents a condition where the output value doesn't matter. It's often used to simplify the table.

A Boolean expression that represents a condition where the output is true, regardless of the value of some variables. For example, 'AB' is a prime implicant for the expression 'AB + AC' because the output will be true if A is true, no matter the value of B or C.

A logic circuit that is built by combining several other simpler logic circuits. Each output is determined solely by the current inputs.

A logic circuit that has memory, and its output depends not only on its current inputs, but also on the previous state of the circuit.