Digital Logic Short Notes (for STET-2025)
Page 1: Boolean Algebra
Basics
• Variables take values: 0 (false) or 1 (true)
• Operations:
o OR ( + ) → Output true if any input true
o AND ( ⋅ ) → Output true if all inputs true
o NOT ( ′ ) → Complement of Boolean variable
Laws of Boolean Algebra
• Idempotent: A + A = A, A ⋅ A = A
• Identity: A + 0 = A, A ⋅ 1 = A
• Null: A + 1 = 1, A ⋅ 0 = 0
• Complement: A + A′ = 1, A ⋅ A′ = 0
• Distributive: A(B + C) = AB + AC
• De Morgan’s: (A + B)' = A'B' | (AB)' = A' + B'
Duality Principle
• Swap with and 0 with 1 → new valid expression.
Page 2: Combinational Circuits
Definition
• Circuits with no memory
• Output depends only on current inputs.
Basic Circuits
• Adder :
o Half Adder = XOR (sum) + AND (carry).
o Full Adder = A + B + Carry_in.
• Subtractor : Use complement & adder circuits.
• Multiplexer (MUX) : Selects one input line.
• Decoder : Converts binary input → one active output.
• Encoder : Opposite of decoder.
• Comparator : Checks equality of inputs (XNOR).
Page 3: Sequential Circuits
Definition
• Circuits with memory → depend on input and current state.
• Use flip-flops (FFs) (D, SR, JK, T).
Flip-Flops
• SR latch : Basic storage.
• D FF : Latches data on clock edge.
• JK FF : Versatile, toggles if J=K=1.
• T FF : Always toggles on clock.
Applications
• Registers (store group of bits ).
• Counters (frequency dividers, state trackers ).
• State machines (controllers ).
Page 4: Minimization Techniques
Karnaugh Maps (K-maps)
• Cells represent truth table rows 2ⁿ, arranged Gray code.
• Group 1’s into rectangles (1, 2, 4, 8 … cells → power of two ).
• Write simplified sum of products (SOP).
Quine–McCluskey
• Tabular reduction → systematic minimization.
• Used by software tools for synthesis.
Hazards
• Glitches in circuits due to different path delays.
• Fixed by adding consensus terms in Boolean expression.
Page 5: Number Systems & Computer Arithmetic
Number Systems
• Binary (base 2) 1010 = 10.
• Octal (base 8) 12 = 10.
• Hexadecimal (base 16) A = 10.
• Decimal (base 10).
Signed Representations
• Sign-Magnitude: MSB is sign (0 = +, 1 = -).
• 1’s Complement: Invert all bits for negative. Two zeros.
• 2’s Complement: Invert + add 1 Unique zero & easy arithmetic.
Arithmetic Operations
• Add/Subtract: Using full adders, handling overflow .
• Multiplication:
o Binary shift-and-add.
o Booth's Algorithm for signed multiplication.
• Division: Restoring, Non-restoring methods.
Floating Point (IEEE 754)
• Single Precision (32-bit): Sign (1) | Exponent (8) | Mantissa (23).
• Double Precision (64-bit): Sign (1) | Exponent (11) | Mantissa (52).
• Uses biased exponent (127 for single, 1023 for double).
• Supports very large/small real numbers.