The goal of the course is providing a description of the fundamental features and technologies for digital communication systems.
During the course, the basic characteristics of the additive Gaussian channel model will be described along with an information theoretical analysis and interpretation of the achievable transmission rate. Basic concepts on information and modulation theory will be illustrated in this framework. An introduction to coding will be provided, covering both block codes and convolutional codes. The key features of error correction and error detection will be studied. The advantages given by coding will be analysed, and applications to most important communication systems will be presented.
The goal of the course is providing the basic tools for the analysis and design of digital communication systems.
The course is divided in two parts.
1. In the first part, Information Theory is going to be introduced as a basic tool to address the two key problems in data communications: source coding for data compaction and channel coding for error control. The basic results on source coding are discussed, including the entropy rate of independent and Markovian sources, the bounds on the minimum average number of bits required to encode a source, and the optimum Huffman codes. Moreover, the principles of channel coding are addressed, including the key concept of channel capacity and its applications. Finally, linear algebraic block codes based on finite fields are addressed. Finite field arithmetic, encoding and encoding algorithms are described in detail for the classes of BCH and Reed-Solomon codes.
2. In the second part we will discuss the main digital signal processing blocks in a standard digital baseband receiver, including the auxiliary blocks of channel estimation, channel equalization, timing, carrier, and frame recovery.
In this part we will also introduce modern channel coding techniques, like Turbo codes and LDPC codes, and describe their iterative decoders.
Knowlegde of the signal space representation and of the modulations for the additive Gaussian channel
Knowledge of the optimum Bayesian receiver and its performance analysis
Knowledge of the performance of standard digital modulations
Knowledge of information theoretical metrics
Knowledge of channel capacity and Shannon’s capacity formula
Knowledge of block encoding techniques.
Knowledge of convolutional encoding techniques.
Knowledge of basic decoding algorithms for block coding.
Knowledge of Viterbi algorithm and its application to convolutional decoding.
Knowledge of key parameters dominating coding performance and providing coding gain.
Knowledge of interleaving techniques for burst channels.
Knowledge of most important application of coding to communication systems.
Ability to design an optimum receiver over the AWGN channel
Ability to evaluate the performance of digital modulations over the AWGN channel
Ability to compare different digital modulations with different spectral efficiencies
Ability to evaluate the capacity of some classes of discrete channels
Ability to interpret the modulation performance in a Shannon diagram
Ability to choose the coding parameters for a given communication system.
Ability to evaluate a basic block and convolutional coding scheme.
Ability to design a basic block coding scheme and a basic block decoding algorithm.
Ability to design a convolutional coding scheme and a Viterbi decoding algorithm.
Ability to design an interleaver to counter the effect of burst errors.
Ability to understand the key properties of codes used in practical applications.
- Data source classification
- Knowledge of Markovian sources and their entropy rate
- Knowledge of Huffman codes
- Knowledge of channel capacity and Shannon’s capacity formula
- Ability to evaluate the capacity of some classes of channels
- Knowledge of the water-filling algorithm
- Knowledge of finite fields
- Ability to carry out calculations over finite fields
- Knowledge of linear algebraic cyclic codes
- Knowledge of BCH and Reed-Solomon codes
- Ability to implement encoding and decoding algorithms for BCH and Reed-Solomon codes
- Ability to design a digital baseband transmitter and receiver, including auxiliary blocks of channel estimation, channel equalization, timing, carrier, and frame recovery.
- Knowledge of modern coding techniques, Turbo codes and Low Density Parity Check Codes
Calculus, linear algebra, probability, and signal theory.
Calculus, linear algebra, probability, signal theory, digital transmission principles (including signal representation, linear modulations and their performance evaluation, the Nyquist criterion, the optimum receiver based on matched filter).
The course program is divided into two parts:
1. Digital modulations for the AWGN channel and basic concepts from Information Theory (4 credits)
(prof. Taricco)
• Analytic signal representation
• Review of basic probability concepts
• Introduction to signal spaces
• Linear modulations for the AWGN channel
• Digital receiver design
• Baseband and pass-band modulations
• Signal detection
• Error probability
• Standard digital modulations
• Power density spectrum of linear modulations
• Comparison of digital modulations: Shannon diagram
• Information theory: entropy and mutual information
• Definition of channel codes
• Discrete channels
• Discrete channel capacity
• Continuous input-continuous output channels
• Shannon capacity formula
2. Introduction to Channel Coding (4 credits)
(prof. Garello)
• Block codes
o Generating matrix and parity check matrix
o Hard and soft decoding
o Error detection
o Minimum distance, performance evaluation and coding gain
o Interleaving for burst channels
o Automatic Repeat Request
o Communication systems applications
• Convolutional codes
o Convolutional encoder, trellis representation
o Hard and soft decoding: the Viterbi algorithm
o Minimum distance, performance evaluation and coding gain
o Puncturing
o Communication systems applications
The course program is divided into two parts:
1. Information Theory and block codes (3CFU)
- Review of probability concepts
- Entropy and mutual information
- Entropy rate of information sources including Markov sources
- Lossless source coding algorithms: Huffman codes
- Shannon Theorem for communication channels
- Discrete channel capacity
- Differential entropies
- Shannon capacity formula
- Finite fields
- Linear algebraic cyclic block codes over finite fields
- Encoding algorithms for BCH and Reed-Solomon codes
- Decoding algorithms for BCH and Reed-Solomon codes
2. Communication Theory (3 CFU)
- Channel estimation (Single Carrier and OFDM)
- Adaptive Equalization ML and MMSE (Single Carrier and OFDM)
- Carrier, Timing and Frame Synchronization
- Convolutional codes
- Concatenated codes and Iterative channel decoders (LDPC, Turbo codes)
Classes alternate lectures and exercises: theoretical topics are developed during the lectures and their knowledge is tested during the exercises. Exercises are proposed to the students and subsequently solved by the lecturer.
Classes alternate lectures and exercises: theoretical topics are developed during the lectures and their knowledge is tested during the exercises. Exercises are proposed to the students and subsequently solved by the teacher.
1. For the first part, lecture notes handouts are provided to students. The following books represent useful supplementary reading:
• S. Benedetto and E. Biglieri, Principles of Digital Transmission: With Wireless Applications. Kluwer.
• A. Goldsmith, Wireless Communications. Cambridge University Press.
• U. Madhow, Fundamentals of Digital Communication. Cambridge University Press.
• A. Molisch, Wireless Communications. Wiley. J. Proakis and M. Salehi, Digital Communications (4th Edition).
• McGraw-Hill. T. Rappaport, Wireless Communications: Principles and Practice (2nd Edition). Prentice-Hall.
• D. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge University Press.
2. For the second part,
• Stephen B. Wicker, Error Control Systems for Digital Communication and Storage, Prentice Hall
• David J.C. MacKay, Information Theory, Inference, and Learning Algorithms, Cambridge University Press
Lecture notes are provided to the students from the teachers.
Here follow some additional references.
1. For the first part,
T.M. Cover and J.A. Thomas, Elements of Information Theory, Wiley, 2006
R. Lidl and H. Niederreiter - Introduction to Finite Fields, Cambridge University Press, 1986
R.E. Blahut - Algebraic Codes for Data Transmission, Cambridge University Press, 2003
H. Niederreiter and A. Winterhof - Applied Number Theory, Cambridge University Press, 2015
2. For the second part,
Stephen B. Wicker, Error Control Systems for Digital Communication and Storage, Prentice Hall
Tse, David, and Pramod Viswanath. Fundamentals of wireless communication. Cambridge university press, 2005.
David J.C. MacKay, Information Theory, Inference, and Learning Algorithms, Cambridge University Press
Dispense; Video lezioni dell’anno corrente;
Lecture notes; Video lectures (current year);
Modalità di esame: Prova scritta (in aula);
Exam: Written test;
...
A written exam, where six to eight exercises and/or theoretical questions on the two parts are proposed relevant to the course topics. The assessment will consider the correctness of the answers, the clarity and rigorousness of the development, and how exhaustive is the overall exam about the questions proposed.
The questions aim at assessing the knowledge on the topics listed in the course program and the ability to apply the theoretical concepts for the solution of the exercises.
Use only A4 white papers without stapling or foldings to simplify the scanning operations.
Exam duration: 90 minutes.
Books and lecture notes not allowed.
Maximum grade: 30 LODE
Gli studenti e le studentesse con disabilità o con Disturbi Specifici di Apprendimento (DSA), oltre alla segnalazione tramite procedura informatizzata, sono invitati a comunicare anche direttamente al/la docente titolare dell'insegnamento, con un preavviso non inferiore ad una settimana dall'avvio della sessione d'esame, gli strumenti compensativi concordati con l'Unità Special Needs, al fine di permettere al/la docente la declinazione più idonea in riferimento alla specifica tipologia di esame.
Exam: Written test;
A written exam, where six to eight exercises and/or theoretical questions on the two parts are proposed relevant to the course topics. The assessment will consider the correctness of the answers, the clarity and rigorousness of the development, and how exhaustive is the overall exam about the questions proposed.
The questions aim at assessing the knowledge on the topics listed in the course program and the ability to apply the theoretical concepts for the solution of the exercises.
Use only A4 white papers without stapling or foldings to simplify the scanning operations.
Exam duration: 90 minutes.
Books and lecture notes not allowed.
Maximum grade: 30 LODE
In addition to the message sent by the online system, students with disabilities or Specific Learning Disorders (SLD) are invited to directly inform the professor in charge of the course about the special arrangements for the exam that have been agreed with the Special Needs Unit. The professor has to be informed at least one week before the beginning of the examination session in order to provide students with the most suitable arrangements for each specific type of exam.