簡易檢索 / 詳目顯示

研究生: 魏君帆
Chun-Fan Wei
論文名稱: 迴旋編碼式之無線多重接取
Convolutional Coding for Wireless Multiple Access
指導教授: 呂忠津
Chung-Chin Lu
口試委員:
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 電機工程學系
Department of Electrical Engineering
論文出版年: 2005
畢業學年度: 93
語文別: 中文
論文頁數: 62
中文關鍵詞: 無線通訊多重存取
外文關鍵詞: wireless communication, multiple access
相關次數: 點閱:2下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 展頻系統是現在無線通訊最常用的多重存取技術,它可以很容易的設計及解碼。展頻系統在對抗人為惡意干擾上可以有很不錯的表現,但是在使用者人數增加時,錯誤率會大大的增加。我們稱之為多重存取干擾(multiple access interference),而這種影響是不會隨著訊號強度而變好,進而形成通訊系統的難題。我們利用迴旋編碼(convolutional code)來做為多重存取的傳輸方式,迴旋編碼式之無線多重接取是針對多重存取通道的技術,每個使用者利用不同迴旋編碼器編碼,並且利用最大相似正確地解出傳送的資訊來避免多重存取干擾。如何設計有效的編碼讓系統的錯誤率降低並且擁有較高的傳送效率是這個論文的主要研究課題。

    無線通訊是現在普遍的傳輸通訊方式,但無線通訊的傳輸環境卻有許多干擾的因素,除了受到雜訊的影響,在傳輸的過程中,也會產生衰減(fading)的現象,發生相位位移及訊號強度的不穩定。在這篇論文中,我們試著利用卡式濾波器(Kalman Filter)去估測衰減的影響,找出最佳近似的衰減影響,以此來找出最近似的信號。我們以高斯-馬可夫(Gaussian-Markov)訊號模型來模擬我們的傳輸環境,在論文中,試著找出編碼的效能界限以發現編碼的基本原則,以達成最佳的效能以及較高的資訊傳輸效率來建構我們的多重存取系統,並且經由電腦模擬分析與傳統的傳輸方式來做比較。


    E±cient use of transmission facilities often requires the sharing of resources. We propose a
    approach to design a multiple access system over Rayleigh fading channel. We present in
    detail the coding scheme based on convolutional codes. Good performance and high data
    rate of each user are the two chief goals of our code construction.

    Abstract i Contents i List of Figures iv 1 Introduction 1 2 Background 3 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Multiuser Codes Scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2.1 Multiuser System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Convolutional Codes for The Multiple Access Channel . . . . . . . . . . . . 7 2.4 Maximum Likelihood Soft Decision (MLSD) Decoding . . . . . . . . . . . . . 10 2.4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.4.2 Detection Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.5 Discrete-Time Optimal State Estimation . . . . . . . . . . . . . . . . . . . . 12 i 2.5.1 The Kalman Filter . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.5.2 Error-Covariance Matrix . . . . . . . . . . . . . . . . . . . . . . . . . 17 2.5.3 Fixed-Interval Smoothing . . . . . . . . . . . . . . . . . . . . . . . . 19 2.6 Iterative Decoding and Estimation . . . . . . . . . . . . . . . . . . . . . . . 19 3 Code Design Criterion 21 3.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 3.2 Upper Bounds of Pairwise Error Probability . . . . . . . . . . . . . . . . . . 23 3.3 Code Design Criteria . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 4 The Simulation Results 28 4.1 Comparison SSMA and Convolutional Coding for Multiple Access . . . . . . 28 4.1.1 Gaussian-Markov Model . . . . . . . . . . . . . . . . . . . . . . . . . 29 4.1.2 The Simulation Results over The Di®erent Rayleigh Fading Channels 30 4.2 The Simulation with Estimation by Kalman Filter . . . . . . . . . . . . . . . 31 5 Conclusion 43 A Matrix De‾nition 44 B Proof of The Theorem and The property 45 B.1 Theorem 2:1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 ii B.2 Property 3:1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 C Derivation of Performance Criteria 51 C.1 Equations (3:4) and (3:5) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51 Bibliography 53

    [1] C. E. Shannon, \Two-way communication channels," in Proc. 4th Berkeley Symp. Math.
    Stat. Prob., vol. 1, pp. 611{644, 1961.
    [2] S. C. Chang and E. J. weldon Jr., \Coding for t-user multiple-access channels," IEEE
    Trans. Inform. Theory., vol. IT-25, pp. 684{691, Nov 1979.
    [3] T. J. Ferguson, \Generalized t-user codes for multiple-access channels," IEEE Trans.
    Inform. Theory, vol. IT-28, pp. 775{778, Sept. 1982.
    [4] S. C. Chang, \Further results on coding for t-user multiple-access channels," IEEE
    Trans. Inform. Theory, vol. IT-30, pp. 411{415, Mar. 1984.
    [5] G. H. Khachatrian and S. S. Martirossian, \Code construction for the t-user noiseless
    adder channel," IEEE Trans. Inform. Theory, vol. 44, pp. 1953{1957, Sept. 1998.
    [6] B. L. Hughes and A. B. C. III, \Nearly optimal multiuser codes for the binary adder
    channel," IEEE Trans. Inform. Theory, vol. 42, pp. 387{398, Mar. 1996.
    [7] R. L. Perterson, R. E. Ziemer, and D. E. Borth, Introduction to Spread-Spectrum Com-
    munication. London: Prentice Hall International, Inc., 1995.
    [8] F. H. Ali, S. A. G. Chandler, and S. Soysa, \Complex-valued receiver for multiuser
    collaborative coding schemes," Electronics Letters, vol. 31, Mar. 1995.
    [9] F. H. Ali and S. Soysa, \Complex-valued collaborative coding multiple access for fading
    channels," IEE Proc.-Commun., vol. 148, Oct. 2001.
    [10] S. K. Wang, \Collaborative coding multiple access for wireless communication," Mas-
    ter's thesis, National Tsing Hua Univ., Hsinchu, Taiwan, July 2004.
    [11] V. P. Telang and M. A. Herro, \Error control coding for the n-user mod-2 multiple-access
    channel," IEEE Trans. Information Theory., vol. 44, pp. 1632{1641, July. 1998.
    [12] P. R. Chevukkat, \N-user trellis coding for a class of multiple-access channels," IEEE
    Trans. Information Theory, vol. rr-27, pp. 114{120, Jan. 1981.
    [13] J. L. Massey and M. K. Sain, \Inverses of linear sequential circuits," IEEE Trans.
    Computers, vol. C-17, pp. 330{337, April 1968.
    [14] S. Lin and D. J. Costello, Error Control Coding: fundamentals and applications. Pearson
    Prentice Hall, 2nd ed. ed., 2004.
    [15] R. E. Kalman and R. S. Bucy, \New results in linear ‾ltering and prediction theory,"
    Journal of Basic Eng., vol. 83, pp. 95{107, Dec 1961.
    [16] H. Runch, F. Tung, and C.Strielbel, \Maximum likelihood estimates of linear dynamic
    systems," AIAA Journal, vol. 3, p. 1445, 1965.
    [17] C. C. Cheng, Space-Time Code design for CPFSK Modulation over Frequency-
    Nonselective Fading ChannelsC. PhD thesis, National Tsing Hua Univ, Taiwan, ROC,
    June 2005.
    [18] R. A. Horn and C. R. Johnson, Matrix Analysis. New York: Cambridge University
    Press, 1990.
    [19] V. Tarokh, N. Seshadri, and A. R. Calderbank, \Space-time codes for high data rate
    wireless communication: Performance criterion and code construction," IEEE Trans.
    Inform. Theory, vol. 44, pp. 744{765, Mar. 1998.
    [20] L. Yiin and G. L. StÄuber, \Error probability of coherent detection for trellis-coded
    partial response cpm on rician fading channels," IEEE Trans. Veh. Technol, vol. 41,
    pp. 358{363, May. 1996.
    [21] J. G. Proakis, Digital Communication. New York: McGraw-Hill, 4th ed., 2001.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE