研究生: |
施旻奇 Min-Chi Shih |
---|---|
論文名稱: |
應用於頻率非選擇性衰退通道之四相移鍵控調變的時間空間碼設計 Space-Time Code Design for QPSK Modulation over Frequency-Nonselective Fading Channels |
指導教授: |
呂忠津
Chung-Chin Lu |
口試委員: | |
學位類別: |
碩士 Master |
系所名稱: |
電機資訊學院 - 通訊工程研究所 Communications Engineering |
論文出版年: | 2007 |
畢業學年度: | 95 |
語文別: | 中文 |
論文頁數: | 53 |
中文關鍵詞: | 時間空間碼 、時間空間分集 、交錯 、四相移鍵控 |
外文關鍵詞: | Space-Time Code, space-time diversity, interleaving, QPSK |
相關次數: | 點閱:3 下載:0 |
分享至: |
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
可移動式通訊系統與高速無線網路存取一直驅使無限寬頻通訊的需求不斷增加,而通道容量是滿足此需求的關鍵。在1998年,Foschini和Gans、Teletar同時證明了多重天線系統能達到遠高於單天線系統的通道容量。
時間空間碼在近幾年已被證明為利用多重天線之強大科技,從1998年起,Alamouti、Tarokh、Stephen…等人提出各種時間空間碼的設計,並不斷加以改進。在2005年,鄭博士與呂教授發表一篇論文有關時間空間碼的設計,搭配以連續相位頻移鍵控調變,此種編碼方式能得到相當好的成效。
在這篇論文中,我們提出一個新的時間空間編碼方式,可以搭配正交振幅調變或是相移鍵控調變,此種編碼包含一個迴旋編碼器以及一個空間編碼器。在時間相關性衰退通道的情況下,我們加入一個交錯器,置於迴旋編碼器和空間編碼器之間,可以有效降低時間相關性衰退的影響,且所用的交錯器層級越多,達到的效果越好。在接收端包含一個解交錯器以及一個Viterbi解碼器,以此得到最佳錯誤率解碼。在此編碼之設計標準之下,我們可以以相當簡單的空間編碼器,以及之前陳博士與呂教授所研發的演算法得到的迴旋碼,來達成我們的目標。我們提出的編碼方式可以減輕一個時間空間碼長久以來的問題─在傳輸速率以及多重性(diversity)之間的交換(tradeoff),所需付出的代價僅是電腦運算的複雜度。另外,此種時間空間碼能得到的多重姓增益(diversity gain)為迴旋碼的有效碼長度(ECL)與傳送端、接收端天線個數三者的乘積。最後我們以電腦模擬證明此編碼方式可以得到相當好的成效。
In this thesis, we proposed a new space-time encoding scheme for
QPSK modulation over frequency-nonselective fading channels. This
scheme alleviates the tradeoff between the diversity and the rate of space-time coding
by increasing decoding complexity. We derived the space-time code design
criteria over fast fading channels.
This scheme consists of a systematic convolutional encoder over a ring and
a spatial encoder, and in addition, an interleaver to combat with correlated fading.
Simulation results have confirmed the excellent performance of our proposed scheme.
[1] G. J. Foschini and M. J. Gans, “On limits of wireless communications in a fading
environment,” Wireless Personal Commun., vol. 6, pp. 311–335, Mar. 1998.
[2] I. E. Teletar, “Capacity of multi-antenna Gaussian channels,” Europ. Trans. Telecommun.,
vol. 10, pp. 585–595, Nov./Dec. 1999.
[3] 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.
[4] V. Tarokh, A. Naguib, N. Seshadri, and A. R. Calderbank, “Space-time codes for high
data rate wireless communication: Performance criteria in the presence of channel estimation
errors, mobility, and multiple paths,” IEEE Trans. Commun., vol. 47, pp. 199–
207, Feb. 1999.
[5] S. M. Alamouti, “A simple transmit diversity technique for wireless communications,”
IEEE J. Select. Areas Commun., vol. 16, pp. 1451–1458, Oct. 1998.
[6] V. Tarokh, H. Jafarkhani, and A. R. Calderbank, “Space-time block codes from orthogonal
designs,” IEEE Trans. Inform. Theory, vol. 45, pp. 1456–1467, Jul. 1999.
[7] S. B¨aro, G. Bauch, and A. Hansmann, “Improved codes for space-time trellis coded
modulation,” IEEE Trans. Commun., vol. 4, pp. 20–22, Jan. 2000.
[8] C.-C. Cheng and C.-C. Lu, “Space-time code design for CPKSK modulation over
frequency-nonselective fading channels,” IEEE Trans. Commun., vol. 53, pp. 1477–
1489, Sep. 2005.
[9] S. H. Jamali and T. Le-Ngoc, Coded-Modulation Technique for Fading Channels. Boston,
MA: Kluwer, 1994.
[10] C.-C. Lu and C.-Y. Kuo, “Optimal trellis design and labeling of trellis coded MPSK for
Rayleigh fading channels,” to be submitted for publication.
[11] C.-L. Hsiao and C.-C. Lu, “On the design of optimal (2,1) Z2-convolutional coded
CPFSK over Rayleigh fading channels,” in Proc. ISIT 1998, Cambridge, MA, USA,
Aug. 1998.
[12] W.-H. Gu and C.-C. Lu, “Rate l/(l+1) convolutional encoders over rings with maximal
free branch distance,” in Proc. ISIT 2001, Washington, DC, USA, Jun. 2001.
[13] C.-C. Lu and J.-P. Chen, “An optimal test of Zq-convolutional coded CPFSK for communications
over Rayleigh fading channels,” to be submitted for publication.
[14] M. Cedervall and R. Johannesson, “A fast algorithm for computing distance spectrum of
convolutional codes,” IEEE Trans. Inform. Theory, vol. 35, pp. 1146–1159, Nov. 1989.