Abstract
Arithmetic coding is a widely applied compression tool with superior coding efficiency to other entropy coding methods. However, it suffers from the error resilience and complexity. In this paper, the integer implementation of binary arithmetic coding with forbidden symbol for error resilience is studied. Coding redundancies for employing different quantization coefficients in probability representation and cost effective backtracking distance in bits for maximum a posteriori (MAP) decoding are studied in depth. We observe that the optimal quantization coefficients are independent of forbidden symbol and the probabilities of source and the cost effective backtracking distance is related to the source entropy and the given forbidden symbol probabilities. Such observations are also demonstrated by extensive experiments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic Coding for Data Compression. Communications of the ACM 30(6), 520–540 (1987)
Moffat, A., Neal, R.M., Witten, I.H.: Arithmetic Coding Revisited. ACM Trans. on Information Systems 16(3), 256–294 (1988)
Howard, P.G., Vitter, J.S.: Implementations of Arithmetic Coding. Image and Text Compression, 85–112 (1992)
Boyd, C., Cleary, J.G., Irvine, S.A., Melchert, I.R., Witten, I.H.: Integrating Error Detection into Arithmetic Coding. IEEE Trans. Communication 45(1), 1–3 (1997)
Wong, K., Lin, Q.Z., Chen, J.Y.: Error Detection in Arithmetic Coding with Artificial Markers. Computer & Mathematics with Applications 62(1), 359–366 (2011)
Xia, Z., Yang, M., Cui, H.: Error Detection of Arithmetic Coding Algorithm with Multiple Forbidden Symbols. Tsinghua University Natural Science 45(7), 935–938 (2005)
Chou, J., Ramchandran, K.: Arithmetic Coding Based Continuous Error Detection for Efficient ARQ-based Image Transmission. IEEE Areas Communication 18(6), 861–867 (2000)
Grangetto, M., Cosman, P., Olmo, G.: Joint Source Channel Coding and MAP Decoding of Arithmetic Codes. IEEE Trans. Communication 53(6), 1007–1016 (2005)
Jamaa, S.B., Weidmann, C., Kieffer, M.: Analytical Tools for Optimizing the Error Correction Performance of Arithmetic Code. IEEE Trans. Communications 56(9), 1458–1468 (2008)
Jamaa, S.B., Kieffer, M., Duhamel, P.: Improved Sequential MAP Estimation of CABAC Encoded Data with Objective Adjustment of the Complexity/Efficiency Tradeoff. IEEE Trans. Communication 57(7), 2014–2023 (2009)
Sinaie, M., Vakili, V.T.T.: A Low Complexity Joint Compression Error Detection Crypto Graphy Based on Arithmetic Coding. In: 10th International Conference on Digital Information Sciences Signal Processing and Applications (2010)
Spiteri, T., Buttigieg, V.: Arithmetic Coding for Joint Source Channel Coding. Signal Processing and Multimedia Applications 45, 5–15 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this chapter
Cite this chapter
Zhang, W., Cen, F., Zhu, F. (2012). Research on Practical Implementation of Binary Arithmetic Coding with Forbidden Symbol for Error Resilience. In: Sambath, S., Zhu, E. (eds) Frontiers in Computer Education. Advances in Intelligent and Soft Computing, vol 133. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27552-4_104
Download citation
DOI: https://doi.org/10.1007/978-3-642-27552-4_104
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27551-7
Online ISBN: 978-3-642-27552-4
eBook Packages: EngineeringEngineering (R0)