• DocumentCode
    2968096
  • Title

    Low-complexity H-infinity channel estimator for MIMO-OFDM systems

  • Author

    Xu, Peng ; Wang, Jinkuan ; Qi, Feng

  • Author_Institution
    EOSA, Univ. of Northeastern, Qinhuangdao, China
  • fYear
    2011
  • fDate
    23-25 Feb. 2011
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    Although maximum a posteriori probability (MAP) channel estimator has an optimal performance for MIMO-OFDM systems, its high complexity could be in the order of O(K3), where K is the number of subcarriers. So, in this paper, we introduce an H-infinity estimator which has good performance, but with much less complexity. Next, lots of matrices inversions and multiplications are reduced by the iterative expectation maximization (EM) algorithm. It is shown that the proposed EM-based H-infinity estimator has obviously improvement over optimal least square (LS) estimator with good convergence and the H-infinity estimator has almost the same performance as optimal MAP estimator with much less complexity.
  • Keywords
    MIMO communication; OFDM modulation; channel estimation; expectation-maximisation algorithm; least squares approximations; EM algorithm; LS estimator; MAP; MIMO-OFDM system; iterative expectation maximization algorithm; low-complexity H-infinity channel estimator; maximum a posteriori probability; optimal least square estimator; Channel estimation; Complexity theory; H infinity control; MIMO; OFDM; Receiving antennas; Wireless communication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless and Pervasive Computing (ISWPC), 2011 6th International Symposium on
  • Conference_Location
    Hong Kong
  • Print_ISBN
    978-1-4244-9868-0
  • Electronic_ISBN
    978-1-4244-9867-3
  • Type

    conf

  • DOI
    10.1109/ISWPC.2011.5751313
  • Filename
    5751313