(3.234.221.67) 您好!臺灣時間:2021/04/11 16:17
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:林德純
研究生(外文):Tei-Chen Lin
論文名稱:時空碼的盲蔽適應性檢測
論文名稱(外文):Blind Adaptive Detection in Space-Time Code
指導教授:吳建興吳建興引用關係
指導教授(外文):Chien-Hsing Wu
學位類別:碩士
校院名稱:國立中正大學
系所名稱:電機工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2004
畢業學年度:92
語文別:中文
論文頁數:56
中文關鍵詞:space-time codeCDMAsubspace tracking
相關次數:
  • 被引用被引用:0
  • 點閱點閱:132
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
本論文提出了一種對於時空碼做信號子空間估計的盲蔽式適應性多用戶檢測 (blind adaptive multiuser detection) 的演算法。它是基於矩陣天線(antenna array) 的CDMA系統。在信號子空間估計的方式中,我們使用了PASTd以及新的正交投影子空間追蹤法NOOja的適應性子空間估計,同時我們也對這兩種不同的子空間追蹤法做比較。
In this paper, a space-time blind adaptive multiuser detection algorithm based on signal subspace estimation is proposed. It is based on an antenna array CDMA (code-division multiple-access). In the signal subspace estimation, we used PASTd and a new orthogonal projection approximation subspace estimation NOOja. We also compare the performance between space-time code PASTd (STC-PASTd) and space time code NOOja (STC-NOOja).
誌謝 I
中文摘要 II
英文摘要 III
目錄 IV
圖表索引 VI
第一章 導論 1
1.1 前言 1
1.2 研究動機 2
1.3 論文架構 2
第二章 導論 1
2.1 通道模型 4
2.2 Space-Time Code的performance criteria 6
2.2.1 Case of Independent Coefficients 6
2.2.2 Case of Dependent Fade Coefficients 10
2.2.3 Case of Rapid Fading 12
2.3 時空編碼的種類 15
2.3.1時空方塊碼 15
2.3.1.1 Alamouti時空碼 15
2.3.1.2 一般的時空碼 20
2.3.2 時空籬笆碼 25
第三章 子空間追蹤的方法 29
3.1 通道模型 29
3.2 子空間的概念 30
3.3 非相關檢測器 31
3.4 最小均方錯誤檢測器 35
3.5訊號子空間的追蹤 37
3.5.1 PASTd 37
3.5.2 PAST 40
3.5.3 OPAST 42
3.5.4 NOOja 45
第四章 時空編碼的子空間追蹤法 49
4.1 系統模型 49
4.2 模擬與比較 53
第五章 結論 56
參考文獻 57
[1] V. Tarokh, N. Seshadri, and A. Calderbank, “Space-Time codes for high data rate wireless communication: Performance criterion and construction,” IEEE Trans. Inform. Theory, vol. 44, pp. 744-765, Mar. 1998.
[2] V. Tarokh, H. Jafarkhani, and A. Calderbank, “Space-Time block coding for wireless communication: Performance results,” IEEE Journal on Select Areas in Communications, vol. 17, pp. 451-460, 1999.
[3] V. Tarokh, A. Naguib, N. Seshadri, and A. 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. on Communications, vol. 47, pp. 199-207, 1999.
[4] S.M. Alamouti, “A simple transmit diversity technique for wireless communications”, IEEE Journal Select. Areas Commun., vol. 16, no. 8, pp. 1451-1458, Oct. 1998.
[5] V. Tarokh, H. Jafarkhani, and A. Calderbank, “Space-Time block codes from orthogonal designs,” IEEE Trans. Inform. Theory, vol. 45, pp. 1456-1467, July 1999.
[6] A. R. Hammons Jr., and H. El Gamal, “On the theory of space-time codes for PSK modulation,” IEEE Trans. Inform. Theory, vol. 46, no. 2, pp. 524-542, Mar. 2000.
[7] H. El Gamal, and A. R. Hammons Jr., “On the design of algebraic space-time codes for block BPSK and QPSK modulation,” IEEE Trans. on Communication, vol. 50, pp. 907-913, June 2002.
[8] S. Sandhu and A. J. Paulraj, “Space-time block codes versus space-time trellis codes,” in IEEE ICC, 2001
[9] H. Jafarkhani, and N. Seshadri, “Super-orthogonal space-time trellis codes,” IEEE Trans. Inform. Theory, vol. 49, no. 4, pp. 937-950, Mar. 1998.
[10] G. Leus, and M. Moonen, “Per-tone equalization for MIMO OFDM systems,” IEEE Trans. on Signal Processing, vol. 51, no. 11, pp. 2965-2975, Nov. 2003.
[11] H. Bolcskei, “Blind estimation of symbol timing and carrier frequency offset in wireless OFDM systems,” IEEE Trans. on Communications, vol. 49, no. 6, June 2001
[12] H. Bolcskei, D. Gesbert, and A. J. Paulraj, “On the capacity of OFDM-based spatial multiplexing systems.” IEEE Trans. on Communications, vol. 50, no. 2, Feb. 2002
[13] B. Muquet, M. de Courville, P. Duhamel, “Subspace Blind and semi-blind channel estimation for OFDM systems,” IEEE Trans. on Signal Processing, vol. 50, no. 7, pp. 1699-1712, July 2002.
[14] B. Yang, “Projection approximation subspace tracking,” IEEE Trans. on Signal Processing, vol. 44, pp. 95-107, Jan. 1995.
[15] B. Yang, “Convergence analysis of the subspace tracking algorithms PAST and PASTd,” in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, ICASSP-96, vol. 3 , pp: 1759 -1762, May 1996.
[16] K. Abed-Meraim, A. Chkeif, and Y. Hua, “Fast orthonormal PAST Algorithm,” IEEE Signal Processing Letters, vol. 7, no. 3, pp. 60-62, Mar. 2000.
[17] S. Attallah, and K. Abed-Meraim, “Fast algorithms for subspace tracking,” IEEE Signal Processing Letters, vol. 8, no. 7, July 2001.
[18] M. Honig, U. Madhow, and S. Verdu, “Blind multiuser detection,” IEEE Trans. Inform. Theory, vol. 41, pp. 944-960, July 1995.
[19] R. Lupas and S. Verdu, “Linear multi-user detectors for synchronous code-division multiple-access channels,” IEEE Trans. Inform. Theory, vol. 35, pp. 123-136, Jan. 1989.
[20] X. Wang, and H. Vincent Poor, “Blind multiuser detection: A subspace approach,” IEEE Trans. Inform. Theory, vol. 44, no. 2, pp. 677-690, Mar. 1998.
[21] K. Abed-Meraim, S. Attallah, A. Chkeif, and Y. Hua, “Orthogonal Oja Algorithm,” IEEE Signal Processing Letters, vol. 7, pp. 116-119, May 2000.
[22] Y. Hau, T. Chen, and Y. Miao, ”A unifying view of a class of subspace tracking methods,” in ISSPR’98, vol. 2, Hong Kong, Sep. 1998, pp. 27-32.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