MIMO channel estimation algorithm using complete complementary sequence

Author(s):  
Li Shufeng ◽  
Zeng Jiabao
2012 ◽  
Vol 2012 ◽  
pp. 1-11 ◽  
Author(s):  
Xiaoyan Xu ◽  
Jianjun Wu ◽  
Shubo Ren ◽  
Lingyang Song ◽  
Haige Xiang

We introduce the superimposed training strategy into the multiple-input multiple-output (MIMO) amplify-and-forward (AF) one-way relay network (OWRN) to perform the individual channel estimation at the destination. Through the superposition of a group of additional training vectors at the relay subject to power allocation, the separated estimates of the source-relay and relay-destination channels can be obtained directly at the destination, and the accordance with the two-hop AF strategy can be guaranteed at the same time. The closed-form Bayesian Cramér-Rao lower bound (CRLB) is derived for the estimation of two sets of flat-fading MIMO channel under random channel parameters and further exploited to design the optimal training vectors. A specific suboptimal channel estimation algorithm is applied in the MIMO AF OWRN using the optimal training sequences, and the normalized mean square error performance for the estimation is provided to verify the Bayesian CRLB results.


2013 ◽  
Vol 475-476 ◽  
pp. 893-899
Author(s):  
Miao Miao Chang ◽  
Jin He Zhou ◽  
Ju Rong Wang

We introduced an improved singular value decomposition (SVD) channel estimation algorithm for multiple-input multiple-output (MIMO) wireless communication system. The algorithm is supposed to solve the issue that the channel estimation result is not accurate when the training sequences have some 0 elements. The improvement is also applicable in the other channel estimation algorithms. We made some comparisons between the linear least squares (LS) and the linear minimum mean square error (LMMSE) channel estimation, the traditional singular value decomposition and the improved SVD algorithm to demonstrate the efficiency. Results show that the proposed improved SVD algorithm has better performance in mean square error (MSE) and bit error rate (BER) of channel estimation and the estimated values approach the actual channel state.


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.


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

Abstract Based on the finite scattering characters of the millimeter-wave multiple-input multiple-output (mmWave 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 (EM-SBL) algorithm can be applied to handle this problem, however, 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 (DGAMP) 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.


2014 ◽  
Vol 35 (3) ◽  
pp. 665-670 ◽  
Author(s):  
Zhi-bin Xie ◽  
Tong-si Xue ◽  
Yu-bo Tian ◽  
Wei-chen Zou ◽  
Qing-hua Liu ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document