Codebook Design for Trellis
C.R. Nassar, Mohammad Soleymani · 1993
An important issue in trellis quantization is the design of the codebook. The standard method for codebook design has been a trellis adaptation of the generalized Lloyd algorithm. This algorithm e811 get stuck in suboptimal codebooks due to the presence of several locally minimum distortion values. Simulated annealing is an optimization procedure that uses randomness to escape local minima in its serurh for a globally minimum state. In this paper, we propose two methods of applying simulated annealing to the trellis quantization codebook design problem. The results presented for both a Gauss-Markov some and speech samples indicate that the resulting design with simulated annealing is independent of the initial codebook. Moreover, the results are consistent with the generalized Lloyd algorithm with an initial codebook generated using the extension method. This suggests that the extension method is an effective initial codebook selection method.