臺灣博碩士論文加值系統

隨著網際網路的高度發展與通訊網路的普及，已使得提升網路頻寬與網路服務品質受到高度的注目；為了能大量地傳輸資訊，除了消極的提高頻寬之外，在積極面充分地使既有的頻寬發揮最大效益，也是一個極大的課題，這便是通道編碼的目的。在各式各樣的通道編碼中，各有各的優勢與其應用層面，這使得如何選擇通道編碼成為效率與可靠度間的兩難問題。為此，本文提出一個可供選擇性的通道編碼策略，使其能自動因應環境需要選擇適當的通道編碼，例如當環境嚴苛時因為資料錯誤率高，系統便可為其配置改錯能力較高的編碼，而當環境條件並不嚴苛時便可為之配置較簡易的通道編碼，如此一來對於計算能力不高的行動通訊而言，無疑減輕通訊所需花費在通道編碼複雜運算的電力，這對行動通訊的省電能力而言是相當重要的課題，也可同時滿足通道編碼效能與計算時間間的取決，本文執行的主要目的，便是提出一個能自動因應環境的改變而選出最適當的通道編碼。

The improvement of the Internet’s capacity and its QoS (Quality of Service) has become a very important problem, since the highly development and popular of the Internet. In order to transfer huge of information, we have to make full use of the Internet’s capacity that has already exist, besides adding the Internet’s capacity. Channel coding in a network communication system could solve this question. Because there are several of channel codes, each has their own advantage and disadvantage. Choosing a channel code has became a trade off between effective and reliable. The purpose of this paper is to provide a strategy of channel code selection that will automatically select a right channel code for current channel status. For example, if the noise of a communication is higher then before, then the new system will automatically chose a complex channel code with high performance. In the other way, if the noise of a communication is lower then before, then the strategy will automatically chose a simple channel code. To simplify a channel code will be very useful for a mobile device with poor ability of calculation. And the strategy can also satisfy both the performance of a channel code and saving time in calculation. To provide an automatic selection channel code is the purpose of this paper.

目錄
摘要
Abstract
第一章 序論 1
第二章 原理介紹 5
2.1. OSI分層 5
2.2. 網路服務 7
2.3. ECC 13
2.4. 通道編碼 24
2.5. 國內外的發展情況 40
第三章 研究方法與實作 43
3.1 前言 43
3.2 研究方法 44
3.2.1 偵測通道環境BER值 45
3.2.2 通道編碼選擇公式 48
3.2.3 交換初始控制訊息 52
3.2.4 多套通道編碼選擇架構 53
3.2.5 單一編碼內編碼碼率選擇 54
3.3平台介紹 56
第四章 實驗數據分析與討論 57
4.1單一通道編碼 57
4.2 多種編碼碼率選擇架構 60
4.3多套通道編碼選擇架構 64
4.4各架構系統運算時間與比較 67
第五章 結論 71
第六章 參考文獻 73

