跳到主要內容

簡易檢索 / 詳目顯示

研究生: 陳威廷
Wei-Ting Chen
論文名稱: 電腦搜尋之超級正交空時籬柵碼
Computer Search of Super-Orthogonal Space-Time Trellis Codes
指導教授: 魏瑞益
Ruey-yi Wei
口試委員:
學位類別: 碩士
Master
系所名稱: 資訊電機學院 - 通訊工程學系
Department of Communication Engineering
畢業學年度: 97
語文別: 中文
論文頁數: 51
中文關鍵詞: 超級正交空時籬柵碼空時籬柵碼生成矩陣
外文關鍵詞: Super-orthogonal space-time trellis codes, space-time trellis codes, generator matrix
相關次數: 點閱:11下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 超級正交空時籬柵碼(super-orthogonal space-time trellis codes, SOSTTCs)[10]是一個需要經由人為事先設計好籬柵碼的架構,可確實提升空時籬柵碼(space-time trellis codes,STTCs)的效能。在2007年,一種藉由生成矩陣(generator matrix)來表示超級正交空時籬柵碼的方法被提出,其允許有系統的搜尋所有可能的碼。在這個架構中,星座圖的轉置角度在電腦搜尋前就已經被決定。然而,此將無法肯定轉置角度是理想的。在這篇論文中,我們提出三種不同的生成矩陣去表示超級正交空時籬柵碼,在這些提出的架構,星座圖的轉置角度將利用電腦搜尋去決定。經由我們的架構所找到的碼將可勝過以往已知的碼


    Super-orthogonal space-time trellis codes (SOSTTCs) designed by hand can improve the performance of space-time trellis codes. In 2007, a representation of SOSTTCs based on a generator matrix was proposed which allows systematic searches of possible codes. In this scheme, the rotation of the constellation is determined before computer searches. However, the optimality of the rotation cannot be guaranteed. In this thesis, we propose three different representations of SOSTTCs which are also based on a generator matrix. In the proposed schemes, the rotation of the constellation is determined by computer searches. New codes of our schemes that outperform previously known codes are found.

    第一章 緒論 1 第二章 空時碼之回顧 3 2.1 空時區塊碼 3 2.2 空時籬柵碼之回顧 6 2.2.1 空時籬柵碼 6 2.2.2 籬柵編碼調變串接空時區塊碼 9 2.2.3 超級正交空時籬柵碼 10 2.3 電腦設計之超級正交空時籬柵碼 13 第三章 基於空時區塊之碼搜尋 17 3.1 編碼 17 3.2 碼搜尋 24 3.3 模擬與討論 29 第四章 基於符元及轉置角度之碼搜尋 35 4.1 前言 35 4.2 第一種碼搜尋架構 36 4.2.1 生成矩陣表示法 36 4.2.2 模擬與討論 38 4.3 第二種碼搜尋架構 41 4.3.1 生成矩陣表示法 41 4.3.2 模擬與討論 43 4.4 綜合比較與分析 47 第五章 結論 49 參考文獻 50

    【1】 V. Tarokh, N. Seshadri, and A. R. Calderbank, “Space-time codes for
    high data rate wireless communication: Performance analysis and code
    construction,” IEEE Trans. Inf. Theory, vol. 44, pp. 744-765, Mar. 1998.
    【2】 G. Ungerboeck, “Channel coding for multilevel/phase signals,” IEEE
    Trans. Inf. Theory, vol. 28, pp. 55-67, Jan. 1982.
    【4】 S. M. Alamouti, “A simple transmitter diversity scheme for wireless
    communications,” IEEE Journal Select. Areas Commun., vol. 16, pp.
    1451-1458, Oct. 1999.
    【4】 V. Tarokh, H. Jafarkhani and A. R. Calderbank, “Space-time block codes
    from orthogonal designs,” IEEE Trans. Inform. Theory, vol. 45, pp.
    1456-1467, July 1999.
    【5】 Z. Chen, B. Vucetic, J. Yuan and K. Lo, “Space-time trellis coded
    modulation with three and four transmit antennas on slow fading
    channels,” IEEE Commun. Letters, vol. 6, no. 2, pp. 67-69, Feb. 2002.
    【6】 Y. Gong and K. B. Letaief, “Concatenated space-time block coding with
    trellis-coded modulation in fading channels,” IEEE Trans. Wireless
    Commun., vol. 1, pp. 580-590, Oct. 2002.
    【7】 G. Ungerboeck, “Channel coding with multilevel/phase signals,” IEEE
    Trans. Inform. Theory, vol. IT-28, pp. 55-66, Jan. 1982.
    【8】 S. M. Alamouti, V. Tarokh and P. Poon, “Trellis coded modulation and
    transmit diversity: Design criterion and performance evaluation,” in Proc.IEEE ICUPC’98, Oct. 1998, pp. 703-707.
    【9】 H. Jafarkhani and N. Seshadri, “Super-orthogonal space-time trellis
    codes,” IEEE Trans. Inform. Theory, vol. 49, no. 4, Apr. 2003.
    【10】 Michael Bale, Brady Laska, Dustin Dunwell, Francois Chan, and Hamid Jafarkhani, “Computer Design of Super-Orthogonal Space-Time Trellis Codes,” IEEE Trans. Wirel. Commum.,vol. 6, pp. 463-467, Feb. 2007.
    【11】 S. Siwamogsatham and M. P. Fitz, “Improved high-rate space-time
    codes via orthogonality and set partitioning,” in Proc. IEEE Wireless
    Communications and Networking Conf. (WCNC) 2002.
    【12】 S. Siwamogsatham and M. P. Fitz, “Improved high-rate space-time codes via concatenation of expanded orthogonal block code and M-TCM,” in Proc. IEEE Int. Conf. Commun. (ICC) 2002, vol. 1, pp. 636-640.
    【13】 D. M. Ionescu, “On space-time code design,” IEEE Trans. Wireless
    Commun., vol. 2, pp. 20-28, Jan. 2003.

    QR CODE
    :::