Data compression using variable-to-fixed length codes

作者: Yuriy Reznik

DOI:

关键词:

摘要: This disclosure is directed to techniques for memory efficient variable fixed length (VF) coding a variety of applications, such as media coding. For example, may be applied code digital video, image, audio, or speech data. The described in this utilize algebraic properties VF trees constructed using Tunstall Khodak algorithms, and employ combinatorial enumeration construction, encoding decoding codewords. some the implemented within encoders, decoders, combined encoder-decoders (CODECs). Also, aspects, various attributes defining tree according provided data structure stored associated with device.

参考文章(20)
S.A. Savari, Variable-to-fixed length codes for predictable sources data compression conference. pp. 481- 490 ,(1998) , 10.1109/DCC.1998.672213
Y.A. Reznik, W. Szpankowski, Improved behaviour of tries by the "symmetrization" of the source data compression conference. pp. 372- 381 ,(2002) , 10.1109/DCC.2002.999975
T. Tjalkens, F. Willems, Variable-to-fixed length codes: a geometrical approach to low-complexity source codes data compression conference. pp. 573- ,(2000) , 10.1109/DCC.2000.838220
V.I. Mudrov, An algorithm for numbering combinations USSR Computational Mathematics and Mathematical Physics. ,vol. 5, pp. 280- 282 ,(1965) , 10.1016/0041-5553(65)90142-4
T. Cover, Enumerative source encoding IEEE Transactions on Information Theory. ,vol. 19, pp. 73- 77 ,(1973) , 10.1109/TIT.1973.1054929
B. Ryabko, J. Astola, Fast codes for large alphabet sources and its application to block encoding international symposium on information theory. pp. 112- ,(2003) , 10.1109/ISIT.2003.1228126
T. Tjalkens, F. Willems, Variable to fixed-length codes for Markov sources IEEE Transactions on Information Theory. ,vol. 33, pp. 246- 257 ,(1987) , 10.1109/TIT.1987.1057285
T. Algra, Fast and efficient variable-to-fixed length coding algorithm Electronics Letters. ,vol. 28, pp. 1399- 1401 ,(1992) , 10.1049/EL:19920890