IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v68y2018i3d10.1007_s11235-017-0410-4.html
   My bibliography  Save this article

Robust blind channel estimation algorithm for linear STBC systems using fourth order cumulant matrices

Author

Listed:
  • Zaid Albataineh

    (Yarmouk University)

Abstract

A novel blind channel estimation algorithm, based on fourth-order cumulant matrices, is proposed and applied to linear Space–Time Block Coded (STBC) for Multiple Input Multiple Output systems. Contrary to subspace and Second-Order Statistics (SOS) methods, the presented approach estimates the channel matrix without any modification of the transmitter. It takes advantage of the statistical independence of the signals in front of the space–time encoding. In this paper, the presented algorithm estimates the channel matrix by minimizing a cost function based on the higher cumulant matrices after Zero-Forcing equalization to mitigate the computational complexity and improve the performance. We employ the proposed method to the STBC systems including Spatial Multiplexing, Orthogonal, quasi-Orthogonal and Non-Orthogonal STBC systems. Symbol error rate and Normalized Mean Square Error simulations of the proposed algorithm are shown for a different number of users, signal to noise ratios and different number of symbols per user in comparison with subspace and Second-Order Statistics (SOS) methods. The results show that the presented method performs well and outperforms other methods in estimating the channel matrix from the received data. Moreover, the proposed method presents high convergence speed in estimating the channel matrix.

Suggested Citation

  • Zaid Albataineh, 2018. "Robust blind channel estimation algorithm for linear STBC systems using fourth order cumulant matrices," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 68(3), pages 573-582, July.
  • Handle: RePEc:spr:telsys:v:68:y:2018:i:3:d:10.1007_s11235-017-0410-4
    DOI: 10.1007/s11235-017-0410-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-017-0410-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11235-017-0410-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:68:y:2018:i:3:d:10.1007_s11235-017-0410-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.