[1]N. Abramson, "Cascade Decoding of Cyclic Product Codes," IEEE Transactions Communications, COM-16:398-402, Jun 1968.
[2]L. Bahl, S. Cocke, F. Jeinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate, “IEEE Trans. Inform. Theory, vol.20, pp.248-287, Mar. 1974.
[3]F. Beritelli, S. Casale, G. Ruggeri, "Performance comparison between VBR speech coders for adaptive VoIP applications," IEEE Communications Letters, pp.423-425 vol.5, Oct. 2001.
[4]D. Bertsekas and R. Gallager, “Data Networks”, 1992, by Prentice-Hall, Inc., A Simon & Schuster Company Englewood Cliffs, N.J. 07632.
[5]G. Berrou, A. Glavieux, and P. Thitmajshima, “Near Shannon limit error-correcting coding: turbo codes,” in Proc. 1993 IEEE Int. Conf. Comm., pp. 1064-1070, 1993.
[6]D. Bokolamulla, T. Aulin, "Reduced complexity iterative decoding for concatenated coding schemes," IEEE International Conference on Communications, pp.3135-3139, May 2003.
[7]J. J. Chang,D. J. Hwang, M. C. Lin, "Some extended results on the search for good convolutional codes," IEEE Transactions Information Theory, IT-43:1682-1697, Sept. 1997.
[8]M.-C. Chiu, C.-C. Chao, and C.-H. Wang, “Convolutional codes for unequal error protection,” IEEE International Symposium on Information Theory, pp. 290, June 1997.
[9]T.A. Choi, M.C. Nechyba, E.M. Schwartz, A.A. Arroyo, "Creation and analysis of a scenario based universal sensory driver layer with real-time fault tolerant properties," Proceedings. 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp.1857-1863 vol.2, Oct. 2003.
[10]O. Collins, "The subtleties and intricacies of building a constraint length 15 convolutional decoder," IEEE Transactions Communications, COM-40:1810-1817, Dec. 1992.
[11]H. Dong, I.D. Chakares, A. Gersho, E. Belding-Royer, J.D. Gibson, "Selective bit-error checking at the MAC layer for voice over mobile ad hoc networks with IEEE 802.11," IEEE Wireless Communications and Networking Conference, pp.1240-1245 Vol.2, March 2004.
[12]Fahmy, Y. Abdel Kader, H.G. El-Soudani, M., "Turbo coding scheme for GPRS system," Radio Science Conference, 2002. (NRSC 2002), pp.247-254, March 2002.
[13]M.P.C. Fossorier, S. Lin, "Differential trellis decoding of convolutional codes," IEEE Transactions Information Theory, IT-46:1046-1053, May 2000.
[14]J. Hagenauer, “Iterative decoding of binary block and convolutional codes,“ IEEE Trans. Inform. Theory, vol.42, no. 2, pp.429-445, Mar. 1996.
[15]J. Hagenauer, "Rate-compatible punctured convolutional codes (RCPC codes) and their applications," IEEE Transactions Communications, COM-36:389-400, April 1988.
[16]J. Hagenauer, E. Offer, and L. Papke, “Iterative decoding of binary block and convolutional codes,” IEEE Trans. Inform. Theory, vol. 42,pp. 429–445, Mar. 1996.
[17]S. Haykin, “Communication Systems—4/e”, 2000 by John Wiley & Sons, Inc.
[18]T. Hindelang, J. Hagenauer, M. Schmautz, W. Xu, "Channel coding techniques for adaptive multi rate speech transmission," IEEE International Conference on Communications, pp.744-748, June 2000.
[19]H. Holma, J. Melero, J. Vainio, T. Halonen, J. Makinen, "Performance of adaptive multirate (AMR) voice in GSM and WCDMA," IEEE Semiannual, pp.2177-2181 vol.4, April 2003.
[20]W. L. Hsu, Fongray Frank Young and H. C. Lee, “Performance Analyses and Studies for B3G Channel Coding,” 2004 Symposium on Digital Life and Internet Technologies, Tainan, Taiwan, P0167 Page 1-10, 2004, 6.
[21]F. Huband, F. Jelinek, "Channel Coding with a Sequential Algebraic Coding Scheme," IEEE Transactions Communications, pp.84-85 vol.19, Feb 1971.
[22]Kleider, J.E. Campbell, W.I., "An adaptive-rate anti-jam system for optimal voice communication," MILCOM 97 Proceedings, pp.1103-1107 vol.3, Nov. 1997.
[23]C.F. Lam, C. Chang, R. Karimi, "A study of ESD sensitivity in AMR and GMR recording heads," Electrical Overstress/Electrostatic Discharge Symposium Proceedings, pp.360-367, Oct. 1998.
[24]S. Leung-Yan-Cheong, E. Barnes, D. Friedman, "On some properties of the undetected error probability of linear codes," IEEE Transactions Information Theory, IT-25:110-112, Jan 1979.
[25]D. Lin, Z. Shidong, Y. Yan, "A new implementation algorithm for multiplexing and channel coding scheme in W-CDMA," Communication Technology Proceedings, 2000. WCC, pp.1685-1688 vol.2, Aug. 2000.
[26]S. LIN, D. J. Costello and JR. “Error Control Coding Fundamentals and Applications—2/e”, 2004 by Prentice-Hall, Inc.
[27]Manton, J.H., "A low cost channel coding scheme for wireless multimedia communications," IEEE International Conference, pp.455-458, Aug. 2001.
[28]J. Martins, A. Giulietti, M. Strum, "Performance comparison of convolutional and block turbo codes for WLAN applications," 2002. Proceedings of the Fourth IEEE International Caracas Conference on Devices, Circuits and Systems, pp.T032-1 - T032-5, April 2002.
[29]R. J. McEliece, C. L. Dantec and P. M. Piret, “Permutations preserving divisibility,” IEEE Trans. Inform. Theory, vol. 47, pp. 1206-1207, Mar. 2001.
[30]A. Mokhtar, A. Hassan, "Error control coding schemes for multiple channels," IEEE International Symposium on Information Theory, pp.497 ,June 2000.
[31]C. T. Ong, C. Leung, "On the undetected error probability of triple-error-correcting BCH codes," IEEE Transactions Information Theory, IT-37:673-678, May 1991.
[32]M. Petracca, A. Servetti, J.C. De Martin, "Voice transmission over 802.11 wireless networks using analysis-by-synthesis packet classification," First International Symposium on Control, Communications and Signal Processing, 2004., pp.587-590, 2004.
[33]E. Prange, "The use of information sets in decoding cyclic codes," IEEE Transactions Information Theory, IT-8:5-9, Sep 1962.
[34]Z. Qiao, L. Sun, N. Heilemann, E. Ifeachor, "A new method for VoIP quality of service control use combined adaptive sender rate and priority marking," IEEE International Conference on Communications, pp.1473-1477 Vol.3, June 2004.
[35]B. Robertson, “Improving decoder and code structure of parallel concatenated recursive systematic (turbo) codes,“ in Proc. 1994 IEEE Int. Conf. Universal Personal Comm., pp. 183-187, 1994.
[36]L. Rudolph, M. Mitchell, "Implementation of decoders for cyclic codes," IEEE Transactions Information Theory, IT-10:259-560, Jul 1964.
[37]M. Serizawa, H. Ito, "A packet loss recovery method using packet arrived behind the playout time for CELP decoding," IEEE International Conference on Acoustics, Speech, and Signal Processing, 2002., pp.I-169 - I-172 vol.1, May 2002.
[38]T. Sugita, T. Kasami, T. Fujiwara, "The weight distribution of the third-order Reed-Muller code of length 512," IEEE Transactions Information Theory, IT-42:1622-1625, Sept. 1996.
[39]A. Uvliden, S. Bruhn, R. Hagen, "Adaptive multi-rate. A speech service adapted to cellular radio network quality," Conference Record of the Thirty-Second Asilomar Conference on Signals, Systems & Computers, pp.343-347 vol.1, Nov. 1998.
[40]C. Weiss, C. Bettstetter, S. Riedel, "Code construction and decoding of parallel concatenated tail-biting codes," IEEE Transactions Information Theory,IT-47:366-386, Jan. 2001.
[41]M. Werner, T. Junge, P. Vary, "Quality control for AMR speech channels in GSM networks," IEEE International Conference on Acoustics, Speech, and Signal Processing, 2004, pp.1076-9 vol.3, May 2004.
[42]P. W. Wolniansky et. al., “V-BLAST: An architecture for realizing very high data rates over rich scattering wireless channels,” Proc. ISSSE-98, pp. 295-300, 1998.
[43]Y.-W. Wu, S.-C. Chang, "Coding scheme for synchronous CDMA systems," IEEE Transactions Information Theory, pp.1064-1067 vol.43, May 1997.
[44]F. Zesong, K. Jingming, "Channel coding strategy for adaptive multi-rate standard of 3G," TENCON ''02. Proceedings. 2002 IEEE Region 10 Conference on Computers, Communications, Control and Power Engineering, pp.1048-1051 vol.2, Oct. 2002.
[45]H. Zheng and K.J.R. Liu, "Multimedia services over digital subscriber lines," IEEE Signal Processing Magazine, SP-17:44-60, July 2000.
[46]楊豐瑞、楊豐任編著, 網路概論與實務 第二版, 松崗電腦圖書資料股份有限公司, 2004年5月.