Wavelets and subband coding
JPEG 2000: Image Compression Fundamentals, Standards and Practice
JPEG 2000: Image Compression Fundamentals, Standards and Practice
Source and Channel Coding: An Algorithmic Approach
Source and Channel Coding: An Algorithmic Approach
JPEG 2000 backward compatible error protection with Reed-Solomon codes
IEEE Transactions on Consumer Electronics
IEEE Transactions on Consumer Electronics
High performance scalable image compression with EBCOT
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
A syntax-preserving error resilience tool for JPEG 2000 based on error correcting arithmetic coding
IEEE Transactions on Image Processing
Reliability considerations in mobile devices
Proceedings of the 3rd international conference on Mobile multimedia communications
| Hi-index | 0.00 |
Entropy coding, and specifically arithmetic codes are particularly sensitive to bit errors. Indeed, due to the memory inherent to the arithmetic coding a single flipped bit may cause desynchronization of the decoder, hence all the remaining symbols can be erroneous. In this paper a detailed study of complexity, for a known in literature correction algorithm, is presented. In particular the amount of memory required to implement the algorithm has been evaluated, proposing two possible approaches: previous state and repeat current pass. Experimental results show that the second method requires a lower amount of memory than the first. Furthermore the performance achieved by the error correction algorithm, in terms of decoded frames per second, have been analyzed. To this purpose the MQ decoder rate has been evaluated.