以六角形交錯器演算法產生 S 隨機的交錯器｜國立臺灣科技大學博碩士論文系統

簡易檢索 / 詳目顯示

回結果列表

研究生：	黃文宗 Wen-Tsung Huang
論文名稱：	以六角形交錯器演算法產生 S 隨機的交錯器 Hexagon interleaver algorithm for generating S-random interleaver
指導教授：	蘇順豐 Shun-Feng Su
口試委員:	姚立德 none 楊谷洋 none 張志永 none 蔡超人 none
學位類別：	碩士 Master
系所名稱：	電資學院 - 電機工程系 Department of Electrical Engineering
論文出版年：	2005
畢業學年度：	93
語文別：	英文
論文頁數：	67
中文關鍵詞：	渦輪碼、交錯器
外文關鍵詞：	Turbo Code, interleaver
相關次數：	點閱：287 下載：0
分享至:	分享至facebook 分享至twitter

查詢本校圖書館目錄查詢臺灣博碩士論文知識加值系統勘誤回報

上一筆

在UMTS的規格中，渦輪碼的編碼封包是可變動的，且其變動的範圍從40 bits~5114 bits。由於封包的大小為可變動的，所以在編解碼中的交錯器需配合封包的大小做出對應的變動。到目前為止有關的交錯器研究，S-random 交錯器的表現是較好的，但由於現階段提出產生S-random 交錯器的演算法都太過於複雜，以至於真正要將演算法實現於應用上仍有許多困難有待解決。因此，我們提出一個新的能夠產生S-random 交錯器的六角形交錯器演算法，此演算法利用固定的步驟在固定的位址做資料交換然後依指定順序讀出完成交錯器，再依封包大小要求刪減交錯器的大小。
在六角形交錯器演算法的效能呈現上，我們將與UMTS 標準的交錯器做比較，呈現的內容將會包含: spreading 特性參數、IDS 基準程度、軟體模擬結果。

In the specification of UMTS, the frame size of Turbo Codes is variable and it ranges from 40 bits to 5114 bits. Since the frame size is variable, the interleaver of Turbo Codes needs to cooperate with the desired frame size to make corresponding changes. S-Random interleavers have shown to have nice performance so far. But, they need more cost to implement due to acute time and space complexities. Hence we proposed a new S-random interleaver generating algorithm, Hexagon interleaver. The proposed interleaver uses data exchange in fixed locations and to obtain interleaver with nice spread property. The performance of Hexagon interleaver is compared to that of UMTS interleaver. The results show superior performance to that of UMTS interleaver, in terms of spread property parameters, IDS measure and bit error probabilities. Besides, a new pruning technique is proposed and used in UMTS interleaver. It is shown that the proposed pruning technique can improve the UMTS performance in request of pruning more positions.

摘要………………………………………………………………………………	I
Abstract………………………………………………………………………………	II
誌謝…………………………………………………………………………………	III
Table of Contents……………………………………………………………………	IV
List of Tables………………………………………………………………………	VI
List of Figures………………………………………………………………………    VII
Chapter 1 INTRODUCTION……………………………………………………   	1
1.1 Digital Communication Systems…………………………………………	1
1.2 Motivations and Related Work……………………………………………	2
1.3Thesis Organization…………………………………………………………	3
Chapter 2 INTRODUCTION OF TURBO CODES……………………………              4
2.1 Introduction………………………………………………………………	4
2.2 Convolutional Code………………………………………………………	6
2.2.1 Encoder Structure…………………………………………………    	6
2.2.2 Transfer Function of Convolutional Code…………………………	9
2.2.3 Decoder……………………………………………………………     	11
2.3 Turbo Code…………………………………………………………………	15
2.3.1 Turbo Encoder………………………………………………………	         15
2.3.2 Turbo Decoder………………………………………………………    	16
2.4 Criterion and Constrain of Interleaver Designing…………………………	17
2.4.1 IDS measure………………………………………………………     	17
2.4.2 S-random interleaver………………………………………………  	21
2.5 UMTS interleaver…………………………………………………………	22
Chapter 3 HEXAGON INTERLEAVER…………………………………………   	28
3.1 The problem of variable interleaver size……………………………	28
3.2 Description of the algorithm………………………………………………	30
3.3 A better understanding of the Hexagon interleaver………………………	36
Chapter 4 PRUNING TECHNIQUE……………………………………………   	39
4.1 The problem of pruning technique……………………………………	39
4.2 Description of the algorithm………………………………………………	40
4.3 A better understanding of the Hexagon interleaver………………………	41
Chapter 5 EXPERIMENTAL RESULTS…………………………………………	         43
5.1 Introduction………………………………………………………………	43
5.2 Comparisons between UMTS interleavers and Hexagon interleavers……	43
5.3 Comparisons between UMTS interleaver and UMTS interleaver modification with our pruning technique………………………                    	49
Chapter 6 Conclusions and Future Work………………………………………	51
Reference……………………………………………………………………………	52
作者簡介……………………………………………………………………………	55
授權書………………………………………………………………………………	56

                                

