This paper investigates iterative channel estimation and symbol detection for spatial multiplexing multiple input multiple output (MIMO) systems with frequency flat block fading channels using the expectation-maximization (EM) algorithm. The maximum likelihood (ML) estimation of the MIMO channels via the EM algorithm requires the computation of the posterior mean and covariance of transmit symbol vectors which involve an exhaustive search of all possible symbol combinations and are computationally prohibitive for large systems. However, most of the symbol combinations contribute very little to the estimation. Therefore, we suggest that sequential Gaussian approximation (SGA) algorithm can be used to identify the M most significant symbol combinations and we can approximate the mean and covariance based on those symbol combinations. Simulation results are provided to illustrate the proposed algorithm. © 2006 IEEE.
|Translated title of the contribution||SGA based symbol detection and EM channel estimation for MIMO systems|
|Title of host publication||IEEE Vehicular Technology Conference|
|Number of pages||5|
|Publication status||Published - May 2006|
|Event||2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Melbourne, Australia|
Duration: 7 May 2006 → 10 Jul 2006
|Conference||2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring|
|Period||7/05/06 → 10/07/06|
Bibliographical notePublisher: Institute of Electrical and Electronics Engineers (IEEE)
Name and Venue of Conference: Vehicular Technology Conference 2006 (VTC 2006-Spring), Melbourne, Australia
Rose publication type: Conference contribution
Sponsorship: The authors would like to acknowledge the fruitful discussions with the researchers at Toshiba Research Europe Ltd (Telecommunications Research Laboratory, Bristol) and the support of its directors. The first author would like to thank Toshiba Research Europe Ltd (Telecommunications Research Laboratory, Bristol) for supporting his PHD study at University of Bristol
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.