VLSI implementation of SISO arithmetic decoders for joint source channel coding
Proceedings of the conference on Design, automation and test in Europe
A feasible VLSI engine for soft-input-soft-output for joint source channel codes
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Joint decoding of unequally protected JPEG2000 bitstreams and reed-Solomon codes
IEEE Transactions on Image Processing - Special section on distributed camera networks: sensing, processing, communication, and implementation
Chase-Like Decoding of Arithmetic Codes with Applications
International Journal of Computer Vision and Image Processing
| Hi-index | 0.01 |
In this paper, an innovative joint-source channel coding scheme is presented. The proposed approach enables iterative soft decoding of arithmetic codes by means of a soft-in soft-out decoder based on suboptimal search and pruning of a binary tree. An error-resilient arithmetic coder with a forbidden symbol is used in order to improve the performance of the joint source/channel scheme. The performance in the case of transmission across the AWGN channel is evaluated in terms of word error probability and compared to a traditional separated approach. The interleaver gain, the convergence property of the system, and the optimal source/channel rate allocation are investigated. Finally, the practical relevance of the proposed joint decoding approach is demonstrated within the JPEG 2000 coding standard. In particular, an iterative channel and JPEG 2000 decoder is designed and tested in the case of image transmission across the AWGN channel