Efficient Estimation and Prediction for Sparse Time-Varying Underwater Acoustic Channels

被引:57
作者
Zhang, Yi [1 ]
Venkatesan, Ramachandran [1 ]
Dobre, Octavia A. [1 ]
Li, Cheng [1 ]
机构
[1] Mem Univ, Fac Engn & Appl Sci, St John, NF A1B 3X5, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Channel estimation; Estimation; Doppler effect; Prediction algorithms; Matching pursuit algorithms; Complexity theory; Time-varying channels; Adaptive channel prediction; compressed sensing (CS); delay-Doppler spreading function (DDSF); sparse channel estimation; underwater acoustic (UWA) communications; MATCHING PURSUIT ALGORITHM; SIGNAL RECOVERY; COMMUNICATION; EQUALIZATION; PERFORMANCE; TRACKING;
D O I
10.1109/JOE.2019.2911446
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
This paper investigates the estimation and prediction of the sparse time-varying channel in underwater acoustic communication systems. The estimation approach exploits the sparse structure of the delay-Doppler representation of the channel. Various state-of-the-art matching pursuit (MP)-type algorithms for sparse signal reconstruction are compared. Among the considered algorithms, sparsity adaptive MP (SaMP) and its variant adaptive step size SaMP have the advantage of not requiring a priori knowledge of the sparsity level and outperform the other algorithms in terms of mean squared error (MSE). Moreover, due to the fast time-varying nature and the extremely limited bandwidth of the UWA channels, a channel prediction that can provide up-to-date channel state information is necessary for reliable symbol detection. This paper proposes an adaptive channel prediction scheme that extrapolates the channel knowledge estimated from a block of training symbols, and the predicted channel is used to decode consecutive data blocks. The proposed scheme does not require any a priori knowledge of channel dynamic model and noise statistics, and is able to provide future channel estimates based solely on current channel estimates. Furthermore, the proposed scheme operates in the delay-Doppler domain, and thus has a remarkably lower computational complexity when compared with the channel prediction in time domain. To further improve the prediction accuracy, past detected symbols are fed back to assist the proposed predictor with an up-to-date channel estimate. Simulation results of the proposed channel estimation and prediction demonstrate a good tradeoff between the MSE/bit error rate and the computational complexity.
引用
收藏
页码:1112 / 1125
页数:14
相关论文
共 36 条
[1]  
[Anonymous], 1963, IEEE Trans. Comm. Syst., DOI [10.1109/TCOM.1963.1088793, DOI 10.1109/TCOM.1963.1088793]
[2]   Compressed Channel Sensing: A New Approach to Estimating Sparse Multipath Channels [J].
Bajwa, Waheed U. ;
Haupt, Jarvis ;
Sayeed, Akbar M. ;
Nowak, Robert .
PROCEEDINGS OF THE IEEE, 2010, 98 (06) :1058-1076
[3]   IEEE-SPS and connexions - An open access education collaboration [J].
Baraniuk, Richard G. ;
Burrus, C. Sidney ;
Thierstein, E. Joel .
IEEE SIGNAL PROCESSING MAGAZINE, 2007, 24 (06) :6-+
[4]   Sparse Channel Estimation for Multicarrier Underwater Acoustic Communication: From Subspace Methods to Compressed Sensing [J].
Berger, Christian R. ;
Zhou, Shengli ;
Preisig, James C. ;
Willett, Peter .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (03) :1708-1721
[5]  
Brady D., 1998, Wireless Communications, P330
[6]  
Chen SS, 2006, SIAM J SCI COMPUT, V20, P33
[7]   Low-Density Parity Check Codes over GF (q) [J].
Davey, Matthew C. ;
MacKay, David .
IEEE COMMUNICATIONS LETTERS, 1998, 2 (06) :165-167
[8]   SPARSITY ADAPTIVE MATCHING PURSUIT ALGORITHM FOR PRACTICAL COMPRESSED SENSING [J].
Do, Thong T. ;
Gan, Lu ;
Nguyen, Nam ;
Tran, Trac D. .
2008 42ND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-4, 2008, :581-+
[9]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306
[10]  
Eiwen D, 2011, INT CONF ACOUST SPEE, P2928