Noncoherent space-time coding for correlated massive MIMO channel with Riemannian distance

被引:1
|
作者
Li, Shuangzhi [1 ,2 ]
Sun, Xiaohang [2 ]
Xiao, Yu-Hang [3 ]
Guo, Xin [1 ]
Zhang, Jiankang [4 ]
机构
[1] Zhengzhou Univ, Sch Elect & Informat Engn, Zhengzhou 450001, Peoples R China
[2] Hengdian Elect Co Ltd, Nanjing 210049, Peoples R China
[3] Shenzhen Univ, Coll Elect & Informat Engn, Shenzhen 518060, Peoples R China
[4] Bournemouth Univ, Dept Comp & Informat, Poole BH12 5BB, England
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Massive MIMO; Correlated Rayleigh fading channel; Riemannian distance; Noncoherent space time coding; UNITARY SPACE; WIRELESS ACCESS; DESIGN; COMMUNICATION; MODULATION; CONSTELLATIONS; SYSTEMS; CODES;
D O I
10.1016/j.dsp.2022.103876
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper considers a massive multiple-input multiple-output (MIMO) uplink system in correlated Rayleigh fading channels. A transmitter with two antennas needs to send data timely to a base station with a large number of antennas. We assume the channel coefficients keep constant during two consecutive time slots and change independently in the following two successive time slots. We construct a Riemannian-distance (RD) based noncoherent detector for such a system. Also, we propose a novel noncoherent parametric space-time coding method. We first attain the closed-form solutions of the optimal sub-constellation structures for fixed modulation orders with the max-min rule. Then, we determine the optimal modulation order for each sub-constellation. The analytical results show that our proposed scheme can attain a larger RD distance than the existing massive uniquely factorable constellation coding (MUFC) scheme. Further, we illustrate that our proposed coding scheme enables a low-complexity RD decoding algorithm. Simulation results show that our proposed scheme performs better than the current phase shift keying modulation scheme and MUFC scheme. (c) 2022 Elsevier Inc. All rights reserved.
引用
收藏
页数:15
相关论文
共 50 条
  • [21] Signal design and convolutional coding for noncoherent space-time communication on the block-Rayleigh-fading channel
    McCloud, ML
    Brehler, M
    Varanasi, MK
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (05) : 1186 - 1194
  • [22] Noncoherent Massive Space-Time Block Codes for Uplink Network Communications
    Li, Shuangzhi
    Zhang, Jian-Kang
    Mu, Xiaomin
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (06) : 5013 - 5027
  • [23] Noncoherent space-time equalization
    Schober, R
    Pasupathy, S
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2003, 2 (03) : 537 - 548
  • [24] Noncoherent space-time equalization
    Schober, R
    Pasupathy, PS
    2002 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, CONFERENCE PROCEEDINGS, 2002, : 797 - 801
  • [25] Noncoherent detection of orthogonal modulation combined with Alamouti space-time coding
    Simon, MK
    Wang, JB
    JOURNAL OF COMMUNICATIONS AND NETWORKS, 2003, 5 (02) : 124 - 134
  • [26] Choice of appropriate space-time coding scheme for MIMO systems employing channel coding under BICM
    Khalighi, Mohammad-Ali
    Helard, Jean-Francois
    Bourennane, Salah
    2006 IEEE 7TH WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS, VOLS 1 AND 2, 2006, : 204 - 208
  • [27] Censored noncoherent distributed space-time coding for wireless sensor networks
    Yiu, Simon
    Schober, Robert
    2007 IEEE WIRELESS COMMUNICATIONS & NETWORKING CONFERENCE, VOLS 1-9, 2007, : 601 - 606
  • [28] A novel space-time MIMO channel model
    Lee, Chong Hyun
    2006 INTERNATIONAL CONFERENCE ON HYBRID INFORMATION TECHNOLOGY, VOL 1, PROCEEDINGS, 2006, : 599 - 605
  • [29] Finite-SNR performance analysis of space-time coding in correlated Ricean MIMO channels
    Clerclcx, Bruno
    Oestges, Claude
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (12) : 4761 - 4777
  • [30] A new space-time MIMO channel model
    Zhang, Min
    Smith, Peter J.
    Shafi, Mansoor
    6TH AUSTRALIAN COMMUNICATIONS THEORY WORKSHOP 2005, PROCEEDINGS, 2005, : 249 - 254