Homepage
TSKS04 Digital Communication Continuation Course
Course Program Spring 2014
Innehåll |
Separata sidor |
||||
| General | General | ||||
| Time | Time | ||||
| Teachers and Staff | Teachers and Staff | ||||
| Course Litterature | Course Litterature | ||||
| Examination | Examination | ||||
| Lectures | Lectures | ||||
| Tutorials | Tutorials |
1. General
TSKS04 Digital Communication Continuation Course is an in-depth course that continues where TSKS01 Digital Communication ends. It is intended to give a theoretical in-depth description of digital communication that is more realistic.
If you are reading a paper copy of this course program:
There is more information on the course webpage:
//www.commsys.isy.liu.se/TSKS04.
Among other things, this course information is there.
2. Time
The teaching consists of lectures, tutorials and laborations.
There are eleven lectures and nine tutorials.
The laborations are done in groups of about four to five people in the computer labs at ISY. There is no teacher present at the scheduled laborations, and we expect those laborations to be well enough for completing the lab task.
3. Teachers and Staff
During spring 2013, the following people are involved in the course.
| Lectures and examination: |
Mikael Olofsson
mikael.olofsson@liu.se tel. 281343 |
|
| Tutorials: |
<Okänt användarnamn: antonispit>
antonios.pitarokoilis@liu.se tel. 281340 |
Mikael and Antonios have their offices in Building B, top floor, Corridor A, between Entrances 27 and 29.
4. Course Litterature
Course book:
- U. Madhow, Fundamentals of digital communication, Cambridge University Press 2008.
You may alse have use of the litterature from the courses TSDT14 Signal Theory and TSKS01 Digital Communication, and especially the following:
- Mikael Olofsson: Tables and Formulas for Signal Theory (course material in Signal Theory).
Some additional material may be distributed during the course.
5. Examination
The examination consists of two parts; laborations and a written exam.
5.1 Laborations (LAB1)
The laborations are done in groups of about four to five students, and they are examined based on one report that should be handed in to the examiner. Cooperation between groups is encouraged, but each group should write their own report.
The laborations are based on Matlab and Simulink, the same environment as was used in TSKS01 Digital communication. There are ten scheduled four-hour occations, but the laborations are estimated to correspond to about three such occations.
The laborations correspond to 1 ECTS credit (hp), and is graded using the scale Pass/Fail.
5.2 Written Examination (TEN1)
The following aids are allowed at the exam:
- Pocket calculator with empty memory.
- Mikael Olofsson: Tables and Formulas for Signal Theory (course material in Signal Theory).
- U. Madhow, Fundamentals of digital communication, Cambridge University Press 2008.
No notes are allowed on those aids.
The written exam consists of five problems, that each can give you at most five points. Totally, yo can thus get at most 25 points on the exam. Grade limits:
- Grade 3: 12 points
- Grade 4: 16 points
- Grade 5: 20 points
Grades 3, 4 and 5 are translated to ECTS grades C, B and A.
5.3 Total Grade
When you have passed both parts of the examination (LAB1 och TEN1), the total grade given is the grade from the written exam.
6. Lectures
Please observe that the following schedule should be interpreted as an indication about approximately when different topics are treated. As the course proceeds, this plan may be adjusted.
| Lecture n:o | Chapter | Main topic | Part |
|---|---|---|---|
| 1 | --- | Introduction | Course plan. |
| 2.1 | Introduction | Prerequisites. | |
| 2.5.2, extra | Power Spectral Density of Random Signals | PSD of linearly modulated signals | |
| 2 | 2.5.2, extra | Power Spectral Density of Random Signals | PSD of linearly modulated signals (cont.) |
| 3 | 2.2,2.3 | Baseband Representation | Complex baseband representation of stochastic processes |
| 4 | 2.2,2.3 | Baseband Representation | Complex baseband representation of stochastic processes (cont.) |
| Lab Memo | Laborations | Instructions and hints | |
| Wikipedia article | Laborations | Line codes | |
| 3.2, 4.2 | Estimation | Introdiction to estimation | |
| 5 | 3.2 | Estimation | Binary hypothesis testing |
| 4.1-4.3 | Estimation | Phase and delay estimation | |
| 6 | 4.4-4.5 | Estimation | Non-coherent estimation |
| 5.1-5.2, 5.4 | Estimation | ML Sequence estimation | |
| 7 | 5.4 | Estimation | ML Sequence estimation, the Viterbi Algorithm |
| 8 | 5.5-5.6 | Equalizing | Suboptimal Equalizers, ZF and MMSE |
| 9 | 7 | Error Control Codes | Convolutional codes, encoding, structure |
| 10 | 7 | Error Control Codes | Catastrophic and non-catastrophic encoders, Decoding, Viterbi again |
| 11 | Error Control Codes | Path-weight enumerators and error probability | |
| Summary |
7. Tutorials
The tutorials are supposed to be opportunities for discussion about solving problems. Below is a suggestion for problems to treat in each occation You should study those problems in advance in order to benefit the most from those tutorials.
| Number | Main topic | Part | Problems |
|---|---|---|---|
| 1 | PSD of Random signals | Extra Tasks (problems 3,4,5) | |
| 2 | Complex Baseband Representation | Stochastic Processes | 2.12 (a,b), 2.13 |
| Hypothesis Testing | Basics | 3.6, 3.8 | |
| 3 | Estimation | 4.1, 4.2, 4.4, 4.11 (4.8) | |
| 4 | Estimation | MLSE | 5.1, 5.2b, 5.3 |
| 5 | Estimation | MLSE | 5.4, 5.6acd, 5.8 |
| 6 | Equalizing | ZF & MMSE | 5.10ab, 5.11a, 5.13 |
| 7 | Error Control | Convolutional Codes | J&Z: 1.24, 2.1a, 3.2, 3.8c, 3.10, 4.1, 4.2 |
| 8 | Error Control | Convolutional Codes | 7.1, 7.2, 7.3, 7.4, 7.5b, 7.7 |
| 9 | Mixed | Exam Problems | TBD |
The problems listed for Tutorial 7 are from Johannesson & Zigangirov, Fundamentals of Convolutional Coding, IEEE Press, 1999. Those problems will be distributed at that tutorial.
Questions about the problems are welcome before the corresponding tutorial. Send them by email to your tutorial teacher <Okänt användarnamn: antonispit> . In that way you can help your teacher to plan the tutorials.
Sidansvarig:
Mikael Olofsson
Senast uppdaterad: 2019 07 30 10:17
