Lecture notes (Digital Systems)

Copyright © 2024 J. M. Spivey
Jump to navigation Jump to search

In the list below, each lecture title is a link to notes for that lecture. Or you may prefer a format with all notes on one page. The notes for some lectures have a section at the end for questions asked during or after that lecture by the audience this year or in previous years.

Hilary Term

Assembly-language programming

The first few lectures will be about programming a microprocessor in assembly language, including the detail of how each kind of instruction operates.

[1] Microcontrollers and embedded programming. Architecture of the micro:bit. Programmer's model. Execution of an instruction.

[2] Building a program. Compiling and building a program.

[3] Multiplying numbers. Conditional and unconditional branches. Instruction encodings. Execution time.

[4] Number representations. Signed and unsigned numbers. Numeric comparisons.

[5] Loops and subroutines. A better multiplication algorithm. Stack frames and nested suboroutines.

[6] Memory and addressing. Addressing modes. Arrays. Example: "Bank accounts".

[7] Buffer overrun attacks. A hacker's guide.

  • A set of slides used in the lectures.

Input and output

The next lectures are about different kinds of I/O interaction, including interrupts.

[8] Introducing I/O. Memory-mapped I/O. GPIO. Multiplexed LED display.

[9] Serial I/O. Serial protocol. A simple, polling UART driver.

[10] Programming with interrupts. Interrupt-based driver for UART.

[11] The interrupt mechanism. What the hardware does with interrupts.

  • A set of slides used in these lectures.

Embedded operating systems

The last part of Hilary Term has lectures about using and then implementing a simple process scheduler, allowing asynchronous events to be handled in a manageable way.

[12] Introducing micro:bian. Processes and messages.

[13] Device drivers. Server processes. Interrupts as messages from the hardware.

[14] Context switching. Implementing interleaving of processes by saving and restoring context.

[15] Implementing processes and messages. Process table. Ready queue. Send and receive.

[16] A device driver. Writing a driver for a simple I/O device.

  • A set of slides used in these lectures.

Trinity Term

A Thumb datapath

Hardware elements

In the first part of Trinity Term, the lectures are about constructing logic gates from transistors, and then building those logic gates into modules we can later use to design a computer. Helpful reading for this part of the course is the appendix on Basics of Logic Design from the recommended book by Patterson and Hennessy.

[17] Introduction to hardware. Plan for the term. Combinational logic.

[18] Transistors and logic gates. Building gates from transistors. CMOS logic.

[19] Sequential logic. Flip-flops. Designing sequential circuits.

[20] Example of a sequential circuit.

[21] Architectural elements. Circuits for arithmetic. Multiplexers. Register files. Arithmetic-Logic Unit. Barrel shifter.

  • A set of slides used in the lectures.

Microprocessor architecture

The second part of Trinity Term has lectures about using architectural modules to build a simplified implementation of the Thumb instruction set.

[22] Designing a datapath.

[23] Designing a datapath (continued). Continuation

[24] Three instructions. Using the datapath to implement three typical instructions.

  • A set of slides used in the lectures.
  • Slides for the last lecture.