Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 電信工程學研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/33676
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor林茂昭
dc.contributor.authorCHIEN-TING LAIen
dc.contributor.author賴建汀zh_TW
dc.date.accessioned2021-06-13T05:44:29Z-
dc.date.available2006-07-18
dc.date.copyright2006-07-18
dc.date.issued2006
dc.date.submitted2006-07-14
dc.identifier.citationReference
[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. no. 2, pp.41-59, Autumn 1996.
[2]G. J. Foschini, “On limits of wireless communications in a fading environment when using multiple antennas,” Wireless Personal Commun., vol.6, no.3, pp.311-335, Mar. 1998.
[3]V. Tarokh, N. Seshadri, and A.R. Calderbank, “Space-time codes for high data rate wireless communication: Performance criterion and code construction,” IEEE Trans. Inf. Theory, vol. 44 , pp. 744-765, Mar. 1998.
[4]S. Bäro, J. Hagenauer, and M. Witzke, “Iterative detection of MIMO transmission using a list-sequential (LISS) detector,” in Proc. IEEE Int.Conf. Communications , Anchorage, AK, May 2003, pp. 2653–2657.Veh. Technol., no. 3, pp. 338–347, May 1995.
[5]S. M. Alamoui, “A simple transmit diversity scheme for wireless communications,” IEEE J. Sel. Areas Commun., vol. 16, pp. 1451-1458, Oct. 1998.
[6]G. D. Golden, J. G. Foschini, R. A. Valeneuela, and P.W. Wolniansky, “Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture,” Electron. Lett., vol. 35, pp.14-15, Jan. 1999.
[7]M. Sellathurai, and S. Haykin, “TURBO-BLAST for high-speed wireless communications,” Wireless Comm. And Network Conf. 2000, WCNC 2000, Sept. 2000, Chicago.
[8]A. van Zelst, R. van Nee and G. A. Awater, “Turbo-BLAST and its performance,” Vehicular Tech. Conf, 2001. VTC 2001 Spring. IEEE VTS 53rd vol. 2, 6-9 May 2001 pp. 1282-1286 vol.2 .
[9]S. ten Brink, “Convergence of Iterative Decoding,” Electron. Lett., vol. 35, no. 10, May 1999, pp. 806-808.
[10] S. ten Brink, “Convergence Behavior of Iterative Decoded Parallel Concatenated Codes,” IEEE Trans. on Comm., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
[11]E. Biglieri, J. Proakis, and S. Shamai, “Fading channels: In formation theoretic and communications aspects,” IEEE Trans. Inform. Theory, vol. 44, pp. 2619-2692, Oct. 1998.
[12]Branka Vucetic, Jinhong Yuan, Space-Time Coding, Wiley Editorial Office 2003.
[13]J. Hagenauer and P. Hoeher, “Iterative Decoding of Binary Block and Convolutional Codes,” IEEE Trans. Inf. Theory, vol. 42, no.2, March 1996.
[14]B. Vucetic and J. Yuan, Turbo Codes Principles and Applications, Kluwwer publishers, 2000.
[15]M. Sellathurai, and S. Haykin,, “TURBO-BLAST for Wireless Communications: Theory and Experiments,” IEEE Trans. on SP., vol. 50, no. 10, Oct 2002.
[16]S. ten Brink, J. Speidel and R.-H Yan, “Iterative Demapping and Decoding for Multilevel Modulation,” IEEE GLOBECOM 1998, vol. 1, Nov 1998, pp. 579-584.
[17]P. Robertson, E. Villebrun and P. Hoeher, “A Comparison of Optimal and Sub-optimal MAP Decoding Algorithm in the Log Domain,” Proc. ICC ’95, June 1995, pp. 1009-1013.
[18]A. van Zelst, R. van Nee and G.A. Awater, “Space Division Multiplexing (SDM) for OFDM systems,” 51st IEEE Vehicular Tech. Conf. (VTC) 2000-Spring Proc., Tokyo, May 2000, vol. 2, pp. 1070-1074.
[19]G. Hellstern, “Coded Modulation with Feedback Decoding Trellis Codes,” Proc. ICC’93(Geneva, Switzerland, May 1993), pp. 1071-1075.
[20]B. Hochwld and S. ten Brink, “Achieving near-capacity on a multiple-antenna channel,” IEEE Trans. Commun., vol. 51, pp. 389-399, Mar. 2003.
[21]O. Damen, A. Chkeif, and J.-C. Belfiore, “Lattice code decoder for space-time codes,” IEEE Commun, Lett., vol.4, no. 5, pp.161-163, May 2000.
[22]R. Bohnke, D. Wubben, V. Kuhn, K.-D. Kammeyer, “Reduced complexity MMSE detection for BLAST architectures,” in Proc. IEEE GLOBECOM '03, vol. 4, pp. 2258-2262, Dec. 2003.
[23]S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 2004. Applications, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 2004.
[24]C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes,” in Proc. Int. Conf. Communications, Geneva, Switzerland, May 1993, pp. 1064–1070.
[25]P.W. Wolniansky, G.J. Foschini, G.D. Golden and R.A.Valenzuela, “V-BLAST An Architecture for Realizing Very High Data Rates Over the Rich-Scattering Wireless Channel”, 1998 URSI International Symposium on Signals, Systems, and Electronics, ISSSE 98, Pisa, pp.295-300, 29 Sept.-2 Oct. 1998.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/33676-
dc.description.abstract隨著無線通訊頻寬需求的快速增加,因為跟單輸入單輸出(SISO)系統比較之下,多輸出多輸入(MIMO)系統能夠提供更高的傳輸容量,所以受到愈來愈多的注視。

Turbo principle 已經成功的應用在多輸入輸出系統,Turbo BLAST系統是其中之一。在Turbo BLAST系統,我們需要一個demapper負責對每個編碼後的位元計算事後機率(posteriori-probabilities)。採用暴力解法所導致的高解碼複雜度將使得這個系統變得不切實際。
LISS(LiSt-Sequential) demapper能夠以較低的解碼複雜度,以接收到的事前機率計算每個位元的事後機率。解碼複雜度的降低是因為LISS demapper在事後的機率的計算上應用了循序解碼(sequential decoding)的技巧。
我們考慮對接收到的信號做樹狀搜尋時的先後順序,並對原本的LISS 演算法做了一些修改。模擬結果顯示,修改後的LISS演算法的效能確實比原本的來得更好。
zh_TW
dc.description.abstractWith the rapid increasing demand for wireless communication bandwidth, Multiple Input Multiple Output (MIMO) systems draw much attention because it’s able to provide higher capacity than single input single output (SISO) system.
Turbo-processing principle has been successfully applied to MIMO systems, one of them is called Turbo BLAST. We need a BLAST dempapper delivering a-posteriori probabilities (APP) about the coded bits. Full-APP detection would lead to prohibitive complexity.
LISS(LiSt-Sequential ) demapper accepts a priori probability and produce posteriori-information with reduced complexity. The decoding complexity reduction of Turbo BLAST can be achieved by applying sequential decoding technique on calculation of posteriori probability of demapper.

We made modification on the LISS algorithm by considering the ordering of the tree search in the LISS. Simulation results show that the performance of LISS with proper ordering will be better than that of LISS without proper ordering.
en
dc.description.provenanceMade available in DSpace on 2021-06-13T05:44:29Z (GMT). No. of bitstreams: 1
ntu-95-R91942096-1.pdf: 598289 bytes, checksum: 03600fb272566f36168f8184f55dd675 (MD5)
Previous issue date: 2006
en
dc.description.tableofcontents1 Introduction 1
2 Fundamental 5
2.1 MIMO Channel Model………………………………5
2.2 Decoding Algorithms for BLAST…………………………7
2.2.1 Maximum Likelihood Decoding (MLD)…………………7
2.2.2 The Zero Forcing Algorithm………………………..7
2.2.3 Zero Forcing with QR Decomposition…………………8
2.2.4 The Minimum Mean Square Error (MMSE) Solution……9
2.2.5 Decision Feedback…………………………………10
2.2.6 Simulation Results……………………………………12
2.3 Turbo Decoding……………………………………………13
2.3.1 The MAP Decoding Algorithm…………………………13
2.3.2 The Iterative Decoding Algorithm…………………19
2.4 Sequential Decoding - The ZJ (Stack) Algorithm…24
3 Turbo BLAST 27
3.1 Introduction………………………………………27
3.2 System Model of Turbo BLAST………………………28
3.3 Soft-input/Soft-output Maximum Likelihood Demapper…30
3.4 Simulation Results………………………33

4 LISS Demapper for Iterative Detection…37
4.1 Introduction……………………………………37
4.2 Derivation of APP L-value with a priori information…38
4.3 Rewrite the a posterior probability as an additive metric…41
4.4 Apply stack algorithm on calculating APP L-values…42
4.5 LISS Demapper with Detection Ordering…………………47
5 Simulation Results 49
5.1 (NT, NR) = (4, 4) with QPSK modulation………………50
5.2 (NT, NR) = (6, 6) with QPSK modulation…………52
5.3 (NT, NR) = (4, 4) with 16 QAM modulation…………54
6 Conclusions 59
Reference 61
dc.language.isoen
dc.subject多重收發天線系統zh_TW
dc.subjectLISSen
dc.subjectMIMOen
dc.subjectTurbo MIMOen
dc.subjectTurbo BLASTen
dc.title一種降低渦輪多輸入輸出天線系統解碼複雜度的方法zh_TW
dc.titleA Method for Reducing the Decoding Complexity of Turbo MIMOen
dc.typeThesis
dc.date.schoolyear94-2
dc.description.degree碩士
dc.contributor.oralexamcommittee蘇賜麟,趙啟超,鐘嘉德
dc.subject.keyword多重收發天線系統,zh_TW
dc.subject.keywordMIMO,Turbo MIMO,Turbo BLAST,LISS,en
dc.relation.page63
dc.rights.note有償授權
dc.date.accepted2006-07-16
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept電信工程學研究所zh_TW
顯示於系所單位:電信工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-95-1.pdf
  未授權公開取用
584.27 kBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved