Efficient alphabet partitioning algorithms for low-complexity entropy coding

@article{Said2005EfficientAP,
  title={Efficient alphabet partitioning algorithms for low-complexity entropy coding},
  author={Amir Said},
  journal={Data Compression Conference},
  year={2005},
  pages={183-192}
}
We analyze the technique for reducing the complexity of entropy coding consisting of the a priori grouping of the source alphabet symbols, and in dividing the coding process in two stages: first coding the number of the symbol's group with a more complex method, followed by coding the symbol's rank inside its group using a less complex method, or simply using its binary representation. Because this method proved to be quite effective it is widely used in practice, and is an important part in… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
4 Extracted Citations
13 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Similar Papers

Loading similar papers…