Digital Logic Gates Basics

College Depth 162 in the knowledge graph I know this Set as goal
Unlocks 1 downstream topic
logic-gates AND OR NOT NAND NOR CMOS truth-table boolean-algebra inverter

Core Idea

Digital logic gates implement Boolean functions in hardware, mapping binary input voltages (HIGH/LOW) to binary outputs. The fundamental gates are NOT (inverter), AND, and OR, from which all other logic functions can be constructed. In CMOS technology, gates are built from complementary pairs of NMOS and PMOS transistors: a CMOS inverter uses one NMOS (pull-down, conducts when input is HIGH) and one PMOS (pull-up, conducts when input is LOW), ensuring that one transistor is always off so no static current flows — the key advantage of CMOS over earlier technologies. NAND and NOR gates are the universal gates: any Boolean function can be implemented using only NAND gates (or only NOR gates). A CMOS NAND gate uses series NMOS transistors in the pull-down network and parallel PMOS transistors in the pull-up network; a CMOS NOR gate reverses this arrangement. Truth tables define the input-output mapping for each gate, and Boolean algebra (De Morgan's theorems, distributive/associative laws) enables simplification of logic expressions. The voltage transfer characteristic of a CMOS inverter shows the sharp transition between output HIGH and LOW, with noise margins defined by the voltage thresholds V_IL, V_IH, V_OL, and V_OH.

How It's Best Learned

Build a CMOS inverter from one NMOS and one PMOS transistor and trace the current path for each input state. Verify that exactly one transistor is on at a time. Extend to NAND and NOR by reasoning about series versus parallel combinations in pull-up and pull-down networks. Construct truth tables for each gate, then use De Morgan's theorems to show that NAND and NOR are universal.

Common Misconceptions

Explainer

From your study of MOSFETs, you know that a transistor is a voltage-controlled switch: the gate voltage determines whether the channel conducts (ON) or blocks (OFF). Digital logic gates exploit this directly. Instead of operating MOSFETs in continuous voltage ranges as amplifiers, digital design snaps them to one of two states: HIGH (close to V_DD, representing logical 1) and LOW (close to ground, representing logical 0). The entire goal is to process discrete binary information using transistors as switches.

The simplest gate is the NOT gate (inverter): input HIGH → output LOW; input LOW → output HIGH. A CMOS inverter uses exactly two transistors in a complementary pair. The NMOS transistor connects the output to ground and conducts when the input is HIGH (pulling the output LOW). The PMOS transistor connects the output to V_DD and conducts when the input is LOW (pulling the output HIGH). Since exactly one is always ON and the other always OFF, the output is always driven strongly to either V_DD or ground, with no static current path between them. This complementary design—CMOS stands for Complementary MOS—is why modern chips can contain billions of transistors without melting: they draw significant current only during switching transitions, not while holding a steady state.

NAND and NOR gates extend this logic to multiple inputs. A NAND gate produces LOW only when all inputs are HIGH (it is the complement of AND). In CMOS, the pull-down network places NMOS transistors in *series*—all must be ON simultaneously to pull the output to ground—while the pull-up network places PMOS transistors in *parallel*—any one being ON pulls the output to V_DD. A NOR gate reverses this arrangement: NMOS in parallel, PMOS in series. Importantly, AND and OR gates each require an extra inverter stage in CMOS, making NAND and NOR the natural implementation primitives. This is why NAND and NOR are called universal gates: every Boolean function can be constructed from NAND gates alone, or from NOR gates alone.

Truth tables and Boolean algebra are the mathematical language of gate design. De Morgan's theorems—the complement of (A AND B) equals (NOT A) OR (NOT B), and vice versa—let you transform freely between gate types. Simplifying a Boolean expression before building it in hardware directly reduces transistor count. The standard workflow of logic design—write the truth table, simplify with Boolean algebra, map to gates—is the combinational design methodology that all of digital systems builds upon.

Practice Questions 5 questions

Prerequisite Chain

Counting to 10Counting to 20Understanding ZeroThe Number ZeroCounting to FiveOne-to-One CorrespondenceCombining Small Groups Within 5Addition Within 10Addition Within 20Two-Digit Addition Without RegroupingTwo-Digit Addition with RegroupingAddition Within 100Repeated Addition as MultiplicationMultiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Two-Digit by One-Digit DivisionDivision with RemaindersRemainders and Quotients in DivisionDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueReading and Writing DecimalsComparing and Ordering DecimalsAdding and Subtracting DecimalsMultiplying DecimalsDividing DecimalsDividing FractionsMixed Number ArithmeticOrder of OperationsInteger Order of OperationsVariable ExpressionsCombining Like TermsOne-Step EquationsTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesAngle Pairs: Complementary, Supplementary, and VerticalParallel Lines and TransversalsCorresponding AnglesAlternate Interior AnglesTriangle Angle Sum TheoremExterior Angle TheoremTriangle Inequality TheoremSimilar Triangles: AA SimilaritySimilar Triangles: SSS and SAS SimilarityProportions in Similar TrianglesRight Triangle Trigonometry IntroductionTrigonometric Ratios ReviewRadian MeasureConverting Between Degrees and RadiansThe Unit CircleGraphing Sine and CosineGraphing Tangent and Reciprocal Trigonometric FunctionsDerivatives of Trigonometric FunctionsAntiderivativesIterated Integrals and Fubini's TheoremDouble Integrals in Cartesian CoordinatesDouble Integrals over Rectangular RegionsDouble Integrals in Polar CoordinatesDouble Integrals: Definition and SetupIterated Integrals and Fubini's TheoremDouble Integrals over Rectangular RegionsDouble Integrals over General RegionsApplications of Double Integrals: Area, Mass, and MomentsTriple Integrals in Cartesian CoordinatesTriple Integrals in Cylindrical and Spherical CoordinatesChange of Variables and the Jacobian DeterminantApplications of Triple Integrals: Volume and MassVector Fields and Their RepresentationsLine Integrals of Vector FieldsGreen's TheoremSurface Integrals and Flux of Vector FieldsSurface Integrals and Flux of Vector FieldsDivergence Theorem: Flux and OutflowDivergence TheoremElectric FluxGauss's LawConductors in Electrostatic EquilibriumCapacitance and CapacitorsDielectricsDielectric Constant and Relative PermittivityElectric Field Inside Dielectric MaterialsDielectric Materials and PolarizationDielectric Susceptibility and PermittivityEnergy Density in Electric FieldsElectric Current and Current DensityElectrical Resistance and ResistivityOhm's Law and Circuit ElementsElectromotive Force (EMF) and BatteriesKirchhoff's Circuit Laws: Voltage and CurrentDC Circuit Network Analysis MethodsTransient Response in RC CircuitsRC CircuitsLC and RLC CircuitsAC Circuits: FundamentalsImpedance and ReactanceAC Power and ResonanceElectromagnetic WavesThe Electromagnetic SpectrumBlackbody Radiation and Planck's LawPhotoelectric EffectThe Photon: Light as QuantaCompton ScatteringWave-Particle Dualityde Broglie WavelengthHeisenberg Uncertainty PrincipleWavefunction and the Born RuleThe Schrödinger EquationState Vectors and WavefunctionsQuantum SuperpositionQuantum EntanglementBell Theorem and Bell InequalitiesPostulates of Quantum MechanicsScattering TheoryIntroduction to Scattering TheoryPartial Wave Analysis in ScatteringSpin Angular MomentumElectron Spin and Intrinsic Magnetic MomentStern-Gerlach Experiment: Spin Quantization and MeasurementElectron Diffraction and Matter Wave PropertiesDavisson-Germer Experiment: Crystal Diffraction of ElectronsElectron Diffraction and Matter Wave InterferenceWavefunctions and Probability Density InterpretationQuantum Superposition and Linear Combinations of StatesQuantum Operators and ObservablesCanonical Commutation Relations and UncertaintyHeisenberg Uncertainty Principle and Measurement LimitsTime-Independent Schrödinger Equation and EigenvaluesHydrogen Atom in Quantum MechanicsSpectral Lines and Energy TransitionsSelection Rules for Atomic TransitionsLS and jj Coupling Schemes in Multi-Electron AtomsPauli Exclusion Principle and Antisymmetric WavefunctionsElectron Configuration and the Aufbau PrincipleThe Periodic Table and Atomic Electronic StructureThe Periodic TableElectron ConfigurationPeriodic TrendsIonization EnergyIonic BondingLewis StructuresPolar Covalent Bonds and Dipole MomentsClassification of Bonds: Ionic, Covalent, and MetallicMetallic Bonding and Properties of MetalsCrystal Structures and Solid PropertiesCrystal Structure and Unit CellsElectrical Properties of MaterialsDiode Characteristics and ModelsDiode Circuit ApplicationsBipolar Junction Transistor (BJT) FundamentalsMOSFET FundamentalsDigital Logic Gates Basics

Longest path: 163 steps · 877 total prerequisite topics

Prerequisites (1)

Leads To (1)