A New Look at Cell-Free Massive MIMO: Making It Practical With Dynamic Cooperation

This paper takes a new look at Cell-free Massive MIMO (multiple-input multiple-output) through the lens of the dynamic cooperation cluster framework from the Network MIMO literature. The purpose is to identify and address scalability issues that appear in prior work. We provide distributed algorithms for initial access, pilot assignment, cluster formation, precoding, and combining that are scalable in the sense of being implementable with arbitrarily many users. Interestingly, the suggested precoding and combining outperform conjugate beamforming and matched filtering, respectively, while also being fully distributed.Comment: To appear at the 2019 IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE PIMRC 2019), 6 pages, 5 figure

Rateless Space-Time Block Codes for 5G Wireless Communication Systems

This chapter presents a rateless space-time block code (RSTBC) for massive multiple-input multiple-output (MIMO) wireless communication systems. We discuss the principles of rateless coding compared to the fixed-rate channel codes. A literature review of rateless codes (RCs) is also addressed. Furthermore, the chapter illustrates the basis of RSTBC deployments in massive MIMO transmissions over lossy wireless channels. In such channels, data may be lost or are not decodable at the receiver end due to a variety of factors such as channel losses or pilot contamination. Massive MIMO is a breakthrough wireless transmission technique proposed for future wireless standards due to its spectrum and energy efficiencies. We show that RSTBC guarantees the reliability of the system in such highly lossy channels. Moreover, pilot contamination (PC) constitutes a particularly significant impairment in reciprocity-based multi-cell systems. PC results from the non-orthogonality of the pilot sequences in different cells. In this chapter, RSTBC is also employed in the downlink transmission of a multi-cell massive MIMO system to mitigate the effects of signal-to-interference-and-noise ratio (SINR) degradation resulting from PC. We conclude that RSTBC can effectively mitigate such interference. Hence, RSTBC is a strong candidate for the upcoming 5G wireless communication systems

Scalable Cell-Free Massive MIMO Systems

Imagine a coverage area with many wireless access points that cooperate to jointly serve the users, instead of creating autonomous cells. Such a cell-free network operation can potentially resolve many of the interference issues that appear in current cellular networks. This ambition was previously called Network MIMO (multiple-input multiple-output) and has recently reappeared under the name Cell-Free Massive MIMO. The main challenge is to achieve the benefits of cell-free operation in a practically feasible way, with computational complexity and fronthaul requirements that are scalable to large networks with many users. We propose a new framework for scalable Cell-Free Massive MIMO systems by exploiting the dynamic cooperation cluster concept from the Network MIMO literature. We provide a novel algorithm for joint initial access, pilot assignment, and cluster formation that is proved to be scalable. Moreover, we adapt the standard channel estimation, precoding, and combining methods to become scalable. A new uplink and downlink duality is proved and used to heuristically design the precoding vectors on the basis of the combining vectors. Interestingly, the proposed scalable precoding and combining outperform conventional maximum ratio processing and also performs closely to the best unscalable alternatives.Comment: To appear in IEEE Transactions on Communications, 14 pages, 6 figure

Ultra-Reliable Short-Packet Communications: Fundamental Limits and Enabling Technologies

The paradigm shift from 4G to 5G communications, anticipated to enable ultra-reliable low-latency communications (URLLC), will enforce a radical change in the design of wireless communication systems. Unlike in 4G systems, where the main objective is to provide a large transmission rate, in URLLC, as implied by its name, the objective is to enable transmissions with low latency and, simultaneously, very high reliability. Since low latency implies the use of short data packets, the tension between blocklength and reliability is studied in URLLC.Several key enablers for URLLC communications have been designated in the literature. Of special importance are diversity-enabling technologies such as multiantenna systems and feedback protocols. Furthermore, it is not only important to introduce additional diversity by means of the above examples, one must also guarantee that thescarce number of channel uses are used in an optimal way. Therefore, it is imperative to develop design guidelines for how to enable reliable detection of incoming data, how to acquire channel-state information, and how to construct efficient short-packet channel codes. The development of such guidelines is at the heart of this thesis. This thesis focuses on the fundamental performance of URLLC-enabling technologies. Specifically, we provide converse (upper) bounds and achievability (lower) bounds on the maximum coding rate, based on finite-blocklength information theory, for systems that employ the key enablers outlined above. With focus on the wireless channel, modeled via a block-fading assumption, we are able to provide answers to questions like: howto optimally utilize spatial and frequency diversity, how far from optimal short-packet channel codes perform, how multiantenna systems should be designed to serve a given number of users, and how to design feedback schemes when the feedback link is noisy. In particular, this thesis is comprised out of four papers. In Paper A, we study the short-packet performance over the Rician block-fading channel. In particular, we present achievability bounds for pilot-assisted transmission with several different decoders that allow us to quantify the impact, on the achievable performance, of imposed pilots and mismatched decoding. Furthermore, we design short-packet channel codes that perform within 1 dB of our achievability bounds. Paper B studies multiuser massive multiple-input multiple-output systems with short packets. We provide an achievability bound on the average error probability over quasistatic spatially correlated Rayleigh-fading channels. The bound applies to arbitrary multiuser settings, pilot-assisted transmission, and mismatched decoding. This makes it suitable to assess the performance in the uplink/downlink for arbitrary linear signal processing. We show that several lessons learned from infinite-blocklength analyses carry over to the finite-blocklength regime. Furthermore, for the multicell setting with randomly placed users, pilot contamination should be avoided at all cost and minimum mean-squared error signal processing should be used to comply with the stringent requirements of URLLC.In Paper C, we consider sporadic transmissions where the task of the receiver is to both detect and decode an incoming packet. Two novel achievability bounds, and a novel converse bound are presented for joint detection-decoding strategies. It is shown that errors associated with detection deteriorates performance significantly for very short packet sizes. Numerical results also indicate that separate detection-decoding strategies are strictly suboptimal over block-fading channels.Finally, in Paper D, variable-length codes with noisy stop-feedback are studied via a novel achievability bound on the average service time and the average error probability. We use the bound to shed light on the resource allocation problem between the forward and the feedback channel. For URLLC applications, it is shown that enough resources must be assigned to the feedback link such that a NACK-to-ACK error becomes rarer than the target error probability. Furthermore, we illustrate that the variable-length stop-feedback scheme outperforms state-of-the-art fixed-length no-feedback bounds even when the stop-feedback bit is noisy

