臺灣博碩士論文加值系統

近年來無線通訊技術與數位通訊蓬勃發展，系統需求與日俱增。未來數據傳輸所涵蓋的範圍勢必更加廣泛，傳輸速率也會越來越快。然而，這將會使得資料在傳輸的過程中受到雜訊干擾的程度變大，進而導致訊息無法正確被辨識。因此，如何降低雜訊對訊號的影響，使得錯誤得以更正的技術日益受重視，通道編碼(Channel Coding)的方式更成為系統設計的重要課題。各式通道編碼的技術中，方塊渦輪碼(Block Turbo Code, BTC)擁有卓越的更錯能力且硬體複雜度相對較低，非常適合應用在無線通訊產品當中。因此，本論文將針對方塊渦輪碼的編碼及解碼演算法做探討，並且分析方塊渦輪碼應用在IEEE 802.16 OFDM-PHY標準中之系統效能。

In the last ten years, the wireless communication techniques have been developed rapidly. In the future, the wireless communication systems will be requested to have higher data transmission rate. The transmitted signal will be seriously disturbed by the interference and noise. And then the system performance will be important. The block turbo codes have more excellent decoding performance and low complexity. Thus the decoding algorithm of block turbo codes will be investigated. Finally, for the IEEE 802.16 system, the performance of block turbo codes will be analyzed.

中文摘要 I
Abstract II
致謝 III
目次 IV
表目錄 VI
圖目錄 VII
章節 頁次
第一章 緒論 1
1.1 前言 1
1.2 FEC的演進與應用 1
1.3 研究動機 3
1.4 論文組織 3
第二章 方塊渦輪碼 4
2.1 簡介 4
2.2 BTC之編碼 5
2.3 最大可能性解碼 6
2.4 Chase演算法 7
2.5 軟式輸出 14
2.6 BTC之遞迴式解碼 16
2.7 模擬分析 20
第三章 IEEE 802.16軟體傳收機 24
3.1 WiMAX簡介 24
3.2 IEEE 802.16規格介紹 25
3.3 通道編碼 26
3.3.1 隨機化與解隨機化 26
3.3.2 前置錯誤更正碼 27
3.3.2.1 里德所羅門-迴旋碼 27
3.3.2.2 方塊渦輪碼 30
3.3.3 交錯與解交錯 33
3.4 調變 35
3.4.1 資料調變 35
3.4.2 導引調變 36
3.4.3 前置碼 37
3.5 正交分頻多工 40
3.5.1 時域描述 41
3.5.2 頻域描述 42
3.5.3 OFDM符元參數及傳送的信號 42
第四章 系統模擬分析與討論 45
4.1 通道模型 45
4.1.1 Gaussian Channel 45
4.1.2 Flat Fading Channel 46
4.1.3 Exponentially Decaying Rayleigh Fading Channel 49
4.2 系統效能模擬與分析 52
第五章 結論與未來展望 58
參考文獻 59

[1] R. Hamming, “Error detecting and error correcting codes,” Bell System Technical Journal, vol. 29, pp. 147-160, 1950.
[2] P. Elias, “Coding for noisy channels” IRE Convention Record, pt.4, pp. 37-47, 1995.
[3] I. Reed and G. Solomon, “Polynomial codes over certain finite fields,” Journal of the Society of Industrial and Applied Mathematics., vol. 8, pp. 300-304, June 1960.
[4] C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon Limit Error-Correcting Coding and Decoding: Turbo Codes,” in Proceedings of the International Conference on Communications, (Geneva, Switzerland), pp. 1064-1070, May 1993.
[5] A. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm.” IEEE Transactions on Information Theory, vol. IT-13, pp. 260-269, April 1967.
[6] R. G. Gallager, “Low density parity check codes,” IRE Trans. Inform. Theory, vol.8, pp. 21-28, Jan. 1962.
[7] IEEE Std.802.16-2004, Part 16： Air Interface for Fixed Broadband Wireless Access Systems, Oct. 2004.
[8] P. Elias, “Error-Free coding,” IRE Trans. Inform Theory, vol. IT-4, pp. 29-37, Sept. 1954.
[9] R. Phydiah, “Near-optimum decoding of product codes: Block turbo codes,” IEEE Trans. Commun., vol. 46, pp. 1003-1010, Aug. 1998.
[10] D. Chase, “A class of algorithm for decoding block codes with channel measurement information,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 170-182, Jan. 1972.
[11] 陳昱竹, “渦輪乘積碼解碼演算法之解碼效能與設計複雜度比較,” 交通大學碩士論文, Oct. 2005.
[12] 林慧美, “多階層渦輪乘積編碼調變技術” 中原大學碩士論文, Jun 2005.
[13] 陳俊良, “干擾環境下應用方塊渦輪碼於跳頻系統之研究,” 中原大學碩士論文, Jul. 2004.
[14] J. Hagenauer, E. Offer, and L. Papke, “Iterative decoding of binary block and convolutional codes,” IEEE Trans. Inform. Theory, vol. 42, pp. 429-445, No.2, Mar. 1996
[15] R. Pydiah, A. Glavieux, A Picart, and S. Jacg, “Near optimum decoding of product codes,” in proc. IEEE GLOBECOM’94 Conference., vol. 1/3, San Francisco, pp. 339-343, Nov.-Dec. 1994.
[16] A. Picrt and R. Pydiah, “Adapted iterative decoding of product codes,” in proc. GLOBECOM, pp. 2357-2362, 1999.
[17] P. A. Martin and P. Taylor, “On a adaptive reduced-complexity iterative decoding,” in proc. GLOBECOM, pp. 772-776, 2000.
[18] 劉政佑, “無線都會網路系統之Simulink模擬平台” 中華大學碩士論文, Aug 2006.
[19] B. Sklar, Digital Communications Fundamentals and Applications, 2nd ed. Prentice-Hall, 2001.