A blind channel estimation algorithm for space-time coded MC-CDMA receivers

Authors:
César A. Medina;Tiago T. V. Vinhoza;Raimundo Sampaio-Neto
Affiliations:
Centro de Estudos em Telecomunicações, Pontifícia Universidade do Rio de Janeiro, Rio de Janeiro, RJ, Brazil;Centro de Estudos em Telecomunicações, Pontifícia Universidade do Rio de Janeiro, Rio de Janeiro, RJ, Brazil;Centro de Estudos em Telecomunicações, Pontifícia Universidade do Rio de Janeiro, Rio de Janeiro, RJ, Brazil
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 8
Cited 0

Matrix analysis and applied linear algebra

Matrix analysis and applied linear algebra
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Wireless Communication Systems: Advanced Techniques for Signal Reception

Wireless Communication Systems: Advanced Techniques for Signal Reception
A fast least-squares algorithm for linearly constrained adaptivefiltering

IEEE Transactions on Signal Processing
Adaptive power techniques for blind channel estimation in CDMA systems

IEEE Transactions on Signal Processing
Capon multiuser receiver for CDMA systems with space-time coding

IEEE Transactions on Signal Processing
A road to future broadband wireless access: MIMO-OFDM-Based air interface

IEEE Communications Magazine
A simple transmit diversity technique for wireless communications

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we proposed a linearly constrained minimum variance receiver for a space-time coded multicarrier (MC) CDMA system in frequency selective fading channels. It is shown that in the proposed receiver the channel can be blindly estimated as the eigenvector that corresponds to the maximum eigenvalue of an autocorrelation matrix, and then, efficient algorithms for subspace tracking can be used. Computer simulations shows that the proposed channel estimation algorithm achieves performance comparable to traditional algorithms with less computational cost.