Wireless Cellular Networks

When aiming for achieving high spectral efficiency in wireless cellular networks, cochannel interference (CCI) becomes the dominant performancelimiting factor. This article provides a survey of CCI mitigation techniques, where both active and passive approaches are discussed in the context of both open- and closed-loop designs.More explicitly, we considered both the family of flexible frequency-reuse (FFR)-aided and dynamic channel allocation (DCA)-aided interference avoidance techniques as well as smart antenna-aided interference mitigation techniques, which may be classified as active approach

Sparse Signal Processing Concepts for Efficient 5G System Design

As it becomes increasingly apparent that 4G will not be able to meet the emerging demands of future mobile communication systems, the question what could make up a 5G system, what are the crucial challenges and what are the key drivers is part of intensive, ongoing discussions. Partly due to the advent of compressive sensing, methods that can optimally exploit sparsity in signals have received tremendous attention in recent years. In this paper we will describe a variety of scenarios in which signal sparsity arises naturally in 5G wireless systems. Signal sparsity and the associated rich collection of tools and algorithms will thus be a viable source for innovation in 5G wireless system design. We will discribe applications of this sparse signal processing paradigm in MIMO random access, cloud radio access networks, compressive channel-source network coding, and embedded security. We will also emphasize important open problem that may arise in 5G system design, for which sparsity will potentially play a key role in their solution.Comment: 18 pages, 5 figures, accepted for publication in IEEE Acces

Achieving "Massive MIMO" Spectral Efficiency with a Not-so-Large Number of Antennas

The main focus and contribution of this paper is a novel network-MIMO TDD architecture that achieves spectral efficiencies comparable with "Massive MIMO", with one order of magnitude fewer antennas per active user per cell. The proposed architecture is based on a family of network-MIMO schemes defined by small clusters of cooperating base stations, zero-forcing multiuser MIMO precoding with suitable inter-cluster interference constraints, uplink pilot signals reuse across cells, and frequency reuse. The key idea consists of partitioning the users population into geographically determined "bins", such that all users in the same bin are statistically equivalent, and use the optimal network-MIMO architecture in the family for each bin. A scheduler takes care of serving the different bins on the time-frequency slots, in order to maximize a desired network utility function that captures some desired notion of fairness. This results in a mixed-mode network-MIMO architecture, where different schemes, each of which is optimized for the served user bin, are multiplexed in time-frequency. In order to carry out the performance analysis and the optimization of the proposed architecture in a clean and computationally efficient way, we consider the large-system regime where the number of users, the number of antennas, and the channel coherence block length go to infinity with fixed ratios. The performance predicted by the large-system asymptotic analysis matches very well the finite-dimensional simulations. Overall, the system spectral efficiency obtained by the proposed architecture is similar to that achieved by "Massive MIMO", with a 10-fold reduction in the number of antennas at the base stations (roughly, from 500 to 50 antennas).Comment: Full version with appendice (proofs of theorems). A shortened version without appendice was submitted to IEEE Trans. on Wireless Commun. Appendix B was revised after submissio

Resource allocation and feedback in wireless multiuser networks

This thesis focuses on the design of algorithms for resource allocation and feedback in wireless multiuser and heterogeneous networks. In particular, three key design challenges expected to have a major impact on future wireless networks are considered: cross-layer scheduling; structured quantization codebook design for MU-MIMO networks with limited feedback; and resource allocation to provide physical layer security. The first design challenge is cross-layer scheduling, where policies are proposed for two network architectures: user scheduling in single-cell multiuser networks aided by a relay; and base station (BS) scheduling in CoMP. These scheduling policies are then analyzed to guarantee satisfaction of three performance metrics: SEP; packet delay; and packet loss probability (PLP) due to buffer overflow. The concept of the τ-achievable PLP region is also introduced to explicitly describe the tradeoff in PLP between different users. The second design challenge is structured quantization codebook design in wireless networks with limited feedback, for both MU-MIMO and CoMP. In the MU-MIMO network, two codebook constructions are proposed, which are based on structured transformations of a base codebook. In the CoMP network, a low-complexity construction is proposed to solve the problem of variable codebook dimensions due to changes in the number of coordinated BSs. The proposed construction is shown to have comparable performance with the standard approach based on a random search, while only requiring linear instead of exponential complexity. The final design challenge is resource allocation for physical layer security in MU-MIMO. To guarantee physical layer security, the achievable secrecy sum-rate is explicitly derived for the regularized channel inversion (RCI) precoder. To improve performance, power allocation and precoder design are jointly optimized using a new algorithm based on convex optimization techniques

Resource allocation and feedback in wireless multiuser networks

This thesis focuses on the design of algorithms for resource allocation and feedback in wireless multiuser and heterogeneous networks. In particular, three key design challenges expected to have a major impact on future wireless networks are considered: cross-layer scheduling; structured quantization codebook design for MU-MIMO networks with limited feedback; and resource allocation to provide physical layer security. The first design challenge is cross-layer scheduling, where policies are proposed for two network architectures: user scheduling in single-cell multiuser networks aided by a relay; and base station (BS) scheduling in CoMP. These scheduling policies are then analyzed to guarantee satisfaction of three performance metrics: SEP; packet delay; and packet loss probability (PLP) due to buffer overflow. The concept of the τ-achievable PLP region is also introduced to explicitly describe the tradeoff in PLP between different users. The second design challenge is structured quantization codebook design in wireless networks with limited feedback, for both MU-MIMO and CoMP. In the MU-MIMO network, two codebook constructions are proposed, which are based on structured transformations of a base codebook. In the CoMP network, a low-complexity construction is proposed to solve the problem of variable codebook dimensions due to changes in the number of coordinated BSs. The proposed construction is shown to have comparable performance with the standard approach based on a random search, while only requiring linear instead of exponential complexity. The final design challenge is resource allocation for physical layer security in MU-MIMO. To guarantee physical layer security, the achievable secrecy sum-rate is explicitly derived for the regularized channel inversion (RCI) precoder. To improve performance, power allocation and precoder design are jointly optimized using a new algorithm based on convex optimization techniques