Compressed Training Based Massive MIMO

被引:1
作者
Yilmaz, Baki Berkay [1 ]
Erdogan, Alper T. [2 ]
机构
[1] Georgia Inst Technol, Dept Elect & Comp Engn, Atlanta, GA 30332 USA
[2] Koc Univ, Dept Elect Elect Engn, TR-34450 Istanbul, Turkey
关键词
Massive MIMO; Compressed Training; EQUALIZATION; WIRELESS;
D O I
10.1109/TSP.2018.2890374
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Massive multiple-input-multiple-output (MIMO) scheme promises high spectral efficiency through the employment of large scale antenna arrays in base stations. In time division duplexed implementations, co-channel mobile terminals transmit training information such that base stations can estimate and exploit channel state information to spatially multiplex these users. In the conventional approach, the optimal choice for training length was shown to be equal to the number of users, K. In this paper, we propose a new semiblind framework, named as "MIMO Compressed Training," which utilizes information symbols in addition to training symbols for adaptive spatial multiplexing. We show that this framework enables us to reduce (compress) the training length down to a value close to log(2) (K), i.e., the logarithm of the number of users, without any sparsity assumptions on the channel matrix. We also derive a prescription for the required packet length for proper training. The framework is built upon some convex optimization settings that enable efficient and reliable algorithm implementations. The numerical experiments demonstrate the strong potential of the proposed approach in terms of increasing the number of users per cell and improving the link quality.
引用
收藏
页码:1191 / 1206
页数:16
相关论文
共 26 条
[1]   Living on the edge: phase transitions in convex programs with random data [J].
Amelunxen, Dennis ;
Lotz, Martin ;
McCoy, Michael B. ;
Tropp, Joel A. .
INFORMATION AND INFERENCE-A JOURNAL OF THE IMA, 2014, 3 (03) :224-294
[2]  
[Anonymous], 2013, INTRO LECT CONVEX OP, DOI DOI 10.1007/978-1-4419-8853-9
[3]  
[Anonymous], 2011, An introduction to compressive sensing
[4]   Massive MIMO: Ten Myths and One Critical Question [J].
Bjornson, Emil ;
Larsson, Erik G. ;
Marzetta, Thomas L. .
IEEE COMMUNICATIONS MAGAZINE, 2016, 54 (02) :114-123
[5]   Convex Optimization for Big Data [J].
Cevher, Volkan ;
Becker, Stephen ;
Schmidt, Mark .
IEEE SIGNAL PROCESSING MAGAZINE, 2014, 31 (05) :32-43
[6]   The Convex Geometry of Linear Inverse Problems [J].
Chandrasekaran, Venkat ;
Recht, Benjamin ;
Parrilo, Pablo A. ;
Willsky, Alan S. .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2012, 12 (06) :805-849
[7]   Semi-Blind Adaptive Spatial Equalization for MIMO Systems with High-Order QAM Signalling [J].
Chen, S. ;
Yao, W. ;
Hanzo, L. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2008, 7 (11) :4486-4491
[8]   A fast linear programming algorithm for blind equalization [J].
Ding, Z ;
Luo, ZQ .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2000, 48 (09) :1432-1436
[9]   Fast and low complexity blind equalization via subgradient projections [J].
Erdogan, AT ;
Kizilkale, C .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2005, 53 (07) :2513-2524
[10]   How much training is needed in multiple-antenna wireless links? [J].
Hassibi, B ;
Hochwald, BM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (04) :951-963