Please use this identifier to cite or link to this item: http://hdl.handle.net/11144/4219
Title: Implicit Pilots for an Efficient Channel Estimation in Simplified Massive MIMO Schemes with Precoding
Authors: Silva, Mário Marques da
Guerreiro, João
Dinis, Rui
Keywords: Massive MIMO
precoding
Channel Estimation
SC-FDE
5G
Implicit Pilots
mm-Wave
Issue Date: 2019
Abstract: This paper proposes a new channel estimation scheme based on implicit pilots, optimized for a simplified massive multiple input, multiple output (MIMO), implemented with precoding, combined with single-carrier with frequency-domain equalization (SC-FDE) modulations. We propose an iterative receiver that considers an iterative detection with interference cancellation and channel estimation. The channel estimates are usually obtained with the help of pilot symbols and/or training sequences multiplexed with data symbols. Since the required overheads in massive MIMO schemes can be too high, leading to spectral degradation, the use of superimposed pilots (i.e., pilots added to data) is an efficient alternative. Three different types of pre-processing algorithms are considered in this paper: Zero Forcing Transmitter (ZFT), Maximum Ratio Transmitter (MRT), and Equal Gain Transmitter (EGT). The main advantage MRT and EGT is that they do not require matrix inversions. Nevertheless, some level of interference is generated in the decoding process. Such interference is mitigated by employing an optimized iterative receiver. By employing the proposed implicit pilots, the performance of MRT and EGT are very close to the matched filter bound just after a few iterations, even when the number of transmit or receiver antennas is not much higher than the number of data streams.
Peer reviewed: yes
URI: http://hdl.handle.net/11144/4219
metadata.dc.identifier.doi: https://doi.org/10.1155/2019/5051963
Appears in Collections:DCT - Artigos/Papers



FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Currículo DeGóis 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.