کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6882850 | 1443891 | 2017 | 38 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An opportunistic scheduling algorithm using aged CSI in massive MIMO systems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In time-division duplex (TDD) massive multiple-input multiple-output (MIMO) systems, the spatial multiplexing gain cannot be fully achieved since available pilot resources at each channel coherence time interval are limited. In this paper, we propose an Opportunistic user Scheduling algorithm, termed OpSAC, that uses Aged Channel state information (CSI) to increase spatial multiplexing gain without incurring additional pilot overhead. Assuming the base station (BS) employs two popular precoders of maximum ratio transmission (MRT) and zero-forcing (ZF), we first derive their closed-form lower bounds on the achievable sum-rate under channel aging. According to the analysis results, we develop a heuristic solution that estimates the amount of channel variation for each user by using correlation of CSI samples, and exploits channel conditions to opportunistically schedule more users by using aged CSI, thereby enhancing spectral efficiency. Through numerical analysis and simulation we confirm that the proposed lower bounds are very tight, and show the impact of channel aging on the performance of massive MIMO systems. In addition, it is shown that OpSAC achieves near-optimal performance and considerably outperforms the conventional user scheduling algorithm that uses current CSI only.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Networks - Volume 129, Part 1, 24 December 2017, Pages 284-296
Journal: Computer Networks - Volume 129, Part 1, 24 December 2017, Pages 284-296
نویسندگان
Hyunjoong Lee, Sangkyu Park, Saewoong Bahk,