Matrix analysis
An Introduction to Spread-Spectrum Communications
An Introduction to Spread-Spectrum Communications
The Decompositional Approach to Matrix Computation
Computing in Science and Engineering
Periodic sequences with optimal properties for channel estimation and fast start-up equalization
IBM Journal of Research and Development
International Journal of Wireless and Mobile Computing
Hi-index | 0.00 |
Least-square channel estimation techniques usually involve the large-dimensional matrix inversion, whose heavy computational complexity cannot be extendable for long channel filters. Maximum-Length Shift-Register (MLSR) sequences, or m-sequences, possess the well controlled second order cyclic statistics and have been used as the training sequences for least-square channel estimators. In this paper, we analyse the statistical characteristics of m-sequences and design a corresponding highly computationally-efficient channel estimation algorithm. Two crucial measures, namely mean-square error and computational complexity, are evaluated thereupon. It can be justified that our proposed algorithm can achieve both efficiency and satisfactory performance for communication channel estimation.