Energy and spectral efficiency tradeoff in wireless communication

In the wireless communication world, a significant number of new user equipments is connecting to the network each and every day, and day after day this amount is increasing with no known bounds. Diverse quality of service (QoS) along with better system throughput are the crying needs at present. With the advancement in the field of massive multiple-input multiple-output (MMIMO) and Internet-of-things (IoT), the QoS is provided smoothly with the limited spectrum by the wireless operator. Hundreds of antenna elements in the digital arrays are set up at the base station in order to provide the smooth coverage and the best throughput within these spectra. However, implementing hundreds of antenna elements with associated a huge number of RF chains for digital beamforming consumes too much energy. Energy efficiency optimization has become a requirement at the present stage of wireless infrastructure. Due to the conflicting nature between the energy efficiency and the spectral efficiency, it is hard to make a balance. This thesis investigates how to achieve a good tradeoff between the energy and the spectral efficiency with maximum throughput outcomes from MMIMO, with the help of existing topologies and a futuristic perspective. Although the signal noise power is less in massive MIMO than the conventional cellular system, it still needs to be decreased and at the same time, the average channel gain per user equipment must be increased. Fixed power requirement for control signaling and load-independent power of backhaul infrastructure must be cut at least by a factor two as well as the power amplifier efficiency has to increase by 10% than LTE networks. The minimum mean square error (MMSE) estimator can be a possible solution in terms of the energy and the spectral efficiency despite having computational complexity which can be solved with the aid of Moore’s law and it is proposed by the non-profit research organization IMEC, which has developed an online web tool for observing and predicting contemporary as well as futuristic cellular base station’s power consumption. It supports various types of base stations with a wide range of operating conditions. The multicell minimum mean square error (M-MMSE) scheme can perform better than other existing schemes and showcase satisfactory tradeoff with frequency reuse factor higher than 2, where regularized zero-forcing (RZF) and maximum ratio (MR) combining fall down their capabilities for performing. With the precipitous rising of IoT, the Narrowband Internet-of-things (NB-IoT) may play an efficient supportive role if we can collaborate it with MMIMO. With its low power, wide area topologies combining with MMIMO technologies can show better tradeoffs. Due to its narrow bandwidth, the signal noise power would be less compared to the existent wideband topologies, and the average channel gain of active user equipment would be higher too. Hence it will give a great impact in terms of the tradeoff between energy and the spectral efficiency which is addressed in this thesis

Energy and spectral efficiency tradeoff in wireless communication

