Course program autumn 2017
|Teachers and Staff||Teachers and Staff|
TSKS02 Telecommunication is an orientation course primarily intended for computer science students and students on some engineering Bachelor programs. It is focused on describing some methods used in modern telecommunication systems. If you are reading a paper copy of this course program, there is more information on the course homepage: //www.commsys.isy.liu.se/TSKS02.
|Lectures:||11 × 2 h||=||22 h|
|Problem solving classes:||8 × 2 h||=||16 h|
|Laboratory exercises:||3 × 4 h||=||12 h|
|Lecturer & examiner:||Mikael Olofssonfirstname.lastname@example.org||tel. 281343|
|Tutorials and Labs:||Hei Victor Chengemail@example.com||tel. 282432|
|Administrator:||Carina Lindströmfirstname.lastname@example.org||tel. 284423|
All the people mentioned above can be found in Building B, between entrances 27-29, top floor, corridor A.
- Mikael Olofsson, Telecommunication Methods, version "June 2011". 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 available later at this homepage.
The examinationen consists of two parts, which are reported separately to LADOK:
- TEN1 (4 hp) is a traditional written exam, and
- LAB1 (2 hp) consists of three laboratory exercises.
For detailed information about the connection between the course aims and the examination, see the following page: Detailed course aims.
5.1 Written Exam (TEN1)
The written exam consists of two parts: a question part and a problem solving part.
The question part consists of three questions, where you are asked to elaborate on (or explain) topics from 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 solving 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): 12 points
- Grade 4: 17 points
- Grade 5: 22 points
The Swedish grades are translated to ECTS grades according to 3 = C, 4 = B, and 5 = A.
In total, you can get at most 30 points. Allowed aids during the exam: Paper, pencil, eraser, and pocket calculator. A Q-table is always appended to the exam, as well as a sheet with relevant equations.
5.2 Laborations (LAB1)
There are three laboratory exercises in this course, namely
- Analog modulation
- Digital modulation
- Coding methods
All these laboratory exercises are scheduled as four-hour sessions and are supposed to be performed 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 the laboratory exercise after those four hours, you have to finish it by yourselves and then hand in a brief written report to your lab teacher. The laboratory exercises are reported to Ladok as LAB1 when you have passed all three labs.
After you have passed all laborations and the written exam, 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.1-3.3||Linear filters||Time domain analysis of LTI-systems, definitions, convolution.|
|2||Chapter 3.4-3.7||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.1||Analog communication||Amplitude modulation.|
|5||Chapter 5.2||Analog communication||Frequency modulation, phase modulation.|
|6||Chapter 6||Sampling and quantization||Sampling, quantization, reconstruction, pulse modulation|
|7||Chapter 7.1-7.3||Digital communication||Digital modulation techniques, vector representation, receivers, impact of noise.|
|8||Chapter 7.4-7.6||Digital communication||Different modulations: OOK, ASK, PSK, FSK, QAM. Nearest-neighbour approximation of symbol error probability and bit error probability for signals disturbed by white gaussian noise.|
|9||Chapter 8.1-8.3||Channel coding||Error correcting codes, dimension, redundancy, rate. Linear codes, repetition codes.|
|10||Chapter 8.3-8.6||Channel coding||Hamming codes, Product codes, CRC codes. Cyclic codes.|
|11||Chapter 9||Source coding||Sources without memory - sources with memory, Markov sources. Tree codes, Kraft's inequality, Huffman codes, run-length coding.|
The tutorials are supposed to be opportunities for discussion about solving different problems in context of the course. Below is a suggestion for problems to treat in each class. You should study those problems in advance in order to benefit the most from the problem solving classes.
|Number||Main topic||Part||Problems in the book|
|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.|
You are most welcome to submit specific questions and requests before each tutorial. Send them by email to your tutorial teacher ( Hei Victor Cheng). In that way you can help your teacher to plan the tutorial according to your wishes and needs.
Last updated: 2017 09 11 15:36