中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/48312
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 80990/80990 (100%)
造访人次 : 41824645      在线人数 : 1161
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/48312


    题名: 多使用者多輸入多輸出正交分頻多工系統使用最小均方誤差預編碼 之資源配置演算法;Resource Allocation in Multiuser MIMO-OFDM Systems with MMSE Precoding
    作者: 羅文廷;Wen-ting Luo
    贡献者: 通訊工程研究所
    关键词: 多輸入多輸出;正交分頻多工;資源配置;最小均方誤差預編碼;Multiple input multiple output (MIMO);resource allocation;orthogonal frequency division multiplexing (OFDM;minimum mean square error (MMSE) precoding
    日期: 2011-07-20
    上传时间: 2012-01-05 14:50:44 (UTC+8)
    摘要: 本文提出使用者選擇與功率配置演算法,目標為考慮使用者吞吐量總和最大化與公平性之間的補償,應用在多輸入多輸出正交分頻多工下鏈系統,並且使用最小均方誤差預編碼。因為找尋最佳使用者之集合計算複雜度過於龐大,所以我們使用一些數學簡化的程序來減少複雜度。然而干擾存在下之功率配置方式不再與傳統注水式功率配置演算法相同。在這個議題下,問題將不再是凸函數之問題,而是轉變成非線性非凸函數最佳化問題。我們根據二分逼近法提出功率配置演算法處理干擾存在下功率配置的問題只能找到局部最佳解。因此,我們使用全域最佳化方法計算帶有限制之下非線性非凸函數之最佳化問題。其方法將非線性非凸函數取代為兩種不同的凸函數,並計算全域最佳解。由複雜度與電腦模擬分析,我們可以知道提出次佳演算法逼近最佳解,並且有更少的複雜度,同時使用者吞吐量與公平性之間的補償也被考慮在其中。 In this thesis, the user selection and power allocation algorithm is proposed for downlink MIMO-OFDM system using MMSE precoding, where the objective considers balancing between the maximization of the sum of users’ throughput and their fairness. Since finding the optimal user subset has very high computational burden, we use some mathematical simplification processes to reduce the scheduling complexity. However, the power allocation is not in interference-free environment as in the conventional water filling method but in the presence of crosstalk. In this scenario, the problem under consideration is not a convex problem but a nonlinear non-convex optimization problem, which is difficult to solve. We propose a power allocation method based on the bisection strategy to overcome this problem with interference-aware capability of finding local optimal solutions. In addition, we use global optimization techniques to compute global optima of the constrained non-convex nonlinear optimization problems. Its objective function is replaced by a difference of two convex functions. The computer simulation results show that the proposed sub-optimal scheme is close to that of the optimal solution with a less complexity and the tradeoff between system throughput and fairness among users is considered.
    显示于类别:[通訊工程研究所] 博碩士論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML790检视/开启


    在NCUIR中所有的数据项都受到原著作权保护.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明