Welcome to Coding for Wireless Channels
This is a 3-day course, covering the coding/decoding methods and emphasizing the aspects specific for the wireless communications. The goal is to provide understanding and insights into the fundamental aspects and modern developments of the coding theory and discuss their applicability in the challenges faced by the emerging wireless communication systems. Initially, fundamentals like modeling of noisy channels and limits on the rate of communication are covered, along with the coding requirements in wireless systems. We then present some of the most successful coding schemes that are results of recent research efforts. We also deal with the techniques relevant to the multiple access channels, inherent to wireless communications. Finally, we conclude the course with the presentation of the results from the emerging field of finite-blocklength information theory, relevant for short packet communications that are characteristic for machine-type services.
The course will bring knowledge on both mature solutions, already widely used today, and more cutting-edge solutions with high research activity.
- Introduction and motivation: channel models, channel capacity, why do we need codes and how to use them, basics of coding and decoding algorithms.
- Linear codes. Encoding, decoding and measures of reliability.
- Convolutional codes, trellis representation and decoding on a trellis. Trellis coded modulation.
- Introduction to codes-on-graphs and iterative decoding algorithms.
- Turbo codes.
- Coding for multiple access channels.
- Coded random access.
- Finite-blocklength information theory.
- Coding for short-packets.
Basics of information theory and digital communications, probability theory, stochastic processes.
Understanding of classic information-theoretic models of wireless communications and of their limitations. Understanding of finite-blocklength information-theoretic models. Understanding and working knowledge of the relevant coding schemes: linear block- and convolutional-codes, codes-on-graphs, and iterative decoding algorithms.
Lectures. Presentations by students.
Criteria for assessment:
The attendees will be assessed based on the presentation of the beforehand assigned topics.
- KTH – Coding for wireless communications, course notes
- Georg Böcherer – Lecture Notes on Channel Coding, https://arxiv.org/pdf/1607.00974v1.pdf
- V. Guruswami – Introduction to coding, course notes
- B. Sklar – Digital Communications: fundamentals and applications, Prentice Hall, 2001
- David J. C. MacKay, Information Theory, Inference & Learning Algorithms, Cambridge University Press, 2003
- E. Biglieri, Coding for Wireless Channels, Springer 2007
- T. Richardson, R. Urbanke, Modern Coding Theory, Cambridge University Press 2008
- Y. Polyanskiy, H. V. Poor and S. Verdú, "Channel coding rate in the finite blocklength regime," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2307-2359, May 2010.
Organizer: Associate Professor Cedomir Stefanovic firstname.lastname@example.org
Lecturers: Cedomir Stefanovic, Kasper Fløe Trillingsgaard, Petar Popovski
Time: 12-14 November 2018
Place: Copenhagen Campus
Number of seats: 15
Deadline: 22 October 2018
Important information concerning PhD courses We have over some time experienced problems with no-show for both project and general courses. It has now reached a point where we are forced to take action. Therefore, the Doctoral School has decided to introduce a no-show fee of DKK 5,000 for each course where the student does not show up. Cancellations are accepted no later than 2 weeks before start of the course. Registered illness is of course an acceptable reason for not showing up on those days. Furthermore, all courses open for registration approximately three months before start. This can hopefully also provide new students a chance to register for courses during the year. We look forward to your registrations.
- Teacher: Cedomir Stefanovic