Iterative channel estimation and data detection algorithm for MIMO-OTFS systems

被引:2
作者
Ouchikh, Rabah [1 ]
Chonavel, Thierry [2 ]
Aissa-El-Bey, Abdeldjalil [2 ]
Djeddou, Mustapha [1 ]
机构
[1] Ecole Mil Polytech, Lab Telecommun, Bordj El Bahri, Algeria
[2] CNRS, IMT Atlantique, Lab STICC, UMR 6285, F-29238 Brest, France
关键词
OTFS; MIMO; Channel estimation; Data detection; Superimposed pilot pattern; PILOT;
D O I
10.1016/j.dsp.2023.104234
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Channel estimation in high-mobility environments is a challenging problem for advanced mobile communication systems (5G and beyond). In this manuscript, we first propose an iterative algorithm for channel estimation and data detection in the delay-Doppler domain for multiple-input multiple-output orthogonal time frequency space system. Then, in order to increase the spectral efficiency of the system, we use a superimposed pilot pattern. The proposed algorithm takes advantage from the sparse nature of the channel in the delay-Doppler domain and iterates between message passing-aided data detection and data-aided channel estimation. For channel estimation, we propose two algorithms. The first one consists in estimating all channel parameters, including the number of path gains, delay taps, Doppler taps, and channel gains by using a mean-field approximation and the variational Bayesian expectation maximization algorithm. The second one, based on the fact that delay and Doppler taps remain unchanged for a rather long period of time, uses an MMSE approach combined with Cholesky decomposition to only estimate channel gains in each transmitted frame. For data detection, we adapt the message-passing algorithm proposed in the literature. We also derive a lower bound on the signal to-interference-plus-noise ratio of the proposed scheme, and maximize it by optimally allocating power between pilots and data symbols. Finally, we compare the complexity and the performance in terms of normalized mean square error, bit error rate, and spectral efficiency against existing methods. Simulation results, conducted in high-mobility scenarios show that the proposed algorithm achieves a good compromise between complexity and performance.
引用
收藏
页数:15
相关论文
共 43 条
[1]   Space-Time Coded OTFS Modulation in High-Doppler Channels [J].
Augustine, Rose Mary ;
Surabhi, G. D. ;
Chockalingam, A. .
2019 IEEE 89TH VEHICULAR TECHNOLOGY CONFERENCE (VTC2019-SPRING), 2019,
[2]  
Beal Matthew James, 2003, Variational algorithms for approximate Bayesian inference
[3]  
Beal MJ, 2003, BAYESIAN STATISTICS 7, P453
[4]  
Bishop C., 2006, Pattern Recognition and Machine Learning
[5]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[6]   OTFS-NOMA: An Efficient Approach for Exploiting Heterogenous User Mobility Profiles [J].
Ding, Zhiguo ;
Schober, Robert ;
Fan, Pingzhi ;
Poor, H. Vincent .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (11) :7950-7965
[7]   Boltzmann Machine and Mean-Field Approximation for Structured Sparse Decompositions [J].
Dremeau, Angelique ;
Herzet, Cedric ;
Daudet, Laurent .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (07) :3425-3438
[8]  
Hadani R, 2017, IEEE WCNC
[9]  
Herzet C, 2010, EUR SIGNAL PR CONF, P1474
[10]  
Horn R. A., 2012, MATRIX ANAL