[1] C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error- correcting coding and decoding: Turbo-codes. 1,” IEEE Conf. Communications, Vol. 2, pp. 1064–1070, 1993.
[2] C. Berrou and A. Glavieux, “Near optimum error correcting coding and decoding: turbo-codes,” IEEE Trans. Communications, Vol. 44, pp. 1261–1271, 1996.
[3] C. E. Shannon, “A mathematical theory of communication,' Bell System Technical Journal, vol. 27, pp. 379-423 and 623-656, 1948.
[4] C. Fragouli, R. D. Wesel, “Semi-random interleaver design criteria”, Proc. Communications Theory Symposium ad Globecom, vol. 5, Rio de Janeiro, Brazil, pp. 2352-2356, December 1999
[5] L. Dinoi, S. Benedetto, “Design of fast-prunable S-random interleavers”, IEEE Transactions on Wireless Communications, pp.1-9, 2004
[6] P. Popvski, L. Kocarev, A. Risteski, “Design of Flexible-length S-random Interleaver for Turbo Codes”, IEEE Communications, vol.8, no.7, JULY 2004
[7] M. Ferrari, F. Scalise, S. Bellini “Prunable S-Random Interleavers”, IEEE Communications vol.3, pp. 1711-1715, 2002
[8] H. R. Sadjadpour, J. A. Sloane, M. Salehi G. Nebe, “Interleaver Design for Turbo Codes”, IEEE Journal on selected areas in communications, vol.19, no.5, pp. 831-837, MAY 2001
[9] Fu-hua Huang, “Evaluation of soft output Decoding for Turbo Codes”, Virginia Tech Electrical Engineering master thesis, 1997
[10] L. R. Bahl, J. Cocke, F. Jelinek and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Information Theory, vol. IT-20, pp. 284-287, 1974.
[11] J. Hokfelt, O. Edfors, T. Maseng, “Turbo Codes: correlated extrinsic information and its impact on iterative decoding performance”, Proc. IEEE 49th Vehicular Technology Conf., vol.3, pp. 1871-1875, May 1999
[12] J. Hokfelt, O. Edfors, T. Maseng, “A Turbo Code Interleaver Design criterion based on the performance of Iterative Decoding”, IEEE communications, vol.5, NO.2, pp.52-54, February 2001
[13] S.Dolinar, D. Divsalar, “Weight Distributions for Turbo Codes Using Random and Nonrandom Permutations,” JPL TDA Progr. Rep., vol. 42-122, Aug. 1995.
[14] UMTS “Multiplexing and channel coding Release 4”, 3GPP TS 25.212 V4.5.0, 2002
[15] P. Roberson and P. Horner, “Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding,“ European Trans. Telecommunication, pp. 119-125, 1997.
[16] P. Robertson, E. Villebrun and P. Hoeher, “A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain,” Intern. Conf. Communications, vol. 2, pp. 1009–1013, 1995.
[17] S. Benedetto, G.. Montorsi, D. Divsalar, and F. Pollara, “Serial concatenation of interleaved codes: performance analysis, design and iterative decoding,” TDA Progr. pp. 47.1.1-47.1.7, 1996.
[18] Sangho Yoon, “Turbo decoder implementation, ” IEEE Conf. Vehicular Tech., vol. 3, pp. 1824–1828, 2001.
[19] A. J. Viterbi, “An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes,” IEEE J. Select. Areas Common., vol.16, pp. 260-264, 1998.
[20] P. Chaudhury, W. Wohr, and S. Onoe, “The 3GPP proposal for IMT-2000,” IEEE Communications Magazine, vol. 37, pp. 72 – 81, 1999.
[21] J. Vogt, K. Koors A. Finger and G. Fettweis, “Comparison of different turbo decoder realizations for IMT-2000,” IEEE Conf. Global Tele. vol. 5 pp. 2704 – 2708, 1999.
[22] 張智凱 “study on the implementation of Turbo Code for 3GPP”, 交通大學碩士論文, 2002

全文公開日期本全文未授權公開 (校外網路)

簡易檢索 / 詳目顯示

相關論文