跳到主要內容

臺灣博碩士論文加值系統

(3.236.124.56) 您好!臺灣時間:2021/07/30 05:31
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:王思凱
研究生(外文):Sz-Kai Wang
論文名稱:無線通訊之多重存取合作式編碼
論文名稱(外文):Collaborative Coding Multiple Access for Wireless Communications
指導教授:呂忠津
指導教授(外文):Prof. Chung-Chin Lu
學位類別:碩士
校院名稱:國立清華大學
系所名稱:電機工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2004
畢業學年度:92
語文別:英文
論文頁數:37
中文關鍵詞:合作式編碼多重存取通道合作式碼複值多重存取合作式編碼多重存取干擾合作式解碼
外文關鍵詞:collaborative codingmultiple access channelcollaborative codescomplex-valued collaborative coding multiple accessmultiple access interferencecollaborative decoding
相關次數:
  • 被引用被引用:0
  • 點閱點閱:82
  • 評分評分:
  • 下載下載:5
  • 收藏至我的研究室書目清單書目收藏:0
合作式編碼(collaborative coding)是針對多重存取通道(multiple access channel)編碼的技術,利用每個使用者合作式碼之間的關係,在接收端可以設計出簡單的演算法解碼出每個使用者傳輸的資訊。在沒有雜訊的固定通道之下,接收端可以保證完全正確地解碼而沒有錯誤產生;在有雜訊的固定通道之下,合作式編碼也有一些訊息保護錯誤更正的功能。如何讓每個使用者都能擁有較高的資訊傳輸速率以及系統在解碼程序中擁有較低的複雜度是沒有雜訊或是有雜訊的固定通道下合作式編碼研究的主要目標。

