An ESPRIT-Based Approach for 2-D Localization of Incoherently Distributed Sources in Massive MIMO Systems

被引:204
作者
Hu, Anzhong [1 ,2 ]
Lv, Tiejun [1 ,2 ]
Gao, Hui [1 ,2 ]
Zhang, Zhang [3 ]
Yang, Shaoshi [4 ]
机构
[1] Minist Educ, Key Lab Trustworthy Distributed Comp & Serv, Beijing 100876, Peoples R China
[2] Beijing Univ Posts & Telecommun, Sch Informat & Commun Engn, Beijing 100876, Peoples R China
[3] Alcatel Lucent Shanghai Bell Co Ltd, Res & Innovat Ctr, Shanghai 201206, Peoples R China
[4] Univ Southampton, Sch Elect & Comp Sci, Southampton SO17 1BJ, Hants, England
基金
中国国家自然科学基金;
关键词
Angular spread; direction-of-arrival (DOA); large-scale/massive multiple-input multiple-output (LS-MIMO/massive MIMO); two-dimensional (2-D) localization; very large arrays; DIRECTION-OF-ARRIVAL; LOW-COMPLEXITY ESTIMATION; SUBSPACE ROTATION APPROACH; ANGULAR SPREAD; PARAMETRIC LOCALIZATION; MAXIMUM-LIKELIHOOD; FITTING APPROACH; ARRAY; DOA; ESTIMATOR;
D O I
10.1109/JSTSP.2014.2313409
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, an approach of estimating signal parameters via rotational invariance technique (ESPRIT) is proposed for two-dimensional (2-D) localization of incoherently distributed (ID) sources in large-scale/massive multiple-input multiple-output (MIMO) systems. The traditional ESPRIT-based methods are valid only for one-dimensional (1-D) localization of the ID sources. By contrast, in the proposed approach the signal subspace is constructed for estimating the nominal azimuth and elevation direction-of-arrivals and the angular spreads. The proposed estimator enjoys closed-form expressions and hence it bypasses the searching over the entire feasible field. Therefore, it imposes significantly lower computational complexity than the conventional 2-D estimation approaches. Our analysis shows that the estimation performance of the proposed approach improves when the large-scale/massive MIMO systems are employed. The approximate Cramer-Rao bound of the proposed estimator for the 2-D localization is also derived. Numerical results demonstrate that albeit the proposed estimation method is comparable with the traditional 2-D estimators in terms of performance, it benefits from a remarkably lower computational complexity.
引用
收藏
页码:996 / 1011
页数:16
相关论文
共 52 条
[1]   Beamforming via Large and Dense Antenna Arrays Above a Clutter [J].
Alrabadi, Osama N. ;
Tsakalaki, Elpiniki ;
Huang, Howard ;
Pedersen, Gert F. .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2013, 31 (02) :314-325
[2]   The effects of local scattering on direction of arrival estimation with MUSIC [J].
Astély, D ;
Ottersten, B .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1999, 47 (12) :3220-3234
[3]   Low-complexity estimators for distributed sources [J].
Bengtsson, M ;
Ottersten, B .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2000, 48 (08) :2185-2194
[4]   A generalization of weighted subspace fitting to full-rank models [J].
Bengtsson, M ;
Ottersten, B .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2001, 49 (05) :1002-1012
[5]  
BENGTSSON M, 1999, THESIS ROYAL I TECHN
[6]   Approximate maximum likelihood estimators for array processing in multiplicative noise environments [J].
Besson, O ;
Vincent, F ;
Stoica, P ;
Gershman, AB .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2000, 48 (09) :2506-2518
[7]   Decoupled estimation of DOA and angular spread for a spatially distributed source [J].
Besson, O ;
Stoica, P .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2000, 48 (07) :1872-1882
[8]   Simple and accurate direction of arrival estimator in the case of imperfect spatial coherence [J].
Besson, O ;
Stoica, P ;
Gershman, AB .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2001, 49 (04) :730-737
[9]   Extension of COMET algorithm to multiple diffuse source localization in azimuth and elevation [J].
Boujemâa, H .
EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 2005, 16 (06) :557-566
[10]   Spectrally Efficient Time-Frequency Training OFDM for Mobile Large-Scale MIMO Systems [J].
Dai, Linglong ;
Wang, Zhaocheng ;
Yang, Zhixing .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2013, 31 (02) :251-263