Microprocessors Systems 1 is an introduction to a 68000-based computer system. The course covers binary and hexadecimal arithmetic, data representation, assembly language, I/O programming, exception and interrupt handling and instruction timing.
More about the Tutorial, Review of Topics Covered, Examination Layout, Final Remarks.
Discuss and design an interrupt handler/buffer/trap handler/client architecture to receive incoming characters
All about the 68000 Bus System—Reprise of previous introduction and further details.
Quick note about Interrupt Acknowledges and Interrupts; Introdutions to the System Bus
Quick talk about next practical (practical 9). Details of Interrupt Handling, Example of using a Timer Interrupt, Comments, Discussion about overall structure of programs using interrupts.
Walkthrough of Practical 8 (Line 1010 Exception Handler)
Exceptions and Interrupts, including talk about practical 8
Interrupts and exceptions. (Missed the very start of the lecture.)
How to visualise the UART, read-only and write-only interface registers. Implications for instruction use, e.g. BTST/BSET/BCLR/BCHG. Thinking about advancing beyond polling to interrupts.
What a UART does, how one might be organised, how you might write some code to reead a character.
Tutorial to develop an understanding of how to interface to a 2-of-8 keypad with switch bounce.
In-depth example of interfacing to a 16-key telephone-style keypad.
More talk about Input/Output. Interfaces. Memory-mapped Input/Output. Sample of BCD to Seven-Segment-Display and output.
Review of today's tutorial, of yesterdays practical. Beginning to talk about Input/Output.
Tutorial to develop data structures for representing sets, for adding, counting and removing elements in a set.
An exploration of stack frames, re-entrant subroutines, the link instruction.
An exploration of stack frames, re-entrant subroutines, the move-multiple instruction, the link instruction. Encoding instruction -- execution timing.
Finish tutorial 6; talk about practical 5; look at a simple example of stack-based parameter passing; talk about a stack frame; use the MOVEM instruction.
Tutorial to develop subroutines to read and evaluate arithmetic expressions of the form [number] [op] [number] in a NUL-terminated string.
'Ecological'. i.e. well-behaved subroutines, parameter passing.
Practical was generating a NUL-terminated character string of the decimal representation of a signed word.
Figuring out how to map familiar high-level control constructs like 'while' and 'for' to assembly language.
How subroutines are called and how return is effected. The Stack, how it works, how JSR/BSR use it.
Condition calculation and conditional branching; an example, converting an integer represented in a character sequence to a binary word integer
Go through sample solution for 32 bit multiplication. Condition calculation for conditional branching
Work out some of the 32 bit multiplication problem
Tutorial problem: Count vowels in a character string.
Tutorial problem: Implement full 32-bit multiplication
Introduction to Addressing Modes, Categories of Addressing Modes, Immediate Modes
Forgot to record this lecture...
Quick and dirty look at program flow control, loops, address registers as pointer.
Simplified Programmer's Model of Computer, of 68000, of Memory, of the Bus, Simple Program
Simplified Programmer's Model of Computer, of 68000, of Memory, of the Bus, Simple Program
Tutorial about binary to decimal and hexadecimal conversion, character set, start putting a program together.
Overview, Von Neumann Machine, Starting talk about memory organisation
© 2020-2025 Ivy Podcast Discovery LLC
