IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v83y2023i1d10.1007_s11235-023-01008-2.html
   My bibliography  Save this article

Superposition based downlink channel estimation in large-scale MIMO systems

Author

Listed:
  • Hassan Ghanooni

    (K. N. Toosi University of Technology)

  • Mohammad Javad Azizipour

    (University of Mazandaran)

Abstract

Due to employing different frequencies in the uplink and downlink path of frequency-division duplex (FDD) systems, the required training signals for estimating downlink channel would be prohibitively large. Therefore, an effective solution is essential to cope with the pilot and channel state information feedback overhead. In this paper, we focus on the superposition method, which combines the data and pilot signal at the same time and/or frequency domain that has not yet been seriously studied for FDD systems. By defining a new orthogonal pilot matrix and deriving the least squares and linear minimum mean square error formulations of our superposition signaling, we prove that the conventional superposition definition can alleviate the pilot overhead problem. Furthermore, we compute a closed form equation for the mean square error of both estimators, which obviously show the impact of the number of antennas and training signals on the estimation error. The theoretical and Monte-Carlo simulation results indicate that the proposed scheme is capable of estimating the channel efficiently, while herein, we do not encounter the pilot overhead problem in the downlink path of FDD large-scale MIMO systems.

Suggested Citation

  • Hassan Ghanooni & Mohammad Javad Azizipour, 2023. "Superposition based downlink channel estimation in large-scale MIMO systems," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 83(1), pages 79-89, May.
  • Handle: RePEc:spr:telsys:v:83:y:2023:i:1:d:10.1007_s11235-023-01008-2
    DOI: 10.1007/s11235-023-01008-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-023-01008-2
    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-023-01008-2?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:83:y:2023:i:1:d:10.1007_s11235-023-01008-2. 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.