In the wireless communication world, a significant number of new user equipments is connecting to the network each and every day, and day after day this amount is increasing with no known bounds. Diverse quality of service (QoS) along with better system throughput are the crying needs at present. With the advancement in the field of massive multiple-input multiple-output (MMIMO) and Internet-of-things (IoT), the QoS is provided smoothly with the limited spectrum by the wireless operator. Hundreds of antenna elements in the digital arrays are set up at the base station in order to provide the smooth coverage and the best throughput within these spectra. However, implementing hundreds of antenna elements with associated a huge number of RF chains for digital beamforming consumes too much energy. Energy efficiency optimization has become a requirement at the present stage of wireless infrastructure. Due to the conflicting nature between the energy efficiency and the spectral efficiency, it is hard to make a balance. This thesis investigates how to achieve a good tradeoff between the energy and the spectral efficiency with maximum throughput outcomes from MMIMO, with the help of existing topologies and a futuristic perspective. Although the signal noise power is less in massive MIMO than the conventional cellular system, it still needs to be decreased and at the same time, the average channel gain per user equipment must be increased. Fixed power requirement for control signaling and load-independent power of backhaul infrastructure must be cut at least by a factor two as well as the power amplifier efficiency has to increase by 10% than LTE networks. The minimum mean square error (MMSE) estimator can be a possible solution in terms of the energy and the spectral efficiency despite having computational complexity which can be solved with the aid of Moore’s law and it is proposed by the non-profit research organization IMEC, which has developed an online web tool for observing and predicting contemporary as well as futuristic cellular base station’s power consumption. It supports various types of base stations with a wide range of operating conditions. The multicell minimum mean square error (M-MMSE) scheme can perform better than other existing schemes and showcase satisfactory tradeoff with frequency reuse factor higher than 2, where regularized zero-forcing (RZF) and maximum ratio (MR) combining fall down their capabilities for performing. With the precipitous rising of IoT, the Narrowband Internet-of-things (NB-IoT) may play an efficient supportive role if we can collaborate it with MMIMO. With its low power, wide area topologies combining with MMIMO technologies can show better tradeoffs. Due to its narrow bandwidth, the signal noise power would be less compared to the existent wideband topologies, and the average channel gain of active user equipment would be higher too. Hence it will give a great impact in terms of the tradeoff between energy and the spectral efficiency which is addressed in this thesis

A Tutorial on Nonorthogonal Multiple Access for 5G and Beyond

Today's wireless networks allocate radio resources to users based on the orthogonal multiple access (OMA) principle. However, as the number of users increases, OMA based approaches may not meet the stringent emerging requirements including very high spectral efficiency, very low latency, and massive device connectivity. Nonorthogonal multiple access (NOMA) principle emerges as a solution to improve the spectral efficiency while allowing some degree of multiple access interference at receivers. In this tutorial style paper, we target providing a unified model for NOMA, including uplink and downlink transmissions, along with the extensions tomultiple inputmultiple output and cooperative communication scenarios. Through numerical examples, we compare the performances of OMA and NOMA networks. Implementation aspects and open issues are also detailed.Comment: 25 pages, 10 figure

Non-Coherent Multiuser Massive MIMO-OFDM with Differential Modulation

Proceedings of: ICC 2019 - 2019 IEEE International Conference on Communications (ICC), 20-24 may, 2019, Shanghai.Massive multiple-input multiple-output (MIMO) and orthogonal frequency division multiplexing (OFDM) are wireless technologies adopted by the Fifth Generation (5G) of mobile communications. The channel estimation and pre/postequalization processes in coherent detection schemes for massive MIMO-OFDM are a challenging task, where several issues are faced, such as pilot contamination, channel calibration, matrix inversions, among others. Moreover, they increase the energy consumption and latency of the system. A non-coherent technique relying on DPSK constellation has been proposed for a singlecarrier scheme, assuming flat-fading. In our paper, we extend this technique to be combined with OFDM, where the channel is doubly dispersive (time and frequency). We will show that the differential modulation can be performed either in the time or frequency domain, where the latter suffers from an additional phase rotation, which should be estimated and compensated. We provide the analytical expression of the signal-to-interferenceand-noise ratio (SINR) for both cases, and we show numerical results in order to verify our analysis.This work has been funded by project TERESA-ADA (TEC2017-90093-C3-2-R) (MINECO/AEI/FEDER, UE)

Energy Efficiency Optimization of Massive MIMO Systems Based on the Particle Swarm Optimization Algorithm

As one of the key technologies in the fifth generation of mobile communications, massive multi-input multi-output (MIMO) can improve system throughput and transmission reliability. However, if all antennas are used to transmit data, the same number of radio-frequency chains is required, which not only increases the cost of system but also reduces the energy efficiency (EE). To solve these problems, in this paper, we propose an EE optimization based on the particle swarm optimization (PSO) algorithm. First, we consider the base station (BS) antennas and terminal users, and analyze their impact on EE in the uplink and downlink of a single-cell multiuser massive MIMO system. Second, a dynamic power consumption model is used under zero-forcing processing, and it obtains the expression of EE that is used as the fitness function of the PSO algorithm under perfect and imperfect channel state information (CSI) in single-cell scenarios and imperfect CSI in multicell scenarios. Finally, the optimal EE value is obtained by updating the global optimal positions of the particles. The simulation results show that compared with the traditional iterative algorithm and artificial bee colony algorithm, the proposed algorithm not only possesses the lowest complexity but also obtains the highest optimal value of EE under the single-cell perfect CSI scenario. In the single-cell and multicell scenarios with imperfect CSI, the proposed algorithm is capable of obtaining the same or slightly lower optimal EE value than that of the traditional iterative algorithm, but the running time is at most only 1/12 of that imposed by the iterative algorithm