|Teachers and Staff||Teachers and Staff|
|Problem Classes||Problem Classes|
If you are reading a paper copy of this course program:
There is more information on the course webpage: http://www.commsys.isy.liu.se/TSKS02.
|Lectures:||11 × 2 h||=||22 h|
|Problem classes:||8 × 2 h||=||16 h|
|Laborations:||3 × 4 h||=||12 h|
During autumn 2010, the following people are involved in the course. You find all of them in building B, top floor, corridor A, between entrances 27 och 29.
|Lecturer & examiner:||Daniel Perssonfirstname.lastname@example.org||tel. 282571|
|Problem classes:||Antonios Pitarokoilisemail@example.com||tel. 281340|
|Administrator:||Susana Högnefirstname.lastname@example.org||tel. 281325|
- Mikael Olofsson, Telecommunication Methods, version "August 2010". Can be purchased at Bokakademin in Kårallen.
- Mikael Olofsson, Telecommunication Methods - Problems, version "August 2010". Can be purchased at Bokakademin in Kårallen.
- Lab Memo that will be made available at this web site at a later state.
The examinationen consists of two parts, that are reported separately to LADOK:
- TEN1 (4 hp), which is a traditional written exam, and
- LAB1 (2 hp), which consists of three lab occations.
For detailed information about the connection between the course aims and the examination, see the following page.
5.1 Written Exam (TEN1)
The written exam consists of two parts, a question part and a problem part.
The question part consists of three questions, where you are asked to elaborate on (or explain) topics of this course. These questions can give you at most five points each. You need at least five points from this part of the exam as partial fulfillment to pass.
The problem part consists of three traditional problems. These problems can give you at most five points each. You need at least five points from this part of the exam as partial fulfillment to pass.
Grading (Swedish grades):
- Grade 3 (pass): 15 points
- Grade 4: 19 points
- Grade 5: 23 points
The Swedish grades are translated to ECTS grades according to 3 = C, 4 = B, and 5 = A.
Totally, you can get at most 30 points. Allowed aids during the exam: Paper, pencil, rubber, pocket calculator. A Q-table is always appended to the exam, aswell as a sheet with equations.
5.2 Laborations (LAB1)
There are three laborations in this course, namely
- Analog modulation
- Digital modulation
- Coding methods
All these laborations are scheduled as four-hour sessions and are supposed to be done in pairs. You should be able to finish each lab in the scheduled four hours. You pass each lab by reporting your findings to your lab teacher before leaving the lab session. If you are not done with a laboration after those four hours, you have to finish it by yourselves and then hand in a brief written report to your lab teacher. The laborations are reported to Ladok as LAB1 when you have passed all three laborations.
A separate Lab Memo will be published on this web site at a later state.
After you have passed all laborations and the written exam, then you will get a grade for the complete course, which is identical to the grade that you got on the written exam.
Please observe that the following schedule should be interpreted as an indication about approximately when different topics are treated.
|Lecture n:o||Material||Main topic||Part|
|1||Chapter 1&2||Introduction||Course plan, applications, prerequisites.|
|Chapter 3||Linear filters||Time domain analysis of LTI-systems, definitions, convolution.|
|2||Chapter 3||Linear filters||Frequency domain analysis of LTI-systems, fourier transforms, LP-, HP-, BP-, and BS-filters.|
|3||Chapter 4||Channel models||Thermal noise, cables, radio channels, optical channels.|
|4||Chapter 5||Analog communication||Amplitude modulation, frequency modulation, phase modulation.|
|5||Chapter 6||Analog communication||Pulse modulation, PCM, delta modulation.|
|6-7||Chapter 7||Digital communication||Digital modulation techniques, receivers. OOK, ASK, PSK, FSK, QAM. Nearest-neighbour approximation of symbol error probability and bit error probability for signals disturbed by white gaussian noise.|
|8||Chapter 8||Channel coding||Error correcting codes, dimension, redundancy, rate. Linear codes, repetition codes, Hamming codes.|
|9||Chapter 8||Channel coding||Product codes, CRC codes. Cyclic codes.|
|10-11||Chapter 9||Source coding||Sources without memory - sources with memory, Markov sources. Tree codes, Krafts inequality, Huffman codes, run-length coding.|
The problem classes are supposed to be opportunities for discussion about solving problems. Below is a suggestion for problems to treat in each problem class. You should study those problems in advance in order to benefit the most from those problem classes.
|1||Linear filters||LTI-systems, convolution.||3.1 - 3.7|
|2||Linear filters||LTI-systems, convolution. The fourier transform||3.8 - 3.13|
|3||Linear filters||The fourier transform, LP-, HP-, BP-, and BS-filters.||3.14 - 3.17|
|4||Channel models||Channels||4.1 - 4.4|
|Analog Communication||AM, FM, PhM||5.1 - 5.4|
|5||Analog and digital communication||Pulse modulation, DM. Error probabilities, OOK, ASK, PSK, FSK, QAM.||6.1 - 6.6, 7.1 - 7.4|
|6||Channel coding||Error control codes, dimension, redundancy, rate. Linear codes, repetition codes, Hamming codes.||8.1 - 8.7|
|7||Source Coding||Tree codes, Krafts inequality, Huffman codes, run-length coding.||9.1 - 9.3|
|8||Mixed problems||Most of the above.|
Questions about the problems are welcome before the corresponding problem class. Send them by email to your problem class teacher ( Antonios Pitarokoilis). In that way you can help your teacher to plan the problem classes.
Senast uppdaterad: 2013 05 18 06:03