IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i12p676024.html
   My bibliography  Save this article

Channel Estimation for Relay-Based M2M Two-Way Communications Using Expectation-Maximization

Author

Listed:
  • Xiaoyan Xu
  • Jianjun Wu
  • Chen Chen
  • Wenyang Guan
  • Haige Xiang

Abstract

The growing popularity of machine-to-machine (M2M) communications in wireless networks is driving the need to update the corresponding receiver technology based on the characteristics of M2M. In this paper, an expectation-maximization-based maximum likelihood cascaded channel estimation method is developed for relay-based M2M two-way communications. As the closed-form solution of maximum likelihood channel estimation does not exist, and the superimposed signal structure at the receiver is conducive to the expectation-maximization application, the expectation-maximization algorithm is utilized to provide the maximum likelihood solution in the presence of unobserved data through stable iterations. Even in the absence of the training sequence, the cascaded channel estimates are obtained through the expectation-maximization iterations. The Bayesian Cramér-Rao lower bounds are derived under random parameters for the channel estimation, and the simulation demonstrates the validity of the proposed studies.

Suggested Citation

  • Xiaoyan Xu & Jianjun Wu & Chen Chen & Wenyang Guan & Haige Xiang, 2013. "Channel Estimation for Relay-Based M2M Two-Way Communications Using Expectation-Maximization," International Journal of Distributed Sensor Networks, , vol. 9(12), pages 676024-6760, December.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:12:p:676024
    DOI: 10.1155/2013/676024
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/676024
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/676024?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:sae:intdis:v:9:y:2013:i:12:p:676024. 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: SAGE Publications (email available below). General contact details of provider: .

    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.