Abstract

The acquisitionof channel state information at transmitter (CSIT) is crucial to attain the potential benefits of the frequency division duplexing (FDD) massive multiple-input multiple-output (MIMO) system. Traditionally, CSI estimation at receiver and feedback to transmitter are separately designed, failing to maximize the estimation accuracy while minimizing the complexity/overhead. In this work, we propose a novel computation and communication efficient CSIT acquisition scheme, by jointly designing downlink CSI estimation and uplink feedback, which is inspired by randomized matrix approximation techniques. In the process of CSI estimation, we represent a large channel matrix with three sub-matrices by exploiting its inherent low-rank characteristic, and then estimate these small matrices separately. Our new estimator significantly reduces the computation complexity in massive MIMO CSI acquisition, whilst attaining the high accuracy. The convergence as well as the error bound of our CSI estimator is derived theoretically. In the following CSI feedback process, only partial elements of sub-matrices are reported to transmitter without further compression, and finally the full CSI is recovered accurately. This novel CSI feedback scheme, relying on the estimated CSI with special structure, greatly reduces both the communication overhead. Numerical simulations are provided to valid our joint CSI estimation and feedback scheme, which would have great potential in massive MIMO communications.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.