IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v79y2022i2d10.1007_s11235-021-00856-0.html
   My bibliography  Save this article

Semi-blind channel estimation based on modified CMA and unitary scrambling for massive MIMO systems

Author

Listed:
  • Noura Sellami

    (University of Sfax)

  • Mohamed Siala

    (University of Carthage)

Abstract

Pilot contamination is one of the main impairments in multi-cell massive Multiple-Input Multiple-Output systems. In order to improve the channel estimation in this context, we propose to use a semi-blind channel estimator based on the constant modulus algorithm (CMA). We consider an enhanced version of the CMA namely the Modified CMA which modifies the cost function of the CMA algorithm to the sum of cost functions for real and imaginary parts. Due to pilot contamination, the channel estimator may estimate the channel of a contaminating user instead of that of the user of interest (the user for which the Base Station wants to estimate the channel and then the data). To avoid this, we propose to scramble the users sequences before transmission. We consider different methods to perform unitary scrambling based on rotating the transmitted symbols (one Dimensional (1-D) scrambling) and using unitary matrices (two-Dimensional (2-D) scrambling). At the base station, the received sequence of the user of interest is descrambled leading to a better convergence of the channel estimator. We also consider the case where the Automatic Repeat reQuest protocol is used. In this case, using scrambling leads to a significant gain in terms of BLock Error Rate due to the change of the contaminating users data from one transmission to another induced by scrambling.

Suggested Citation

  • Noura Sellami & Mohamed Siala, 2022. "Semi-blind channel estimation based on modified CMA and unitary scrambling for massive MIMO systems," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 79(2), pages 249-259, February.
  • Handle: RePEc:spr:telsys:v:79:y:2022:i:2:d:10.1007_s11235-021-00856-0
    DOI: 10.1007/s11235-021-00856-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-021-00856-0
    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-021-00856-0?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:79:y:2022:i:2:d:10.1007_s11235-021-00856-0. 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.