Indian Journal of Science and Technology
Year: 2016, Volume: 9, Issue: 20, Pages: 1-7
V. Nagendra Babu1*, V. Adinarayana1 , K. Muralikrishna2 and P. Rajesh Kumar3
1Department of ECE, Vignan’s Institute of Information Technology, Visakhapatnam - 530049, Andhra Pradesh, India; [email protected], [email protected] 2Department of ECE, ANITS Engineering College, Visakhapatnam - 531162, Andhra Pradesh, India; [email protected] 3Department of ECE, A.U College of Engineering, Andhra University,Visakhapatnam - 530003, Andhra Pradesh, India; [email protected]
*Author for correspondence
V. Nagendra Babu
Department of ECE, Vignan’s Institute of Information Technology, Visakhapatnam - 530049, Andhra Pradesh, India; [email protected]
In this paper, we proposed an improved recovery algorithm, with efficient pilot placement, for Compressed Sensing (CS)-based sparse channel estimation based on Sparsity Adaptive Matching Pursuit (SAMP) in Orthogonal Frequency Division Multiplexing (OFDM) communication systems. The proposed algorithm does not require a priori knowledge of the sparsity, and to approach the true sparsity, adjusts the step size adaptively. Furthermore, estimation accuracy can be affected by different measurement matrices in CS, due to different pilot arrangements. It is known that, the Cyclic Difference Set (CDS) is the optimal setoff pilot locations when the signal is sparse on the unitary Discrete Fourier Transform (DFT) matrix by minimizing the mutual coherence of the measurement matrix. Based on this, an efficient pilot insertion scheme is introduced in cases where Cyclic Different Set does not exist. Simulation results in the paper show that the channel estimation algorithm, with the new pilot placement scheme, which offers a better trade-off between the performances in terms of Bit Error Rate (BER), Mean Squared Error (MSE) and the complexity, when compared to previous estimation algorithms.
Keywords: Compressed Sensing, Cyclic Difference Set, Sparse Channel Estimation, Sparsity Adaptive Matching Pursuit
Subscribe now for latest articles and news.