TY - GEN
T1 - Blind channel estimation in OFDM systems by relying on the Gaussian assumption of the input
AU - Al-Naffouri, T. Y.
AU - Quadeer, A. A.
PY - 2009
Y1 - 2009
N2 - In an OFDM system, the receiver requires an estimate of the channel to recover the transmitted data. Most channel estimation methods rely on some form of training which reduces the useful data rate. In this paper, we introduce an algorithm that blindly estimates the channel by maximizing the log likelihood ofthe channel given the output data. Finding the likelihood function of a linear system can be very difficult. However, in the OFDM case, central limit arguments can be used to argue that the time-domain input is Gaussian. This together with the Gaussian assumption on the noise makes the output data Gaussian. The output likelihood function can then be maximized to obtain the maximum likelihood (ML) estimate ofthe channel. Unfortunately, this optimization problem is not convex and thus finding the global maximum is challenging. In this paper, we propose two methods to find the global maximum of the ML objective function. One is the blind Genetic algorithm and the other is the semi-blind Steepest descent method. The performance ofthe proposed algorithms is demonstrated by computer simulations.
AB - In an OFDM system, the receiver requires an estimate of the channel to recover the transmitted data. Most channel estimation methods rely on some form of training which reduces the useful data rate. In this paper, we introduce an algorithm that blindly estimates the channel by maximizing the log likelihood ofthe channel given the output data. Finding the likelihood function of a linear system can be very difficult. However, in the OFDM case, central limit arguments can be used to argue that the time-domain input is Gaussian. This together with the Gaussian assumption on the noise makes the output data Gaussian. The output likelihood function can then be maximized to obtain the maximum likelihood (ML) estimate ofthe channel. Unfortunately, this optimization problem is not convex and thus finding the global maximum is challenging. In this paper, we propose two methods to find the global maximum of the ML objective function. One is the blind Genetic algorithm and the other is the semi-blind Steepest descent method. The performance ofthe proposed algorithms is demonstrated by computer simulations.
KW - Blind channel estimation
KW - Gaussian assumption on data
KW - Maximum likelihood estimation
KW - Semi-blind channel estimation
UR - http://www.scopus.com/inward/record.url?scp=77749330941&partnerID=8YFLogxK
U2 - 10.1109/ISSPIT.2009.5407520
DO - 10.1109/ISSPIT.2009.5407520
M3 - Conference contribution
AN - SCOPUS:77749330941
SN - 9781424459506
T3 - IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2009
SP - 201
EP - 206
BT - IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2009
T2 - 9th IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2009
Y2 - 14 December 2009 through 16 December 2009
ER -