蜂巢式多使用者之正交分頻多工之資源配置調適性演算法; Adaptive resource allocation over multi-cell OFDMA networks

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Communication Engineering > Electronic Thesis & Dissertation > Item 987654321/8152

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/8152

Title:	蜂巢式多使用者之正交分頻多工之資源配置調適性演算法;Adaptive resource allocation over multi-cell OFDMA networks
Authors:	呂明彥;Ming-Yen Lu
Contributors:	通訊工程研究所
Keywords:	正交分頻多工;資源配置;OFDMA;resource allocation
Date:	2006-07-10
Issue Date:	2009-09-22 11:19:32 (UTC+8)
Publisher:	國立中央大學圖書館
Abstract:	在這篇論文中將討論多細胞多使用者之正交分頻多工系統的資源配製方法，在的固定的傳輸頻寬下，將找出有效的子載波配置方式以及各使用者在其所分配到的載波之功率配置，使整體的傳輸率能達到最大。在此我們將考慮到各載波在不同細胞間相互性的干擾以及各個使用者自身的傳輸率的限制。由於在上行傳輸中理想的配置方法需要複雜的程序和詳盡徹底的計算，我們在此將提出一個較為簡易的配置方法來答到我們的目標。首先先讓各使用者滿足其最小的傳輸功率的限制，之後再使用反覆性的方法來提升整體的書傳輸率。此演算法可適用於各細胞間使用者數量變動的情形下，並由結果可知其整體傳輸率與現有的方法相近且含有較低的複雜度。 Adaptive resource allocation in multi-cell orthogonal frequency division multiple access system is investigated in the work. The target is to find the transmitting rates of the subcarriers, the assignment of users allocated to these subcarriers, and the power allocation that maximize the total capacity. The model of the co-channel interference channel is considered in the system, and the transmitting required data rate of each user with his power constraint is satisfied. For uplink, due to the optimal solution which involves complex nonlinear programming or an exhaustive search, we propose a two-step algorithm with lower complexity. First we allocate channel and data rate by sub-rate algorithms. Then we use an iterative algorithm to increase the total capacity. Moreover our proposition is applied to fluctuant users for the base station. The simulation result shows that our proposition is close to the solution of algorithm existed with lower complexity.
Appears in Collections:	[Graduate Institute of Communication Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Size	Format

社群 sharing

Loading...