序列串接算數碼及迴旋碼其低複雜度整合式訊源/通道渦輪解碼之研究

A Study of Low-complexity Joint Source-Channel Turbo Decoding for Serially Concatenated Arithmetic Codes and Convolutional Codes

林郁婷(Yu-Ting Lin)

指導教授 ： 黃育銘

國立暨南國際大學/科技學院/資訊工程學系/碩士(2010年)

https://doi.org/10.6837/NCNU.2010.00176

摘要

加入冗餘符號(Forbidden symbol)的算數碼(Arithmetic code)可用有限狀態機(Finite State Machines:FSM)來詮釋，並在解碼時使用格狀結構(trellis structure)做解碼。
本論文使用算數碼作為訊源碼(source code)，迴旋碼(convolutional code)為通道碼(channel code)，並使用整合式訊源/通道解碼作解碼。在此系統中，我們運用修改過的SOVA(Soft Output Viterbi Algorithm)演算法做算數碼解碼。實驗結果顯示，在修改過的SOVA演算法裏，當β值設為外來資訊的平均，其疊代效果較好。此外，也對此系統作Histogram分析。

關鍵字

整合式訊源/通道解碼 ； SOVA演算法 ； Histogram

並列摘要

Arithmetic codes with forbidden symbols can be modeled as a finite state machine and then can be decoded by using a trellis structure.
In this dissertation, the arithmetic code is used for source coding, the convolutional code is used for channel coding and the joint source/channel Turbo decoding scheme is used for decoding. In this serially concatenated system, we use a modified SOVA(Soft Output Viterbi Algorithm) algorithm as the arithmetic decoder. Experimental results show that the performance is better while the value of β is set to the average of all extrinsic information values. Furthermore, the Histogram are also presented for analyzing this system.

並列關鍵字

Joint Source/Channel Decoding ； Soft Output Viterbi Algorithm ； Histogram

參考文獻

[1]. H.Witten, R. M.Neal, and J. G.Cleary, “Arithmetic Coding for Data Compression,” Communication of the ACM, Vol. 30, Jun. 1987.

[2]. C. Boyd, J. Cleary, S. Irvine, I. Rinsma-Melchert, and I. Witten, “Integrating Error Detection into Arithmetic Coding,” IEEE Transactions on Communications, Vol. 45, pp. 1-3, Jan. 1997.

[3]. B. Dongsheng, W. Hoffman, and K. Sayood, “State Machine Interpretation of Arithmetic Codes for Joint Source and Channel Coding,” Proceedings of Data Compression Conference (DCC), pp. 143-152, 2006.

[4]. S. Ben-Jamaa, C. Weidmann, and M. Kieffer, “Asymptotic Error Correcting Performance of Joint Source Channel Schemes Based on Arithmetic Coding,” Proceedings of IEEE Workshop on multimedia Signal Processing (MMSP), Oct. 2006.

[5]. A. Zribi, S. Zaibi, R. Pyndiah, and A. Bouall?gue, “Low-complexity Joint Source/Channel Turbo Decoding of Arithmetic Codes,” Proceedings of 5th International Symposium on Turbo Codes and Related Topics, pp. 385-389, Sept. 2008.