An Efficient Millimeter-Wave MIMO Channel Estimation Scheme for Space Information Networks

Author(s):  
Qiwen Li ◽  
Jian Jiao ◽  
Yunyu Sun ◽  
Shaohua Wu ◽  
Ye Wang ◽  
...  
2012 ◽  
Vol 182-183 ◽  
pp. 2066-2070
Author(s):  
Hui Shi ◽  
Ren Wang Song ◽  
Gang Fei Wang

This paper puts forward a suitable channel estimation scheme for multiple input multiple output and orthogonal frequency division multiplexing system (MIMO-OFDM) based on discrete wavelet transform. According to the least-squares standard (LS), this plan uses pilot to estimate the unit impulse response of MIMO channel firstly, then does wavelet denoising in changing domain, in order to reduce the frequency spectrum leakage and improve the estimation precision. At the same time, this method does not need to know channel information in advance, and can follow up the changes of channel on time with good error rate performance.


2018 ◽  
Vol 25 (11) ◽  
pp. 1675-1679 ◽  
Author(s):  
Evangelos Vlachos ◽  
George C. Alexandropoulos ◽  
John Thompson

Author(s):  
Jianfeng Shao ◽  
Xianpeng Wang ◽  
Xiang Lan ◽  
Zhiguang Han ◽  
Ting Su

AbstractBased on the finite scattering characters of the millimeter-wave multiple-input multiple-output (MIMO) channel, the mmWave channel estimation problem can be considered as a sparse signal recovery problem. However, most traditional channel estimation methods depend on grid search, which may lead to considerable precision loss. To improve the channel estimation accuracy, we propose a high-precision two-stage millimeter-wave MIMO system channel estimation algorithm. Since the traditional expectation–maximization-based sparse Bayesian learning algorithm can be applied to handle this problem, it spends lots of time to calculate the E-step which needs to compute the inversion of a high-dimensional matrix. To avoid the high computation of matrix inversion, we combine damp generalized approximate message passing with the E-step in SBL. We then improve a refined algorithm to handle the dictionary matrix mismatching problem in sparse representation. Numerical simulations show that the estimation time of the proposed algorithm is greatly reduced compared with the traditional SBL algorithm and better estimation performance is obtained at the same time.


Sign in / Sign up

Export Citation Format

Share Document