多輸入多輸出系統籬柵編碼空間調變

Trellis Coded Spatial Modulation for MIMO System

郭書瑞(Shu-Ruei Guo)

指導教授 ： 馬尚智

國立臺北科技大學/電資學院/電機工程系所/碩士(2013年)

https://doi.org/10.6841/NTUT.2013.00036

摘要

正交時空區段碼對於複雜的線性解碼無線通訊系統可以改善錯誤率的表現。近年來提出另一種多重傳輸技術—空間調變，除了傳統的訊號星座圖，多重傳輸天線亦可以傳送資料位元用來增加頻譜效率。本文提出了一個新的設計方式結合迴旋碼與依據編碼增益距離為準則所分割得到的傳送矩陣，模擬結果顯示這個新的方法可以達到良好的錯誤率表現並且有較低的複雜度。

關鍵字

時空區段碼 ； 籬柵編碼調變 ； 陪集碼 ； 空間調變

並列摘要

Orthogonal space-time block codes can provide improved error performance for wireless systems with linear decoding complexity. Recently, an alternative multiple transmission technique known as spatial modulation has been proposed. In addition to the conventional signal constellations, multiple transmission antennas can also convey information bits so that the resulting spectral efficiency can be increased. In this thesis, we propose a new design of trellis-coded spatial modulation by combining the convolutional code and set partitioning of the transmission matrix set according to the coding gain distance criterion. Simulation results show that the new scheme can achieve good error performance with small trellis complexity.

並列關鍵字

Space-Time Block Codes ； Trellis Coded Modulation ； Coset Code ； Spatial Modulation

參考文獻

[1] S. Alamouti, “A simple transmitter diversity technique for wireless communications”, IEEE J. Select. Areas Commum., vol. 16, pp. 1451–1458, Oct. 1998.

[2] 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, no.2, pp. 744–765, Mar. 1998.

[3] R. Mesleh, Marco Di Renzo, Harald Haas, and Peter M. Grant, “Trellis coded spatial modulation”, IEEE Trans. Commun., vol. 9, pp. 2349–2361, Jul. 2010.

[4] E. Başar, U. Aygölü, E. Panayirci, and H. Vincent Poor, “Space-time block coded spatial modulation”, IEEE Trans. Commun., vol. 59 pp. 823–832, Mar. 2011.

[5] E. Başar, U. Aygölü, E. Panayırcı, and H. Vincent Poor, “New trellis code design for spatial modulation”, IEEE Trans. Commun., vol. 10, pp. 2670–2680, Aug. 2011.