Structured compressive sensing-based spatio-temporal joint channel estimation for FDD massive MIMO

Massive MIMO is a promising technique for future 5G communications due to its high spectrum and energy efficiency. To realize its potential performance gain, accurate channel estimation is essential. However, due to massive number of antennas at the base station (BS), the pilot overhead required by conventional channel estimation schemes will be unaffordable, especially for frequency division duplex (FDD) massive MIMO. To overcome this problem, we propose a structured compressive sensing (SCS)-based spatio-temporal joint channel estimation scheme to reduce the required pilot overhead, whereby the spatio-temporal common sparsity of delay-domain MIMO channels is leveraged. Particularly, we first propose the nonorthogonal pilots at the BS under the framework of CS theory to reduce the required pilot overhead. Then, an adaptive structured subspace pursuit (ASSP) algorithm at the user is proposed to jointly estimate channels associated with multiple OFDM symbols from the limited number of pilots, whereby the spatio-temporal common sparsity of MIMO channels is exploited to improve the channel estimation accuracy. Moreover, by exploiting the temporal channel correlation, we propose a space-time adaptive pilot scheme to further reduce the pilot overhead. Additionally, we discuss the proposed channel estimation scheme in multicell scenario. Simulation results demonstrate that the proposed scheme can accurately estimate channels with the reduced pilot overhead, and it is capable of approaching the optimal oracle least squares estimator

Compressive Sensing-Based Grant-Free Massive Access for 6G Massive Communication

The advent of the sixth-generation (6G) of wireless communications has given rise to the necessity to connect vast quantities of heterogeneous wireless devices, which requires advanced system capabilities far beyond existing network architectures. In particular, such massive communication has been recognized as a prime driver that can empower the 6G vision of future ubiquitous connectivity, supporting Internet of Human-Machine-Things for which massive access is critical. This paper surveys the most recent advances toward massive access in both academic and industry communities, focusing primarily on the promising compressive sensing-based grant-free massive access paradigm. We first specify the limitations of existing random access schemes and reveal that the practical implementation of massive communication relies on a dramatically different random access paradigm from the current ones mainly designed for human-centric communications. Then, a compressive sensing-based grant-free massive access roadmap is presented, where the evolutions from single-antenna to large-scale antenna array-based base stations, from single-station to cooperative massive multiple-input multiple-output systems, and from unsourced to sourced random access scenarios are detailed. Finally, we discuss the key challenges and open issues to shed light on the potential future research directions of grant-free massive access.Comment: Accepted by IEEE IoT Journa

SVM-Based Channel Estimation and Data Detection for One-Bit Massive MIMO systems

The use of low-resolution Analog-to-Digital Converters (ADCs) is a practical solution for reducing cost and power consumption for massive Multiple-Input-Multiple-Output (MIMO) systems. However, the severe nonlinearity of low-resolution ADCs causes significant distortions in the received signals and makes the channel estimation and data detection tasks much more challenging. In this paper, we show how Support Vector Machine (SVM), a well-known supervised-learning technique in machine learning, can be exploited to provide efficient and robust channel estimation and data detection in massive MIMO systems with one-bit ADCs. First, the problem of channel estimation for uncorrelated channels is formulated as a conventional SVM problem. The objective function of this SVM problem is then modified for estimating spatially correlated channels. Next, a two-stage detection algorithm is proposed where SVM is further exploited in the first stage. The performance of the proposed data detection method is very close to that of Maximum-Likelihood (ML) data detection when the channel is perfectly known. We also propose an SVM-based joint Channel Estimation and Data Detection (CE-DD) method, which makes use of both the to-be-decoded data vectors and the pilot data vectors to improve the estimation and detection performance. Finally, an extension of the proposed methods to OFDM systems with frequency-selective fading channels is presented. Simulation results show that the proposed methods are efficient and robust, and also outperform existing ones

INTERFERENCE MANAGEMENT IN LTE SYSTEM AND BEYOUND

The key challenges to high throughput in cellular wireless communication system are interference, mobility and bandwidth limitation. Mobility has never been a problem until recently, bandwidth has been constantly improved upon through the evolutions in cellular wireless communication system but interference has been a constant limitation to any improvement that may have resulted from such evolution. The fundamental challenge to a system designer or a researcher is how to achieve high data rate in motion (high speed) in a cellular system that is intrinsically interference-limited. Multi-antenna is the solution to data on the move and the capacity of multi-antenna system has been demonstrated to increase proportionally with increase in the number of antennas at both transmitter and receiver for point-to-point communications and multi-user environment. However, the capacity gain in both uplink and downlink is limited in a multi-user environment like cellular system by interference, the number of antennas at the base station, complexity and space constraint particularly for a mobile terminal. This challenge in the downlink provided the motivation to investigate successive interference cancellation (SIC) as an interference management tool LTE system and beyond. The Simulation revealed that ordered successive interference (OSIC) out performs non-ordered successive interference cancellation (NSIC) and the additional complexity is justified based on the associated gain in BER performance of OSIC. The major drawback of OSIC is that it is not efficient in network environment employing power control or power allocation. Additional interference management techniques will be required to fully manage the interference.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format

Channel Estimation in Multi-user Massive MIMO Systems by Expectation Propagation based Algorithms

Massive multiple input multiple output (MIMO) technology uses large antenna arrays with tens or hundreds of antennas at the base station (BS) to achieve high spectral efficiency, high diversity, and high capacity. These benefits, however, rely on obtaining accurate channel state information (CSI) at the receiver for both uplink and downlink channels. Traditionally, pilot sequences are transmitted and used at the receiver to estimate the CSI. Since the length of the pilot sequences scale with the number of transmit antennas, for massive MIMO systems downlink channel estimation requires long pilot sequences resulting in reduced spectral efficiency and the so-called pilot contamination due to sharing of the pilots in adjacent cells. In this dissertation we first review the problem of channel estimation in massive MIMO systems. Next, we study the problem of semi-blind channel estimation in the uplink in the case of spatially correlated time-varying channels. The proposed method uses the transmitted data symbols as virtual pilots to enhance channel estimation. An expectation propagation (EP) algorithm is developed to iteratively approximate the joint a posterior distribution of the unknown channel matrix and the transmitted data symbols with a distribution from an exponential family. The distribution is then used for direct estimation of the channel matrix and detection of the data symbols. A modified version of Kalman filtering algorithm referred to as KF-M emerges from our EP derivation and it is used to initialize our algorithm. Simulation results demonstrate that channel estimation error and the symbol error rate of the proposed algorithm improve with the increase in the number of BS antennas or the number of data symbols in the transmitted frame. Moreover, the proposed algorithms can mitigate the effects of pilot contamination as well as time-variations of the channel. Next, we study the problem of downlink channel estimation in multi-user massive MIMO systems. Our approach is based on Bayesian compressive sensing in which the clustered sparse structure of the channel in the angular domain is exploited to reduce the pilot overhead. To capture the clustered structure, we employ a conditionally independent identically distributed Bernoulli-Gaussian prior on the sparse vector representing the channel, and a Markov prior on its support vector. An EP algorithm is developed to approximate the intractable joint distribution on the sparse vector and its support with a distribution from an exponential family. This distribution is then used for direct estimation of the channel. The EP algorithm requires the model parameters which are unknown. We estimate these parameters using the expectation maximization (EM) algorithm. Simulation results show that the proposed combination of EM and EP referred to as EM-EP algorithm outperforms several recently-proposed algorithms in the literature