Teaching

Past exam papers

Here are the 2003 and 2004 CEG5010 exam papers for your reference.

Week 14: Project Demo

This week we will meet in room 122. Each group should prepare a 10 minute presentation (we will organise an LCD projector and computer) and 10 minute demo regarding their project. Please fill in this report sheet and submit it to me on the day.

Week 13: Makimoto video

This week we will watch a video in which Dr Makimoto of Sony talks about how reconfigurable computing will be the next paradigm shift.

Week 12: Elementary functions (CORDIC and STAM methods)

This week we will discuss ways to implement elementary functions such as sin, cos, sqrt etc. The first technique is the CORDIC algorithm (also see the "Computer Arithmetic" chapter in the notes and Ray Andraka's CORDIC webpage, particularly his "A survey of CORDIC algorithms for FPGAs" paper). We will also describe the symmetric table addition method (STAM) (also see the original paper).

Week 11: IDEA cipher

This is an example of a deeply pipelined bit serial design. It is compared with a bit-parallel design (notes
and paper).

Week 11: Multipliers

In this lecture we will discuss various ways of pipelining multipliers which are a key building block for DSP systems. Here are the notes taken from the MIT 6.004 course. An additional handout on bit serial multipliers will be given.

Week 10: Distributed arithmetic and DSP

This week we will talk about the design of filters for digital signal processing. If multipliers are not available, we can use a technique called "distributed arithmetic" to implement a sum of products efficiently (notes and paper).

We will also discuss the implementation of an electronic cochlea which uses distributed arithmetic (notes and paper).

Week 9: Elliptic Curve Cryptography

Download file

This an example of how to design a microcoded implementation of a complex algorithm. Also refer to this paper.

Week 8/9: RSA Public Key Cryptography

We will discuss implementations of RSA public key cryptosystems. Also refer to these papers by Shand et. al. and Tang et. al.

Week 8: The Data Encryption Standard (DES)

Download file

We will talk about the DES algorithm, how to implement it in VHDL and the keysearch engine used to crack it. DES is an example of a datapath which can be fully pipelined.

Week 7: UART design

This week we will discuss a UART design which is a state machine of moderate complexity. Notes will be distributed in class.

Week 6: RC4 implementation

Download file

We will discuss an implementation of the RC4 cipher. You may also wish to refer to this paper.

Week 6: FPGA editor (rm 122)

Download slides

This week's lecture will be in SHB Rm 122. We will look at the architecture of the Virtex FPGA using FPGA editor as well as understand how a 34-bit shift register is mapped to the FPGA vhdl code.

Week 5: (notes changed)

Please note that I've made some changes to the lecture slides in the previous entry for tommorow's lecture. For your convenience, they are also available here.

Week 5: Shift registers, LFSRs and random numbers

This week we will discuss efficient shift registers (also refer to the Xilinx Applications note XAPP052 "Efficient Shift Registers, LFSR Counters and Long Pseudo-Random Number Generators" and Xilinx Applications note XAPP210 "LFSRs in Virtex devices"). You may also want to use the following programs which can find primitive polynomials of arbitrary degree: a Web based program and/or the ppsearch program, a C program with source code which supports large polynomials.