Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 葉宛真 | en_US |
dc.contributor.author | Yeh, Wan-Chen | en_US |
dc.contributor.author | 蔡尚澕 | en_US |
dc.contributor.author | Tsai, Shang-Ho | en_US |
dc.date.accessioned | 2015-11-26T01:07:58Z | - |
dc.date.available | 2015-11-26T01:07:58Z | - |
dc.date.issued | 2010 | en_US |
dc.identifier.uri | http://140.113.39.130/cdrfb3/record/nctu/#GT079712508 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/44398 | - |
dc.description.abstract | 這篇論文中,我們提出了在多天線系統中,多模式天線選擇並使用迫零接收器的情況,降低運算複雜度的演算法。選擇天線的準則有兩種:使得可達到的傳輸速率最大或平均的錯誤機率最小。此外,在求得使傳輸速率最大的天線組合之後,使用位元的分配可以提升效能以及符合實際上的需求。在運算複雜度的部分,我們簡化搜尋天線的演算法以及簡化反矩陣的計算,可以使得整個系統的運算複雜度大大的降低。最後從運算複雜度的分析以及效能的模擬圖表當中,可以看出我們提出的演算法的優勢。 | zh_TW |
dc.description.abstract | In this thesis, we proposed reduced-complexity algorithms to select appropriate transmit antennas for MIMO system with zero-forcing receiver. Two criteria for selecting antennas are derived: achievable data rate maximization and average symbol error rate minimization. In addition, bit allocation is also applied to improve the performance. The computational complexity can be reduced by simplifying search strategy and matrix inversion. The computational complexity analysis and simulation results are given to see that the advantages of the proposed algorithm. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | 多輸入多輸出系統 | zh_TW |
dc.subject | 多模式天線選擇 | zh_TW |
dc.subject | 位元分配 | zh_TW |
dc.subject | 複雜度降低 | zh_TW |
dc.subject | 貪婪演算法 | zh_TW |
dc.subject | MIMO system | en_US |
dc.subject | multimode antenna selection | en_US |
dc.subject | bit allocation | en_US |
dc.subject | complexity reduction | en_US |
dc.subject | greedy algorithm | en_US |
dc.title | 多模式天線選擇–在迫零接收器簡化運算複雜度的方法 | zh_TW |
dc.title | Multimode Antenna Selection with Reduced Complexity for Zero-forcing Receiver | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | 電控工程研究所 | zh_TW |
Appears in Collections: | Thesis |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.