簡易檢索 / 詳目顯示

研究生: 林俊宇
Jun-Yu Lin
論文名稱: 具有快速收歛之多輸入多輸出位元交錯編碼調變系統
A fast-convergence MIMO-BICM scheme
指導教授: 翁詠祿
Yeong-Luh Ueng
口試委員:
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 電機工程學系
Department of Electrical Engineering
論文出版年: 2008
畢業學年度: 96
語文別: 英文
論文頁數: 81
中文關鍵詞: 多輸入多輸出位元交錯編碼軟性干擾去除之最小平方檢測期望值最大演算法
外文關鍵詞: MIMO-BICM, MMSE-SC, EM algorithm
相關次數: 點閱:2下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 近年來,一個被使用在無線通訊上的多輸入多輸出位元交錯編碼
    調變系統 ( MIMO-BICM ) 被蓬勃地發展來對抗多輸入多輸出衰落通
    道所造成的效能損失。在這篇論文中,我們藉由設計一個特殊的交錯
    復用器 ( interleaver ) 用於多輸入多輸出位元交錯編碼調變系統
    並且搭配一個迭代解碼的解碼-檢測-通道估測演算法來達到具有快
    速收歛之多輸入多輸出位元交錯編碼調變系統。此外通道估測在實際
    應用中是一個很重要的議題。在所提出的多輸入多輸出位元交錯編碼
    調變系統上,通道估測器是一個迭代估測的通道估測器,採用期望值
    最大化演算法 ( EM algorithm ) 來搭配多輸入多輸出位元交錯編碼
    調變系統。因為所提出之交錯復用器具有特殊的架構,我們運用所提
    出的解碼-檢測-通道估測演算法,一個軟性輸出的通道解碼器
    ( SISO MAP channel decoder ) 會立即回饋通道編碼的軟訊息給軟
    性干擾去除之最小平方檢測器 ( MMSE-SC detector ) 以及通道估測
    器在一個已被接收的通道解碼滑動視窗時間長度。然後在同一個迭代
    解碼以內,被回饋的通道編碼軟訊息可以立即被軟性干擾去除之最小
    平方檢測器和通道估測器所有效使用來增進整體迭代解碼之效能。
    使用在無線通訊上的多輸入多輸出位元交錯編碼調變系統被蓬勃地發展來對抗多輸入多輸出衰落通道所造成的效能損失。因此被提出的多輸入多輸出位元交錯編碼調變系統在錯誤率效能比傳統的多輸入多輸出位元交錯編碼調變系統擁有更快的收斂速度。


    MIMO-BICM(Multi-input multi-output bit interleaved coded modulation) systems have been investigated prosperously in wireless communications. In this thesis, we propose a fast-convergence MIMO-BICM scheme with the EM (expectation-maximization) based channel estimation by designing
    the bit interleaver and the iterative decoding-detection-estimation algorithm. Since the specific structure of the proposed interleaver, the softoutput of the decoder can be fed back to the MMSE-SC (minimum mean square error with soft cancelation) detector and the estimator after a window
    length and then the detector and the channel estimator can immediately use these soft values within the same iteration. Hence, the proposed MIMOBICM scheme can achieve a faster speed of convergence as compared to the
    conventional MIMO-BICM scheme.

    Abstract 1 Introduction 1 2 Reviews of MIMO Communications 4 2.1 MIMO Channels . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 MIMO Techniques: BLAST system . . . . . . . . . . . . . . . 7 2.3 MIMO Detection with MMSE Criterion for Basic BLAST . . . 10 2.3.1 MIMO Detection with MMSE Criterion . . . . . . . . 10 2.3.2 Nulling and Canceling . . . . . . . . . . . . . . . . . . 13 2.4 Channel Coding . . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.4.1 Convolutional Code . . . . . . . . . . . . . . . . . . . . 15 2.4.2 Maximum A Posteriori Probability Decoder . . . . . . 17 2.5 Reviews of MIMO-BICM . . . . . . . . . . . . . . . . . . . . . 20 2.5.1 System Description of MIMO-BICM . . . . . . . . . . 20 2.5.2 An Iterative Receiver with MMSE-SC Detection . . . . 22 2.6 Channel Estimation via EM Algorithm . . . . . . . . . . . . . 25 3 A Fast-Convergence MIMO-BICM Scheme 27 3.1 System Description of The Proposed System . . . . . . . . . . 27 3.2 Decoding-Detection Algorithm with perfect CSI . . . . . . . . 31 3.3 Channel Estimation for Proposed Scheme . . . . . . . . . . . . 37 3.3.1 Channel Estimation based on EM algorithm . . . . . . 37 3.3.2 Recursive Channel Estimation . . . . . . . . . . . . . . 40 3.4 Performance Evaluation . . . . . . . . . . . . . . . . . . . . . 42 3.4.1 Simulation Results . . . . . . . . . . . . . . . . . . . . 42 3.4.2 Design criterion for proposed MIMO-BICM . . . . . . 71 3.4.3 Complexity Analysis . . . . . . . . . . . . . . . . . . . 74 4 Conclusion 78 Bibliography 79

    [1] G. J. Foschini, “Layered space-time architecture for wireless communications
    in a fading environment when using multi-element antennas,” Bell
    Labs Tech. J., vol. 1 no. 2, pp.41-59, Autumn 1996.
    [2] Foschini, G.J. Golden, G.D. Valenzuela, R.A. Wolniansky, P.W. “Simplified
    processing for high spectral efficiency wireless communication employing
    multi-element arrays,” Selected Areas in Communications, IEEE
    Journal, vol. 17, Issue 11, Nov. 1999 pp.1841 - 1852
    [3] L. Bahl, J. Cocke, F. Jeinek, and J. Raviv, “Optimal decoding of linear
    codes for minimizing symbol rate,” IEEE Trans. Inform. Theory, vol. 20,
    pp. 284–287, Mar. 1974.
    [4] P. Robertson, E. Villebrun, and P. Hoeher, “A comparison of optimal
    and suboptimal MAP decoding algorithms operating in the log domain,”
    in Proc. ICC ’95, pp. 1009–1013.
    [5] 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.
    [6] V. Tarokh, H. Jafarkhani and A.R. Calderbank, “Space-time block codes
    from orthogonal designs,” IEEE Trans. Inform. Theory., vol. 45, no. 5,
    pp. 1456-1467, July 1999.
    [7] V. Tarokh, N. Seshadri and A.R. Calderbank, “Space-time codes for high
    data rate wireless communication: performancecriterion and code construction,”
    IEEE Trans. Inform. Theory., vol. 44, no. 2, pp. 744-765,
    Mar 1998.
    [8] G. Caire, G. Taricco, and E. Biglieri, “Bit-interleaved coded modulation,
    ” IEEE Trans. on Inform. Theory, vol. 44, pp. 927–946, May 1998.
    [9] J. Choi, “MIMO-BICM iterative receiver with the EM based channel estimation
    and simplified MMSE combining with soft cancellation ,” IEEE
    Trans. Signal Process., vol. 54, no. 8, pp. 3247-3251, August 2006.
    [10] A. Stefanov and T. M. Duman, “Turbo coded modulation for systems
    with transmit and receive antenna diversity over block fading channels:
    system models, decoding approaches, and practical considerations,” IEEE
    J. Select. Areas Commun., vol. 19, pp. 958-968, May 2001.
    [11] S. ten Brink, and B. M. Hochwald , “Detection thresholds of iterative
    MIMO processing, ” in Proc. IEEE Int. Symp. Inf. Theory, Lausanne,
    Switzerland, June 2002, p.22.
    [12] S. ten Brink, G. Kramer, and A. Ashikhmin, “Design of low-density
    parity-check codes for modulation and detection,” IEEE Trans. on Com-
    mun., vol. 52, No. 4, pp. 670–678, April 2004.
    [13] J. Hou, P. H. Siegel, and L. B. Milstein, “Design of multi-input multioutput
    systems based on low-density parity-check codes, ” IEEE Trans.
    on Commun., vol. 53, No. 4, pp. 601–611, April 2005.
    [14] G. Yue and X. Wang, “Optimization of irregular repeat-accumulate
    codes for MIMO systems with iterative receivers, ” IEEE Trans. on Wire-
    less Commun., vol. 4, No. 6, pp. 2843–2855, Nov. 2005.
    [15] X. Li and A. Ritcey, “Bit-Interleaved coded modulation with iterative
    decoding,” IEEE Commun. Letters, vol. 1, no. 6, pp. 77–79, Nov. 1997.
    [16] Wang, X. and Poor, H. V, “Iterative (turbo) soft interference
    cancellation and decoding for coded CDMA,” IEEE Trans. Com-
    mun.,47,pp. 1046-1061, 1999.
    [17] Elias, P. “Error-free Coding ,” IEEE Transactions on Information The-
    ory, vol 4, Issue 4, Sep 1954, pp. 29 - 37
    [18] Tonello, A.M. “MIMO MAP equalization and turbo decoding in interleaved
    space-time coded systems ,” IEEE Transactions on Communica-
    tions, vol 51, Issue 2, Feb. 2003 pp. 155 - 160
    [19] A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood
    from incomplete data via the EM algorithm,” Ann. Roy. Statis. Soc.,
    vol. 39, pp. 1-38, Dec. 1977.
    [20] J. L. Ramsey, “Realization of optimum interleavers,” IEEE Trans. on
    Inf. Theory vol. IT16, pp. 338-345, 1970.
    [21] Tonello, A.M., “Space-time bit-interleaved coded modulation with an
    iterative decoding strategy” IEEE VTS-Fall VTC 2000. 52nd Volume 1
    pp. 473-478 vol.1 Sept. 2000.

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

    QR CODE