Skip to content
Deriving boolean expressions
↑ Year 1 · Semester 1
SC1005
Digital Logic
Deriving boolean expressions
Navigation
Course
Overview
Basics
Basics
Parity bit
Number conversion
Universality of NAND & NOR gates
Full-adder
Signed-magnitude
1’s complement
2’s complement
Combined circuit for addition and subtraction
Overflow
Parallel addition with registers
Binary Multiplication
BCD addition
Deriving boolean expressions
K-map
CMOS circuit
Circuit characteristics and parameters
Tristate outputs
Open-drain output
Schmitt-Trigger Inverter
PLA
Floating-point numbers
2 TYPES OF CIRCUITS - COMBINATIONAL vs SEQUENTIAL
2 TYPES OF CIRCUITS - COMBINATIONAL vs SEQUENTIAL
Combinational Circuits
Sequential Circuits
Sequential Circuits
Latches
Flip Flops
General Verilog
General Verilog
Combinational always block [always@*]
Synchronous always block
Some sequential blocks
Finite State Machine
Finite State Machine
Sum of Minterms: ABC + ABC’ + …, each minterm produces logic 1
Canonical form: F(A,B,C) = ∑m(1, 2, 3, …)
Product of Maxterms: (ABC)(ABC’)…(), each maxterm produces logic 0
Canonical form: F(A,B,C) = πM(1, 2, 3, …)
← BCD addition
K-map →