Gaussian Multiple Description Coding with Low-Density Generator Matrix Codes

It is shown that the coding problem for an arbitrary point on the dominant face of an L-description El Gamal-Cover (EGC) region can be converted to that for a vertex of a K-description EGC region for some K≤ 2L-1, where the latter problem can be solved via successive coding. A practical scheme is proposed for the quadratic Gaussian case by reducing each step in successive coding to a Gaussian quantization operation and implementing such an operation using low-density generator matrix codes. The effectiveness of this scheme is verified through extensive simulation experiments.