Look up a concept, code symbol or debugging topic. Continue into the lesson for examples, practice and the next step in your learning path.
Explain the digital abstraction and logic levels; convert among binary, octal, decimal, and hexadecimal; explain positional notation; determine the range of an unsigned value; and recognize extension, truncation, overflow, and wraparound.
Open reference →Interpret two's-complement values; calculate signed range; apply sign extension; reason about fixed-point scale, rounding, and saturation; and explain BCD, Gray code, and parity.
Open reference →Build truth tables; use basic gates and Boolean identities; form canonical SOP and POS expressions; simplify logic with algebra and Karnaugh maps; and explain equivalence, don't-care conditions, hazards, and glitches.
Open reference →Explain and size multiplexers, demultiplexers, encoders, priority encoders, decoders, and comparators; compose larger selection logic; and identify invalid inputs, default behavior, and combinational design defects.
Open reference →Trace half and full adders; distinguish common carry structures; analyze subtraction and width; explain shifters, an ALU, parity, and CRC; and identify loops, incomplete behavior, and delay trade-offs.
Open reference →Distinguish latches from flip-flops; explain synchronous and asynchronous controls; trace registers, shift registers, and counter types; and choose safe clock-enable, reset, and state-retention behavior.
Open reference →Translate requirements into Moore or Mealy state machines; build transition and output tables; compare state encodings; define reachability, recovery, timeout, and safe defaults; and distinguish registered from combinational outputs.
Open reference →Calculate setup slack; distinguish propagation and contamination delay, setup and hold, recovery and removal; explain skew, jitter, uncertainty, and critical paths; and select appropriate reset and clock-domain crossing structures.
Open reference →Compare memory technologies and port arrangements; define read latency and read-during-write behavior; calculate FIFO occupancy and flags; prevent overflow and underflow; and compare fixed-priority with round-robin arbitration.
Open reference →Size signed and unsigned arithmetic; reason about fixed-point rounding, saturation, accumulation, resource sharing, and pipelining; apply request/acknowledge and ready/valid protocols; and calculate latency, throughput, bandwidth, and buffer needs.
Open reference →Define gates, cells, macros, netlists, libraries, PDKs, dies, packages, and PCBs; compare ASIC and FPGA implementation; trace requirements through bring-up; distinguish functional verification from physical sign-off; and explain PVT, power, area, performance, and implementation limits.
Open reference →Follow the eight-week programme to connect individual concepts with design decisions, simulation, debugging and verification evidence.
Open the training plan