Chapter 12: Channel Coding

Learning Objectives

• Design linear block codes using generator and parity-check matrices and determine their error-correcting capability from the minimum Hamming distance
• Analyse convolutional codes via trellis diagrams and apply the Viterbi algorithm for maximum-likelihood sequence decoding
• Explain the principles of turbo codes, including parallel concatenation, iterative decoding, and EXIT chart analysis
• Describe LDPC codes using Tanner graphs, apply belief-propagation decoding, and explain density evolution for capacity-approaching design
• Understand channel polarization and successive cancellation decoding for polar codes, including CRC-aided list decoding
• Analyse bit-interleaved coded modulation (BICM) and explain why separate coding and modulation with interleaving is near-optimal
• Compare HARQ types (Chase combining, incremental redundancy) and design coding strategies for fading channels using interleaving