Publication Type:

Conference Paper

Source:

2012 International Conference on Computing, Communication and Applications, IEEE, Dindigul, Tamilnadu (2012)

ISBN:

9781467302708

Accession Number:

12655243

URL:

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6179232&tag=1

Keywords:

accuracy, blind estimation techniques, Channel estimation, channel vector, Computational complexity, conventional pilot-based techniques, Cyclic Prefix, cyclic prefix assisted sparse channel estimation, Estimation, Least square estimation, Least squares approximations, MIMO-OFDM, most significant taps, OFDM modulation, OFDM systems, PAPR, Peak to average power ratio, sparse channel estimation, sparse systems, Vectors

Abstract:

In this paper an efficient algorithm is presented for the estimation of a channel modelled as sparse for an OFDM system. Conventional Pilot-Based techniques and blind estimation techniques require a large number of pilot tones and complex mathematical computations respectively to estimate the channel vector. This drawback is particularly pronounced in sparse systems where the effective channel vector has a very few number of taps. The proposed method uses a modification made to the Cyclic Prefix to detect the position of the most significant taps (MST) for a sparse channel. Least Square estimation method is then used to effectively estimate the channel vector. Prior knowledge of the most significant tap positions obtained from the cyclic prefix ensures spectral and computational efficiencies.

Cite this Research Publication

P. Sudheesh, Jayakumar, A., Siddharth, R., Srikanth, M. S., Bhaskar, N. H., V, S., and Sudhakar, C. K., “Cyclic prefix assisted sparse channel estimation for OFDM systems”, in 2012 International Conference on Computing, Communication and Applications, Dindigul, Tamilnadu, 2012.