English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 10629741      Online Users : 107
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 歷任校長 > 陳文村 (2006-2010)  > 會議論文 >  Downlink Radio Resource Allocation with Carrier Aggregation in MIMO LTE-Advanced Systems

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/81578

    Title: Downlink Radio Resource Allocation with Carrier Aggregation in MIMO LTE-Advanced Systems
    Authors: Pei-Ling Tsai;Kate Ching-Ju Lin;W. T. Chen
    教師: 陳文村
    Date: 2014
    Publisher: Institute of Electrical and Electronics Engineers
    Relation: Proceedings of IEEE International Conference on Communications (ICC 2014), Institute of Electrical and Electronics Engineers, Sydney, Australia, June 2014
    Keywords: Downlink Radio Resource Allocation
    Carrier Aggregation
    MIMO LTE-Advanced Systems
    Abstract: Long Term Evolution-Advanced (LTE-A) networks exploit the Carrier Aggregation (CA) technique to achieve a higher data rate by allowing user equipments (UEs) to simultaneously aggregate multiple component carriers (CCs). Moreover, MIMO technologies have become increasingly mature and been adopted as a default choice of the 4G standards. However, most of existing studies on resource allocation with carrier aggregation do not consider the MIMO capability of UEs. In this paper, we address the spectrum resource allocation problem with consideration of UEs’ MIMO capability as well as modulation and coding schemes (MCSs) selection in carrier aggregation based LTE-A systems. We formulate the problem under both backlogged and finite queue traffic models as an optimization model, and prove its NP-hardness. As a result, a 1/2-approximation algorithm is proposed to find a suboptimal solution of resource allocation. Simulation results show that the proposed algorithm outperforms the existing schemes, and performs fairly close to the optimal solution under the small-scale scenarios.
    Relation Link: http://www.iis.sinica.edu.tw/papers/chenwt/16997-F.pdf
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/81578
    Appears in Collections:[陳文村 (2006-2010) ] 會議論文
    [資訊工程學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    2032021030158.pdf400KbAdobe PDF583View/Open


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback