Optimization of fronthaul compression based on the difference of convex programming algorithm
碩士 === 國立臺灣科技大學 === 電子工程系 === 104 === 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 thei...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2016
|
Online Access: | http://ndltd.ncl.edu.tw/handle/96251734678634558303 |
id |
ndltd-TW-104NTUS5428109 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-104NTUS54281092017-09-24T04:40:50Z http://ndltd.ncl.edu.tw/handle/96251734678634558303 Optimization of fronthaul compression based on the difference of convex programming algorithm 利用差分凸規劃演算法對前端壓縮之最佳化 Cheng-I Yeh 葉政誼 碩士 國立臺灣科技大學 電子工程系 104 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. Shih-Chun Lin 林士駿 2016 學位論文 ; thesis 27 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺灣科技大學 === 電子工程系 === 104 === 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.
|
author2 |
Shih-Chun Lin |
author_facet |
Shih-Chun Lin Cheng-I Yeh 葉政誼 |
author |
Cheng-I Yeh 葉政誼 |
spellingShingle |
Cheng-I Yeh 葉政誼 Optimization of fronthaul compression based on the difference of convex programming algorithm |
author_sort |
Cheng-I Yeh |
title |
Optimization of fronthaul compression based on the difference of convex programming algorithm |
title_short |
Optimization of fronthaul compression based on the difference of convex programming algorithm |
title_full |
Optimization of fronthaul compression based on the difference of convex programming algorithm |
title_fullStr |
Optimization of fronthaul compression based on the difference of convex programming algorithm |
title_full_unstemmed |
Optimization of fronthaul compression based on the difference of convex programming algorithm |
title_sort |
optimization of fronthaul compression based on the difference of convex programming algorithm |
publishDate |
2016 |
url |
http://ndltd.ncl.edu.tw/handle/96251734678634558303 |
work_keys_str_mv |
AT chengiyeh optimizationoffronthaulcompressionbasedonthedifferenceofconvexprogrammingalgorithm AT yèzhèngyì optimizationoffronthaulcompressionbasedonthedifferenceofconvexprogrammingalgorithm AT chengiyeh lìyòngchàfēntūguīhuàyǎnsuànfǎduìqiánduānyāsuōzhīzuìjiāhuà AT yèzhèngyì lìyòngchàfēntūguīhuàyǎnsuànfǎduìqiánduānyāsuōzhīzuìjiāhuà |
_version_ |
1718540276620853248 |