{"id":2317,"date":"2014-11-18T12:18:22","date_gmt":"2014-11-18T12:18:22","guid":{"rendered":"http:\/\/network.ee.tsinghua.edu.cn\/niulab\/?p=2317"},"modified":"2015-02-05T08:14:48","modified_gmt":"2015-02-05T08:14:48","slug":"dynamic-channel-acquisition-in-mu-mimo","status":"publish","type":"post","link":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/?p=2317","title":{"rendered":"Dynamic Channel Acquisition in MU-MIMO"},"content":{"rendered":"<p><a href=\"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/wp-content\/uploads\/2014\/10\/DCA_dbcol.pdf\" target=\"_blank\"><img loading=\"lazy\" decoding=\"async\" class=\"alignright size-full wp-image-117\" title=\"pdf\" src=\"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/wp-content\/uploads\/2010\/08\/pdf.gif\" alt=\"\" width=\"95\" height=\"50\" \/><\/a><br \/>\n<span class=\"paper_subtitle\">LANGUAGE<\/span><br \/>\nEnglish<br \/>\n<span class=\"paper_subtitle\">SOURCE<\/span><br \/>\nIEEE Trans. Commun.<br \/>\n<span class=\"paper_subtitle\">Published Date<\/span>:2014-12<br \/>\n<span class=\"paper_subtitle\">ABSTRACT<\/span><br \/>\nMultiuser multiple-input-multiple-output (MU-MIMO) systems are known to be hindered by dimensionality<br \/>\nloss due to channel state information (CSI) acquisition overhead. In this paper, we investigate user-scheduling in MU-MIMO systems on account of CSI acquisition overhead, where a base station dynamically acquires user channels to avoid choking the system with CSI overhead. The genie-aided optimization problem (GAP) is first formulated to maximize the Lyapunov-drift every scheduling step, incorporating user queue information and taking channel fluctuations into consideration. The scheduling scheme based on GAP, namely the GAP-rule, is proved to be throughput-optimal but practically infeasible, and thus serves as a performance bound. In view of the implementation overhead and delay unfairness of the GAP-rule, the T-frame dynamic channel acquisition scheme and the power-law DCA scheme are further proposed to mitigate the implementation overhead and delay unfairness, respectively. Both schemes are based on the GAP-rule and proved throughput-optimal. To make the schemes practically feasible, we then propose the heuristic schemes, queue-based quantized-block-length user scheduling scheme (QQS), T-frame QQS, and power-law QQS, which are the practical versions of the aforementioned GAP-based schemes, respectively. The QQS-based schemes substantially decrease the complexity, and also perform fairly close to the optimum. Numerical results evaluate the proposed schemes under various system parameters.<\/p>\n","protected":false},"excerpt":{"rendered":"<p><a href=\"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/wp-content\/uploads\/2014\/10\/DCA_dbcol.pdf\" target=\"_blank\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft size-full wp-image-117\" title=\"pdf\" src=\"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/wp-content\/uploads\/2010\/08\/pdf.gif\"alt=\"\" width=\"95\" height=\"50\" \/><\/a>Zhiyuan Jiang, Sheng Zhou, Zhisheng Niu, <span class=\"papertitle\">Dynamic Channel Acquisition in MU-MIMO<\/span>, <span class=\"papersource\">IEEE Trans. Commun., Dec., 2014<\/span><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[7],"tags":[100],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/posts\/2317"}],"collection":[{"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2317"}],"version-history":[{"count":4,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/posts\/2317\/revisions"}],"predecessor-version":[{"id":2410,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/posts\/2317\/revisions\/2410"}],"wp:attachment":[{"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2317"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2317"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2317"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}