Full metadata record
DC FieldValueLanguage
dc.contributor.author劉丞瑋en_US
dc.contributor.author沈文和en_US
dc.date.accessioned2014-12-12T01:14:52Z-
dc.date.available2014-12-12T01:14:52Z-
dc.date.issued2008en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT009513525en_US
dc.identifier.urihttp://hdl.handle.net/11536/38368-
dc.description.abstract為了增加現有系統的覆蓋範圍及link level之通道容量以達到更高的系統需求,中繼站系統是一個在新一代通訊系統下可能被採用的架構。而MIMO Precoding這門技術目前也被廣泛的應用在中繼站系統來進一步改善系統效能。然而,目前的研究大多著眼於兩躍式中繼站系統之中繼站端precoder設計。在本論文中作者將透過基因演算法來研究由來源端precoder及中繼站端precoder所構成之precoder pair。對一個可應用多種兩段式傳送規約之三點式非再生性MIMO中繼站系統而言,數值分析結果顯示,相對於沒有precoder pair的中繼站系統,precoder pair可在相同的總傳送功率限制之下提升ergodic/outage capacity。zh_TW
dc.description.abstractRelay system is a possible candidate to be adopted in the next generation communication systems. It aims to enhance the coverage and link level capacity of current systems. Also, the technique of MIMO precoding has been widely applied onto relay systems to further improve system performance. However, most previous researches focus on designing the relay precoder matrix for two-hop MIMO relay systems. In this thesis, precoder pair, which consists of relay precoder matrix and an additional source precoder matrix, has been studied based on the classical Generic algorithm. For MIMO relay systems with various two-phase transmission protocols, numerical results show that ergodic/outage capacity improvement with respect to traditional techniques can be achieved with guaranteed individual transmit power constraint for source and relay terminals.en_US
dc.language.isoen_USen_US
dc.subject預編碼器zh_TW
dc.subject多輸入多輸出zh_TW
dc.subject中繼站zh_TW
dc.subject基因演算法zh_TW
dc.subjectPrecoderen_US
dc.subjectMIMOen_US
dc.subjectRelayen_US
dc.subjectGeneric algorithmen_US
dc.title以基因演算法研究三點式非再生性MIMO中繼站系統之最佳Precoder Pairzh_TW
dc.titleGeneric Algorithm Based Optimal Precoder Pair for Three-terminal Non-regenerative MIMO Relay Systemen_US
dc.typeThesisen_US
dc.contributor.department電信工程研究所zh_TW
Appears in Collections:Thesis


Files in This Item:

  1. 352501.pdf

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.