Low-Complexity Joint Source/Channel Turbo Decoding of Arithmetic Codes with Image Transmission Application
暂无分享,去创建一个
In this paper a novel joint source channel (JSC) decoding technique is presented. The proposed approach enables iterative decoding for serially concatenated arithmetic codes and convolutional codes. Iterations are performed between Soft In Soft Out (SISO) component decoders. For arithmetic decoding, we proposed to employ a low complex trellis search technique to estimate the best transmitted codewords and generate soft outputs. Performance of the presented system are evaluated in terms of PER, in the case of transmission across the AWGN channel. Simulation results show that the proposed JSC iterative scheme leads to significant gain in comparison with a traditional separated decoding. Finally, the practical relevance of the proposed technique is validated under an image transmission system using the SPIHT codec.
[1] M. Kieffer,et al. Analytical tools for optimizing the error correction performance of arithmetic codes , 2008, IEEE Transactions on Communications.
[2] R. Pyndiah,et al. Low-complexity joint source/channel turbo decoding of arithmetic codes , 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.
[3] Khalid Sayood,et al. State machine interpretation of arithmetic codes for joint source and channel coding , 2006, Data Compression Conference (DCC'06).