無線通訊是現在及未來的主要通訊技術,在無線傳輸的環境中,除了雜訊的影響之外,傳送的訊號很容易被衰褪(fading)現象嚴重破壞,造成訊號強度的不穩定以及增加接收端正確解碼的困難度。在這篇論文之中,我們介紹了一個能應用在無線衰褪通道的多重存取合作式編碼技術,它能利用合作式碼的結構和特性去估測通道的狀況,解決不同使用者在上傳過程中遭受到的時變性衰褪增益和相位偏移對解碼程序所造成的問題,還能避免因為多重存取干擾(multiple access interference)造成的效能衰減。此外,在論文中我們也提出了建構合作式碼的基本原則以及其理論背景,以達到最佳的效能以及較高的資訊傳輸速率為前提,設計出一些建構合作式碼的方法,並且做了相關的系統模擬和效能比較。
Collaborative coding means the coding techniques for multiple access channels. Collaborative coding systems with a high data rate for each user and low complexity of decoding are desired in the noiseless or noisy channels. Some $T$-user collaborative coding techniques are proposed for wireless fading channels in this thesis, and principles of code construction are also presented. Well performance and high data rate of each user are the two chief considerations of our code construction.
Contents
1 Introduction 1
2 Collaborative Coding Multiple Access 3
2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.2 _-user CCMA Schemes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
2.3 Hard Decision (HD) Decoding . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.4 Maximum Likelihood Soft Decision (MLSD) Decoding . . . . . . . . . . . . . . . 6
2.5 Complex-Valued Collaborative Coding Multiple Access (CV-CCMA) . . . . . . . 6
2.5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
2.5.2 Estimation and Detection Processes . . . . . . . . . . . . . . . . . . . . . 7
2.5.3 Estimation and Detection Processes in the Matrix Form . . . . . . . . . . . 9
3 Principles of Code Construction 11
3.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
3.1.1 Least Squares Solution . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
3.1.2 Least Squares Problems with Several Variables . . . . . . . . . . . . . . . 13
3.2 Principles of Code Construction . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
4 Code Construction Methods 18
4.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
4.2 Code Construction Method I . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
4.3 Code Construction Method II . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
4.3.1 Walsh-Hadamard Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . 21
4.3.2 Code Construction Method . . . . . . . . . . . . . . . . . . . . . . . . . . 22
4.4 Code Construction Method III . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
5 Simulation Results 24
5.1 Comparison between Matched Filter Decoding and Collaborative Decoding of SSMA 24
5.2 Wireless Collaborative Coding Multiple Access Systems . . . . . . . . . . . . . . 25
6 Conclusions 36
[1] C. E. Shannon, ”Two-way communication channels,” in Proc. 4th Berkeley Symp. Math. Stat.
Prob., vol. 1, pp. 611-644, 1961.
[2] T. Kasami and S. Lin, ”Coding for a multiple-access channel,” IEEE Trans. Inform. Theory,
vol. IT-22, pp. 129-137, Mar. 1976.
[3] E. J.Weldon Jr. and K. P. Yiu, ”Coding for a multiple access channel,” presented at Int. Symp.
Inform. Theory, Ronneby, Sweden, 1976.
[4] E. J. Weldon Jr., ”Coding for a multiple access channel,” Inform. Contr., vol. 36, no.3, pp.
256-274, 1978.
[5] M. A. Deaett and J. K. Wolf, ”Some very simple codes for the nonsynchronized two-user
multiple-access adder channel with binary inputs,” IEEE Trans. Inform. Theory, vol. IT-24,
no. 5, pp. 635-636, Sept. 1978.
[6] R. Ahlswede and V. B. Balakirsky, ”Construction of uniquely decodable codes for the twouser
binary adder channel,” IEEE Trans. Inform. Theory, vol. 45, no. 1, pp. 326-330, Jan.
1999.
[7] S. C. Chang and E. J.Weldon Jr., ”Coding for _-user multiple-access channels,” IEEE Trans.
Inform. Theory, vol. IT-25, no.6, pp. 684-691, Nov. 1979.
[8] T. J. Ferguson, ”Generalized _-user codes for multiple-access channels,” IEEE Trans. Inform.
Theory, vol. IT-28, no. 5, pp. 775-778, Sept. 1982.
[9] S. C. Chang, ”Further results on coding for _-user multiple-access channels,” IEEE Trans.
Inform. Theory, vol. IT-30, no. 2, pp. 411-415, Mar. 1984.
[10] G. H. Khachatrian and S. S. Martirossian, ”Code construction for the _-user noiseless adder
channel,” IEEE Trans. Inform. Theory, vol. 44, no. 5, pp. 1953-1957, Sept. 1998.
[11] B. L. Hughes and A. B. Cooper III, ”Nearly optimal multiuser codes for the binary adder
channel,” IEEE Trans. Inform. Theory, vol. 42, no. 2, pp. 387-398, Mar. 1996.
[12] S. I. Bross and I. F. Blake, ”Upper bound for uniquely decodable codes in a binary input
'-user adder channel,” IEEE Trans. Inform. Theory, vol. 44, no. 1, pp. 334-340, Jan. 1998.
[13] G. Ungerboeck, ”Channel coding with multilevel/phase signals,” IEEE Trans. Inform. Theory,
vol. IT-28, no. 1, pp. 55-66, Jan. 1982.
[14] H. C. A. Van Tilborg, ”An upper bound for codes for the noisy two-access binary adder
channel,” IEEE Trans. Inform. Theory, vol. IT-32, no. 3, pp. 436-440, May 1986.
[15] F. H. Ali and B. Honary, ”Low complexity soft decision decoding technique for _-user collaborative
coding multiple-access channels,” Electronics Letters, vol. 27, no. 13, Jun. 1991.
[16] F. H. Ali and B. Honary, ”Collaborative coding and decoding techniques for multiple access
channel,” IEE Proc.-Commun., vol. 141, no. 2, Apr. 1994.
[17] S. D. Morgera and L. Zhang, ”Performance of uplink cooperative code division multiple
access over an AWGN channel ,” IEEE Int. Conf. Commun., vol. 1, pp. 81-85, Jun. 1997.
[18] V. P. Telang and M. A. Herro, ”Error control coding for the '-user mod-2 multiple-access
channel,” IEEE Trans. Inform. Theory, vol. 44, no. 4, pp. 1632-1642, Jul. 1998.
[19] R. L. Peterson, R. E. Ziemer, and D. E. Borth, Introduction to spread spectrum communications.
London: Prentice-Hall, 1995.
[20] J. G. Proakis, Digital communication, 4th ed. New York: McGraw-Hill, 2001.
[21] F. H. Ali, S. A. G. Chandler, and S. Soysa, ”Complex-valued receiver for multiuser collaborative
coding schemes,” Electronics Letters, vol. 31, no. 5, Mar. 1995.
[22] F. H. Ali and S. Soysa, ”Complex-valued collaborative coding multiple access for fading
channels,” IEE Proc.-Commun., vol. 148, no. 5, Oct. 2001.
[23] F. H. Ali, S. Soysa, and S. A. G. Chandler, ”Channel capacity limits for multiple-access
channels with slow Rayleigh fading,” Electronics Letters, vol. 32, no. 16, Aug. 1996.
[24] N. Yee and J. P. M. G. Linnartz, ”Multi-carrier CDMA in an indoor wireless radio channel,”
Memorandum UCB/ERL M94/6, U.C. Berkeley, Electronics Research Lab.
[25] S. Verdu, Multiuser detection. Cambridge: Cambridge University Press, 1998.
[26] N. Benvenuto and G. Cherubini, Algorithms for communications systems and their applications.
West Sussex: John Wiley & Sons Ltd, 2002.
[27] G. H. Golub and C. F. Van Loan, Matrix computations, 3rd ed. Baltimore, Maryland: The
Johns Hopkins University Press, 1996.
[28] R. M. Gray, ”Toeplitz and circulant matrices: a review,” Lucent Technologies, Aug. 2002.
[29] G. Strang, Linear algebra and its applications, 3rd ed. Orlando, Florida: Harcourt Brace
Jovanovich, 1988.
[30] O. Bretscher, Linear algebra with applications. London: Prentice-Hall, 1997.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關論文