Design of finite-state machines for quantization using simulated annealing
Kuruoglu Ercan Engin, Ayanoglu Ender
Proceedings of the 1993 IEEE International Symposium on Information Theory
Publ by IEEE, Piscataway, NJ, United States
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27808
In this paper, the combinatorial optimization algorithm known as simulated annealing is used for the optimization of the trellis structure or the next-state map of the decoder finite-state machine in trellis waveform coding. The generalized Lloyd algorithm which finds the optimum codebook is incorporated into simulated annealing. Comparison of simulation results with previous work in the literature shows that this combined method yields coding systems with good performance.
- Conference Paper 2294