| 研究生: |
潘志聰 Chih-tsung Pan |
|---|---|
| 論文名稱: |
低複雜度非同調重複空時解調器 Low-Complexity Noncoherent Iterative Space-Time Demodulators |
| 指導教授: |
魏瑞益
Ruey-yi Wei |
| 口試委員: | |
| 學位類別: |
碩士 Master |
| 系所名稱: |
資訊電機學院 - 通訊工程學系 Department of Communication Engineering |
| 畢業學年度: | 95 |
| 語文別: | 中文 |
| 論文頁數: | 79 |
| 中文關鍵詞: | 重複解碼 、串接碼 、重複解調 、渦輪碼 、空時碼 |
| 外文關鍵詞: | iterative demodulation, concatenated code, turbo code, space-time code, iterative decoding |
| 相關次數: | 點閱:19 下載:0 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
渦輪編碼么正空時調變可以提供相較於未編碼的么正空時調變(USTM)更多的編碼增益,當串接低密度查核位元碼時嚮導符元協助調變也被證明相較於么正空時調變有更好的錯誤效能。由於最大後置非同調機率解碼器在較長區塊長度下複雜度太高,因此具低複雜度的非同調通道量化重複解調器與重複決策回授解調器被提出,在此篇論文中,我們主要討論使用在渦輪編碼系統之非同調重複空時解調器。我們一般化非同調通道量化重複解調器與重複決策回授解調器兩種非同調解調器,並比較使用不同的非同調重複解調器在渦輪編碼嚮導符元協助調變上之錯誤效能。
Turbo coded unitary space-time modulation (USTM) can provide large coding gain as compare to uncoded USTM. Concatenated with a low-density parity-check code, pilot symbol-assisted modulation (PSAM) was shown to have better error performance than USTM. Because the noncoherent space-time maximum a posteriori demodulator is very complicated especially for long block length, the noncoherernt iterative channel-quantization demodulator and iterative decision-feedback demodulator with lower complexity were proposed. In this thesis, we focus on noncoherent iterative space-time demodulators for turbo coding systems. We generalize Noncoherent iterative channel-quantization demodulator and iterative decision-feedback demodulator. We also investigate the error performance of various noncoherent iterative demodulators for turbo coded PSAM.
[1] I. Bahceci and T. M. Duman, “Combined turbo coding and unitary space-time modulation,” IEEE Trans. Commun., vol. 50, pp. 1244-1249, Aug. 2002.
[2] A. Krishnamoorthy and A. Anastasopoulos, “Code and receiver design for the noncoherent fast-fading channel,” IEEE J. Select. Areas Commun.,vol. 23, pp. 1769-1778, Sept. 2005
[3] Y.Hsu, “Noncoherent Space-Time Turbo Code,” M.S. thesis, National Central University, R.O.C. 2006.
[4] C. Berrou and A. Glavieux, “Near optimum error correcting coding and decoding: turbo-codes,” IEEE Trans. Commun., vol. 44, pp. 1261-1271,
Oct. 1996.
[5] B. M. Hochwald and T. L. Marzetta, “Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading,” IEEE Trans. Inform. Theory, vol. 46, pp. 543-564, Mar. 2000.
[6] B. M. Hochwald, T. L. Marzetta, T. J. Richardson, W. Sweldens, and
R. Urbanke, “Systematic design of unitary space-time constellations,”
IEEE Trans. Inform. Theory, vol. 46, pp. 1962-1973, Sept. 2000.
[7] M. L. McCloud, M. Brehler, and M. K. Varanasi, “Signal design and
convolutional coding for noncoherent space-time communication on the
block-Rayleigh-fading channel,” IEEE Trans. Inform. Theory, vol. 48,
pp. 1186-1194, May 2002.
[8] P. Dayal, M. Brehler, and M. K. Varanasi, “Leveraging coherent space-time codes for noncoherent communication via training,” IEEE Trans.Inform. Theory, vol. 50, pp. 2058-2080, Sept. 2004.
[9] B. Hassibi and B. M. Hochwald, “How much training is needed in multiple-antenna wireless links?” IEEE. Trans. Inform. Theory, vol. 49, pp. 951V963, Apr. 2003.
[10] S. M. Alamouti, “A simple transmitter diversity scheme for wireless communications,” IEEE J. Select. Areas Commun., vol. 16, pp. 1451-1458, Oct. 1998.
[11] A. Stefanov and T. M. Duman, “Turbo-coded modulation for systems with transmit and receive antenna diversity over block fading channels:System model, decoding approaches, and practical considerations,” IEEE J. Select. Areas Commum., vol. 19. pp. 958-968, May 2001.
[12] R. R. Chen, R. Koetter, U. Madhow, and D. Agrawal, “Joint noncoherent demodulation and decoding for the block fading channel: a practical framework for approaching Shannon capacity,” IEEE Trans. Commun., vol. 51, pp. 1676-1689, Oct. 2003.
[13] D. Warrier and U. Madhow, “Spectrally efficient noncoherent communication,” IEEE Trans. Inform. Theory, vol. 48, pp. 651-668, Mar. 2002.
[14] S. Benedetto and G. Montorsi, “Unveiling turbo-codes: Some results on parallel concatenated coding schemes,” IEEE Trans. Inform. Theory, vol. 42, no. 2, Mar. 1996, pp. 409-428.