Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Channel Coding: Convolutional Codes

In course

EE-543: Advanced wireless receivers

Students extend their knowledge on wireless communication systems to spread-spectrum communication and to multi-antenna systems. They also learn about the basic information theoretic concepts, about channel coding, and bit-interleaved coded modulation. ...

Description

This lecture covers the fundamentals of channel coding, focusing on convolutional codes. It explains the importance of error detection and correction in reliable data transmission, the concept of automatic repeat request, and the purpose of channel coding in adjusting information rate to match channel capacity. The lecture delves into the basic idea of adding redundancy to data for error detection and correction, the efficiency of automatic repeat request, and the trade-offs in choosing the right block size. It also discusses the process of decoding convolutional codes using the Viterbi algorithm and the significance of log likelihood ratios in soft-output demapping.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

Ontological neighbourhood

Information engineering

Information theory: Coding theory

Related concepts (32)

Error correction code

In computing, telecommunication, information theory, and coding theory, forward error correction (FEC) or channel coding is a technique used for controlling errors in data transmission over unreliable or noisy communication channels. The central idea is that the sender encodes the message in a redundant way, most often by using an error correction code or error correcting code (ECC). The redundancy allows the receiver not only to detect errors that may occur anywhere in the message, but often to correct a limited number of errors.

Convolutional code

In telecommunication, a convolutional code is a type of error-correcting code that generates parity symbols via the sliding application of a boolean polynomial function to a data stream. The sliding application represents the 'convolution' of the encoder over the data, which gives rise to the term 'convolutional coding'. The sliding nature of the convolutional codes facilitates trellis decoding using a time-invariant trellis. Time invariant trellis decoding allows convolutional codes to be maximum-likelihood soft-decision decoded with reasonable complexity.

Coding theory

Coding theory is the study of the properties of codes and their respective fitness for specific applications. Codes are used for data compression, cryptography, error detection and correction, data transmission and data storage. Codes are studied by various scientific disciplines—such as information theory, electrical engineering, mathematics, linguistics, and computer science—for the purpose of designing efficient and reliable data transmission methods.

Error detection and correction

In information theory and coding theory with applications in computer science and telecommunication, error detection and correction (EDAC) or error control are techniques that enable reliable delivery of digital data over unreliable communication channels. Many communication channels are subject to channel noise, and thus errors may be introduced during transmission from the source to a receiver. Error detection techniques allow detecting such errors, while error correction enables reconstruction of the original data in many cases.

Viterbi decoder

A Viterbi decoder uses the Viterbi algorithm for decoding a bitstream that has been encoded using a convolutional code or trellis code. There are other algorithms for decoding a convolutionally encoded stream (for example, the Fano algorithm). The Viterbi algorithm is the most resource-consuming, but it does the maximum likelihood decoding. It is most often used for decoding convolutional codes with constraint lengths k≤3, but values up to k=15 are used in practice. Viterbi decoding was developed by Andrew J.

Related lectures (54)

Lecture: Shannon

Covers the basics of information theory, focusing on Shannon's setting and channel transmission.

Information Theory: Source Coding, Cryptography, Channel Coding

Covers source coding, cryptography, and channel coding in communication systems, exploring entropy, codes, error channels, and future related courses.

Error Correction Codes: Basics

Introduces erasure and error channels, Hamming distance, and error correction codes.

Linear Block Codes: Basics

Covers the basics of linear block codes and systematic codes over a field F.

Convolutional Codes: Decoding and Eye Diagrams