簡易檢索 / 詳目顯示

研究生: 葉政誼
Cheng-I Yeh
論文名稱: 利用差分凸規劃演算法對前端壓縮之最佳化
Optimization of fronthaul compression based on the difference of convex programming algorithm
指導教授: 林士駿
Shih-Chun Lin
口試委員: 張縱輝
Tsung-Hui Chang 
鍾偉和
Chung Wei-Ho
學位類別: 碩士
Master
系所名稱: 電資學院 - 電子工程系
Department of Electronic and Computer Engineering
論文出版年: 2016
畢業學年度: 104
語文別: 英文
論文頁數: 27
中文關鍵詞: 前端Wyner-Ziv編碼最小均方誤差連續干擾消除差分凸規劃演算法
外文關鍵詞: Fronthaul, Wyner-Ziv coding, MMSE, successive interference cancellation, Difference of convex algorithm
相關次數: 點閱:206下載:2
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

在本論文中,我們想要去最佳化上行雲端無線電接取網路的總傳輸率。在傳統的無線電接取網路中,基地台會去解碼使用者的訊息。相較於傳統上的基地台,在上行雲端無線電接取網路中的遠端無線射頻單元(RRU)會將收到的訊號直接往後送到雲端內的傳送基頻單元(BBU)去做聯合解碼。由於前端(Fronthaul)的頻寬是有限的,所以遠端無線射頻單元必須要將收到的訊號做壓縮。而我們想要解的總傳輸率的最佳化問題,總傳輸率並不是凸函數,因此我們透過一階近似法(first order approximation)去延伸差分凸規劃演算法來解決問題。最後的模擬結果顯示我們的做法改進了先前的做法。


In this thesis, we want to optimize the sum rate of the uplink cloud radio
access network (C-RAN). In traditional RAN, base stations will decode users’
messages. Corresponding to traditional base stations, the radio remote units
(RRUs) in C-RAN will forward their received signals and let the baseband
unit (BBU) in the cloud to be the joint decoding. Due to finite bandwidth
of the fronthaul, the RRUs need to compress their received signals. Our sum
rate optimization over fronthaul compression is not convex. Thus we apply
the first-order approximation to invoke the difference of convex algorithms for solving it. Simulation results show that our work improve the performance of previous works.

1.Introduction 2.Ran and C-RAN 3.The improvement of C-RAN architecture 4.Solve the optimize problem 5.Simulation 6.Conclusion and future direction

[1] China Mobile Research Institute, “C-RAN : The road towards green
RAN(ver. 3.0),” White Paper, Dec. 2013.
[2] T.-J. Chuang, “Resource allocation for uplink cloud radio access network,”
2015.
[3] T. P. Dinh and H. A. Le Thi, “Recent advances in dc programming and
dca,” in Transactions on Computational Intelligence XIII. Springer, 2014,
pp. 1–37.
[4] D. Brandwood, “A complex gradient operator and its application in adaptive
array theory,” in IEE Proceedings F (Communications, Radar and
Signal Processing), vol. 130, no. 1. IET, 1983, pp. 11–16.
[5] M. Razaviyayn, M. Hong, and Z.-Q. Luo, “A unified convergence analysis
of block successive minimization methods for nonsmooth optimization,”
SIAM Journal on Optimization, vol. 23, no. 2, pp. 1126–1153, 2013.
[6] M. Payar´o and D. P. Palomar, “Hessian and concavity of mutual information,
differential entropy, and entropy power in linear vector gaussian
channels,” Information Theory, IEEE Transactions on, vol. 55, no. 8, pp.
3613–3628, 2009.
[7] L. Zhou and W. Yu, “Uplink multicell processing with limited backhaul
via per-base-station successive interference cancellation,” IEEE Journal on
Selected Areas in Communications, vol. 31, no. 10, pp. 1981–1993, 2013.

QR CODE