Please use this identifier to cite or link to this item:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/33676
Title: | 一種降低渦輪多輸入輸出天線系統解碼複雜度的方法 A Method for Reducing the Decoding Complexity of Turbo MIMO |
Authors: | CHIEN-TING LAI 賴建汀 |
Advisor: | 林茂昭 |
Keyword: | 多重收發天線系統, MIMO,Turbo MIMO,Turbo BLAST,LISS, |
Publication Year : | 2006 |
Degree: | 碩士 |
Abstract: | 隨著無線通訊頻寬需求的快速增加,因為跟單輸入單輸出(SISO)系統比較之下,多輸出多輸入(MIMO)系統能夠提供更高的傳輸容量,所以受到愈來愈多的注視。
Turbo principle 已經成功的應用在多輸入輸出系統,Turbo BLAST系統是其中之一。在Turbo BLAST系統,我們需要一個demapper負責對每個編碼後的位元計算事後機率(posteriori-probabilities)。採用暴力解法所導致的高解碼複雜度將使得這個系統變得不切實際。 LISS(LiSt-Sequential) demapper能夠以較低的解碼複雜度,以接收到的事前機率計算每個位元的事後機率。解碼複雜度的降低是因為LISS demapper在事後的機率的計算上應用了循序解碼(sequential decoding)的技巧。 我們考慮對接收到的信號做樹狀搜尋時的先後順序,並對原本的LISS 演算法做了一些修改。模擬結果顯示,修改後的LISS演算法的效能確實比原本的來得更好。 With 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. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/33676 |
Fulltext Rights: | 有償授權 |
Appears in Collections: | 電信工程學研究所 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
ntu-95-1.pdf Restricted Access | 584.27 kB | Adobe PDF |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.