Multiuser Beamforming and Opportunistic Scheduling for Transparent Hierarchical Cellular Systems

碩士 === 國立中央大學 === 通訊工程學系 === 102 === The idea of cognitive radio (CR) has embodied concretely in hierarchical cellular systems by deploying an underlying microcellular system to reuse the underutilized spectrum licensed by a macrocellular system. The fundamental challenges for successfully realizing...

Full description

Bibliographic Details
Main Authors: Chia-hui Ho, 何家卉
Other Authors: Meng-lin Ku
Format: Others
Language:zh-TW
Published: 2014
Online Access:http://ndltd.ncl.edu.tw/handle/xzn49r
id ndltd-TW-102NCU05650113
record_format oai_dc
spelling ndltd-TW-102NCU056501132019-05-15T21:32:35Z http://ndltd.ncl.edu.tw/handle/xzn49r Multiuser Beamforming and Opportunistic Scheduling for Transparent Hierarchical Cellular Systems 多用戶波束成型和機會式排程於透明階層式蜂巢式系統 Chia-hui Ho 何家卉 碩士 國立中央大學 通訊工程學系 102 The idea of cognitive radio (CR) has embodied concretely in hierarchical cellular systems by deploying an underlying microcellular system to reuse the underutilized spectrum licensed by a macrocellular system. The fundamental challenges for successfully realizing such hierarchical systems are to manage the intercell interference between the macrocell and microcell and to pursue the goal of maximizing the spectrum recycling efficiency. Recently, the idea of interference alignment has been emerged to utilize the spatial dimension offered by multiple antennas to overcome the interference problem and achieve the maximum sum rate performance. In this thesis, we jointly consider antenna beamforming, power allocation, and multiuser scheduling for the secondary system to utilize the uplink spectrum of the primary cell and to concurrently serve multiple secondary users in the uplink. IA is applied to manage the interference from the secondary users to the primary cellular system in a transparent hierarchical cognitive radio (HCR) system. By change of variables, we can remove the IA constraint by absorbing it into the sum rate formula, and the original beamforming problem becomes solvable and the optimal solution can be gotten by using an iterative water-filling approach. The iterative water-filling algorithm transform the multiuser sum rate maximization into a series of single-user sum rate maximizations for each user by regarding all other users’ signals as additional noise at each step. The algorithm finds the single-user water-filling covariance matrix for each step. The sum rate objective is increasing with each water-filling step and the sum rate will converge to a limit. Furthermore, the two-stage user scheduling that makes use of multiuser diversity is investigated to further improve the sum rate performance and the fairness among users via PF rule and orthogonality. Meng-lin Ku 古孟霖 2014 學位論文 ; thesis 49 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立中央大學 === 通訊工程學系 === 102 === The idea of cognitive radio (CR) has embodied concretely in hierarchical cellular systems by deploying an underlying microcellular system to reuse the underutilized spectrum licensed by a macrocellular system. The fundamental challenges for successfully realizing such hierarchical systems are to manage the intercell interference between the macrocell and microcell and to pursue the goal of maximizing the spectrum recycling efficiency. Recently, the idea of interference alignment has been emerged to utilize the spatial dimension offered by multiple antennas to overcome the interference problem and achieve the maximum sum rate performance. In this thesis, we jointly consider antenna beamforming, power allocation, and multiuser scheduling for the secondary system to utilize the uplink spectrum of the primary cell and to concurrently serve multiple secondary users in the uplink. IA is applied to manage the interference from the secondary users to the primary cellular system in a transparent hierarchical cognitive radio (HCR) system. By change of variables, we can remove the IA constraint by absorbing it into the sum rate formula, and the original beamforming problem becomes solvable and the optimal solution can be gotten by using an iterative water-filling approach. The iterative water-filling algorithm transform the multiuser sum rate maximization into a series of single-user sum rate maximizations for each user by regarding all other users’ signals as additional noise at each step. The algorithm finds the single-user water-filling covariance matrix for each step. The sum rate objective is increasing with each water-filling step and the sum rate will converge to a limit. Furthermore, the two-stage user scheduling that makes use of multiuser diversity is investigated to further improve the sum rate performance and the fairness among users via PF rule and orthogonality.
author2 Meng-lin Ku
author_facet Meng-lin Ku
Chia-hui Ho
何家卉
author Chia-hui Ho
何家卉
spellingShingle Chia-hui Ho
何家卉
Multiuser Beamforming and Opportunistic Scheduling for Transparent Hierarchical Cellular Systems
author_sort Chia-hui Ho
title Multiuser Beamforming and Opportunistic Scheduling for Transparent Hierarchical Cellular Systems
title_short Multiuser Beamforming and Opportunistic Scheduling for Transparent Hierarchical Cellular Systems
title_full Multiuser Beamforming and Opportunistic Scheduling for Transparent Hierarchical Cellular Systems
title_fullStr Multiuser Beamforming and Opportunistic Scheduling for Transparent Hierarchical Cellular Systems
title_full_unstemmed Multiuser Beamforming and Opportunistic Scheduling for Transparent Hierarchical Cellular Systems
title_sort multiuser beamforming and opportunistic scheduling for transparent hierarchical cellular systems
publishDate 2014
url http://ndltd.ncl.edu.tw/handle/xzn49r
work_keys_str_mv AT chiahuiho multiuserbeamformingandopportunisticschedulingfortransparenthierarchicalcellularsystems
AT héjiāhuì multiuserbeamformingandopportunisticschedulingfortransparenthierarchicalcellularsystems
AT chiahuiho duōyònghùbōshùchéngxínghéjīhuìshìpáichéngyútòumíngjiēcéngshìfēngcháoshìxìtǒng
AT héjiāhuì duōyònghùbōshùchéngxínghéjīhuìshìpáichéngyútòumíngjiēcéngshìfēngcháoshìxìtǒng
_version_ 1719116016206741504