For each lecture, there is a related problem solving session. Below is a list of recommended problems to each problem solving session. Solutions to all exercises are available in this PDF.
There are two teaching assistants in the course: Erik Mårtensson and Christian Nelson. Christian will teach the mixed D/E sessions in the schedule, and Erik will teach those that are exclusively D or E. You are welcome to attend any session you want to.
If you find any errors in the solution pdf, please contact Erik.
"🎥" means that this exercise has related Youtube walkthroughs. See the bottom of this page for links.
|1||2.1-2.2||Introduction, Finite state machines|
|2||2.3||Sequential circuits||2.16a, 2.17, 2.19, 2.20, 2.23, 2.26|
|3||3.1-3.3, 4.5||Computing with integers and algebraic structures 🎥, Boolean algebra and Arithmetics||
3.1-3.5, 3.7, 3.8, 3.11, (3.13), 3.21-3.24, 3.28, 4.18-4.20
|4||4.1-4.3.3||Boolean functions and normal forms||4.1, 4.3, 4.5-4.6
|5||5.1.1-5.1.2||Minimal functions 🎥||5.1b, 5.2b, 5.4-5.6|
|6||5.1.2||Karnaugh maps 🎥||5.8ab, 5.9, 5.11, 5.13b, 5.14e|
|7||6.1||State minimisation 🎥||6.1|
RD-algoritmen: s1 s2
|9||6.3, 6.4, 5.3||Asynchronous seq.circ. and Mealy-Moore 🎥||6.3, 6.4, 6.11, 6.12, 6.14|
|10||5.4||Standard components and gates on transistor level|
|11||7.1-7.2||Linear circuits 🎥 and D-transform||5.21a, 7.1-7.4, 7.7, 7.13, 7.14, 7.6 (ignore the canonical forms part)|
|12||Almost everything||Neat assignments that cover large parts of HT 1. Perfect to exercise large parts of the course!||6.16, 6.17, 6.22-6.24, 5.21|
|13||7.2-7.3||LFSR||7.12, 7.15, 7.17, 7.19|
|14||Everything from HT 1||Study for the exam|
During the labs we will use Vivado 2016.1 which can be downloaded here (requires registration). Choose Vivado HL WebPACK during the installation.
|15||Introduction to VHDL||Appendix B in the manual for the laboratory exercises.|
|16||Combinational logic with VHDL|
Sequential logic with VHDL
Question hours lab 4
|Question hours lab 5/6|
|Question hours lab 5/6|
Playlist of all videos in the course
- Euclid's algorithm
- Bézout's identity
- Euclid's extended algorithm
- Multiplicative inverse (unit)
- Iterative consensus
- Karnaugh map, small example
- Karnaugh map, larger example
- State minimisation (RF-algorithm)
- Asynchronous seq. circuits
- Reduced form of linear sequential circuits
These videos are fairly new (2017 and 2018) and were made by former teaching assistant Linus Karlsson.