Robust Predictive Quantization: Analysis and Design Via Convex Optimization

Alyson K. Fletcher

doi:10.1109/JSTSP.2007.910622

Robust Predictive Quantization: Analysis and Design Via Convex Optimization

2007-12-01

105

OA

AI

DOI：10.1109/JSTSP.2007.910622

Original

Original request for help

Save

Abstract

En 中文

Predictive quantization is a simple and effective method for encoding slowly-varying signals that is widely used in speech and audio coding. It has been known qualitatively that leaving correlation in the encoded samples can lead to improved estimation at the decoder when encoded samples are subject to erasure. However, performance estimation in this case has required Monte Carlo simulation. Provided here is a novel method for efficiently computing the mean-squared error performance of a predictive quantization system with erasures via a convex optimization with linear matrix inequality constraints. The method is based on jump linear system modeling and applies to any autoregressive moving average (ARMA) signal source and any erasure channel described by an aperiodic and irreducible Markov chain. In addition to this quantification for a given encoder filter, a method is presented to design the encoder filter to minimize the reconstruction error. Optimization of the encoder filter is a nonconvex problem, but we are able to parameterize with a single scalar a set of encoder filters that yield low MSE. The design method reduces the prediction gain in the filter, leaving the redundancy in the signal for robustness. This illuminates the basic tradeoff between compression and robustness.

Keywords:

Differential pulse code modulation

erasure channels

joint source-channel coding

linear matrix inequalities

Robust Predictive Quantization: Analysis and Design Via Convex Optimization

Abstract

Journal

Organization