Linear (zero–one) programming approach to fixed-rate entropy-coded vector quantisation

Integer Programming Approach to Fixed-rate Entropy-coded Quantization

| This paper describes two new xed-rate entropy-coded quantization methods for stationary memoryless sources where the structure of code-words are derived from a variable-length scalar quantizer. In the rst method, we formulate the quantization as a zero-one integer optimization problem. We show that the resulting integer program can be closely approximated by solving a simple linear program. T...

Efficient algorithms for fixed-rate entropy-coded vector quantization

In quantisation of any source with a nonuniform probability density function, the entropy coding of the quantizer output can result in a substantial decrease in bit rate. A straight-forward entropy coding scheme presents us with the problem of the variable data rate. A solution in a space of dimensionality N is to select a subset of elements in the N-fold cartesian product of a scalar quantiaer...

An efficient approach to lattice-based fixed-rate entropy-coded vector quantization

In the absence of channel noise, variable-length quantizers perform better than xed rate Lloyd-Max quantizers for sources with a non-uniform density function. However, channel errors can lead to a loss of synchronization resulting in a propagation of error. To avoid having variable rate, one can use a vector quantizer selected as a subset of high probability points in the Cartesian product of a...

A hierarchical dynamic programming approach to fixed-rate, entropy-coded quantization

A Low Complexity Method for Fixed rate Entropy coded Vector Quantization based on Integer Programming

This paper describes a new approach to Fixed rate Entropy coded Vector Quanti zation FEVQ for stationary memoryless sources where the structure of code words are derived from a variable length scalar quantizer We formulate the quantization search operation as a zero one integer optimization problem and show that the resulting integer program can be closely approximated by solving a simple linea...