Abstract
A fast and efficient quantization technique is described. It is fixed-length, robust to bit errors, and compatible with most current compression standards. It is based on entropy-constrained quantization and uses the well-known and efficient Viterbi algorithm to force the coded sequence to be fixed-rate. Run-length coding techniques are used to improve the performance at low encoding rates. Simulation results show that it can achieve performance comparable to that of Huffman coded entropy-constrained scalar quantization with computational complexity increasing only linearly in block length.
Original language | English (US) |
---|---|
Pages (from-to) | 310-316 |
Number of pages | 7 |
Journal | Data Compression Conference Proceedings |
State | Published - 1997 |
Event | Proceedings of the 1997 Data Compression Conference, DCC'97 - Snowbird, UT, USA Duration: Mar 25 1997 → Mar 27 1997 |
ASJC Scopus subject areas
- Computer Networks and Communications