DocumentCode :
3653557
Title :
Reduced complexity precoding and scheduling algorithms for full-dimension MIMO systems
Author :
Yan Xin;Young-Han Nam;Yang Li;Jianzhong Charlie Zhang
Author_Institution :
Samsung Research America Dallas (SRA-D), Richardson, TX 75082, USA
fYear :
2014
Firstpage :
4858
Lastpage :
4863
Abstract :
Full-dimension multiple-input multiple-output (FD-MIMO) systems, in which base stations are equipped with a large number of antennas in a two-dimensional panel, has received considerable attention from academia researchers and industry practitioners. Compared with legacy cellular communication systems, FD-MIMO systems can achieve significantly higher spectral efficiency with high order multi-user MIMO (MU-MIMO) transmissions. However, as high-order MU-MIMO also incurs high precoding and scheduling complexity, it is critical to reduce complexity of these operations in order to realize throughput potential of FD-MIMO systems in practice. In this paper, we propose a reduced complexity algorithm to realize the high performance precoding technique, signal-to-leakage plus noise ratio (SLNR) precoding, and propose an efficient scheduling algorithm to enable high-order MU-MIMO transmissions in FD-MIMO systems. We further demonstrate the effectiveness of the proposed algorithms by using system level simulations.
Keywords :
"Measurement","Complexity theory","Throughput","Scheduling algorithms","Vectors","MIMO","Matrix decomposition"
Publisher :
ieee
Conference_Titel :
Global Communications Conference (GLOBECOM), 2014 IEEE
ISSN :
1930-529X
Type :
conf
DOI :
10.1109/GLOCOM.2014.7037575
Filename :
7037575
Link To Document :
بازگشت