By Igal Sason, Department of Electrical Engineering, Technion – Israel Institute of Technology, Israel, sason@ee.technion.ac.il | Shlomo Shamai, Department of Electrical Engineering, Technion – Israel Institute of Technology, Israel, sshlomo@ee.technion.ac.il
This article is focused on the performance evaluation of linear codes under optimal maximum-likelihood (ML) decoding. Though the ML decoding algorithm is prohibitively complex for most practical codes, their performance analysis under ML decoding allows to predict their performance without resorting to computer simulations. It also provides a benchmark for testing the sub-optimality of iterative (or other practical) decoding algorithms. This analysis also establishes the goodness of linear codes (or ensembles), determined by the gap between their achievable rates under optimal ML decoding and information theoretical limits. In this article, upper and lower bounds on the error probability of linear codes under ML decoding are surveyed and applied to codes and ensembles of codes on graphs. For upper bounds, we discuss various bounds where focus is put on Gallager bounding techniques and their relation to a variety of other reported bounds. Within the class of lower bounds, we address de Caen's based bounds and their improvements, and also consider sphere-packing bounds with their recent improvements targeting codes of moderate block lengths.
Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial focuses on the performance evaluation of linear codes under optimal maximum-likelihood (ML) decoding. Though the ML decoding algorithm is prohibitively complex for most practical codes, their performance analysis under ML decoding allows to predict their performance without resorting to computer simulations. It also provides a benchmark for testing the sub-optimality of iterative (or other practical) decoding algorithms. This analysis also establishes the goodness of linear codes (or ensembles), determined by the gap between their achievable rates under optimal ML decoding and information theoretical limits.
In Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial, upper and lower bounds on the error probability of linear codes under ML decoding are surveyed and applied to codes and ensembles of codes on graphs. For upper bounds, we discuss various bounds where focus is put on Gallager bounding techniques and their relation to a variety of other reported bounds. Within the class of lower bounds, we address de Caen's based bounds and their improvements, and also consider sphere-packing bounds with their recent improvements targeting codes of moderate block lengths.
Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial is a comprehensive introduction to this important topic for students, practitioners and researchers working in communications and information theory.
Erratum 5.3 The 1967 sphere-packing bound
Commentary Submitted By: Igal Sason, Technion, Israel Intitute of Technology , sason@ee.technion.ac.il. Date Accepted: 8/10/2006
Erratum 5.4 Sphere-packing bounds revisited for moderate block lengths
Commentary Submitted By: Igal Sason, Technion, Israel Intitute of Technology , sason@ee.technion.ac.il. Date Accepted: 8/10/2006