Advanced Mobile Communications

This course is held in English and is provided in winter semester only. It is equivalent to 5 creditpoints.

Schedule

Link to lecture database

Contents

The lecture Advanced Mobile Communications continues the lecture Mobilkommunikationsgeräte and consists of the following chapters:

6. Classical block codes

• Linear block codes
• Systematic structure
• Parity-check matrix
• Minimum distance
• Capabilities (detection and correction of errors)
• Standard array and syndrome decoding
• Single-parity check codes
• Repetition codes
• Self-dual codes
• Number theoretical primer (nulls, units, irreducibles, primes, composites; rings; integral domains, Euclidean domains; gcd; Euclidean algorithm; unique factorization; minimal polynomials; isomorphism; conjugates; cyclotomic cosets; finding irreducible polynomials)
• Binary cyclic codes (cyclic codes and ideals; generator polynomial; check polynomial; idempotents; minimal ideals and primitive idempotents; binary Hamming codes; simplex codes; BCH-Codes)
• Construction of new codes from old (overall parity check; puncturing; expurgating; augmenting; lengthening; shortening)
• Reed-Muller codes (definition; properties; punctured RM codes; construction principles, RM codes in 3GPP)

7. Polar codes

• History
• Information theoretical basics (probability, mutual information, entropy)
• Construction (channel polarization; binary erasure channel; four examples)

8. Low density parity check (LDPC) codes

• History
• Structure
• Tanner graphs
• Decoding of LDPC codes (LLR processing, sum-product algorithm/SPA)

9. Convolutional codes

• Endoding
• Decoding

10. Convolutional Turbo-codes

• Structure (encoder, constituent codes)
• Typical performance
• Decoding (decoder, Log-MAP, Max*-Log-MAP, Max-log-MAP)

11. List of publications