Noncooperative Cellular Wireless with Unlimited Numbers of Base Station Antennas
TL;DR: A cellular base station serves a multiplicity of single-antenna terminals over the same time-frequency interval and a complete multi-cellular analysis yields a number of mathematically exact conclusions and points to a desirable direction towards which cellular wireless could evolve.
Abstract: A cellular base station serves a multiplicity of single-antenna terminals over the same time-frequency interval. Time-division duplex operation combined with reverse-link pilots enables the base station to estimate the reciprocal forward- and reverse-link channels. The conjugate-transpose of the channel estimates are used as a linear precoder and combiner respectively on the forward and reverse links. Propagation, unknown to both terminals and base station, comprises fast fading, log-normal shadow fading, and geometric attenuation. In the limit of an infinite number of antennas a complete multi-cellular analysis, which accounts for inter-cellular interference and the overhead and errors associated with channel-state information, yields a number of mathematically exact conclusions and points to a desirable direction towards which cellular wireless could evolve. In particular the effects of uncorrelated noise and fast fading vanish, throughput and the number of terminals are independent of the size of the cells, spectral efficiency is independent of bandwidth, and the required transmitted energy per bit vanishes. The only remaining impairment is inter-cellular interference caused by re-use of the pilot sequences in other cells (pilot contamination) which does not vanish with unlimited number of antennas.
Citations
More filters
Posted Content•
TL;DR: JSDM is proposed, an approach to multiuser MIMO downlink that exploits the structure of the correlation of the channel vectors in order to allow for a large number of antennas at the base station while requiring reduced-dimensional Channel State Information at the Transmitter (CSIT).
Abstract: We propose Joint Spatial Division and Multiplexing (JSDM), an approach to multiuser MIMO downlink that exploits the structure of the correlation of the channel vectors in order to allow for a large number of antennas at the base station while requiring reduced-dimensional Channel State Information at the Transmitter (CSIT). This allows for significant savings both in the downlink training and in the CSIT feedback from the user terminals to the base station, thus making the use of a large number of base station antennas potentially suitable also for Frequency Division Duplexing (FDD) systems, for which uplink/downlink channel reciprocity cannot be exploited. JSDM forms the multiuser MIMO downlink precoder by concatenating a pre-beamforming matrix, which depends only on the channel second-order statistics, with a classical multiuser precoder, based on the instantaneous knowledge of the resulting reduced dimensional effective channels. We prove a simple condition under which JSDM incurs no loss of optimality with respect to the full CSIT case. For linear uniformly spaced arrays, we show that such condition is closely approached when the number of antennas is large. For this case, we use Szego asymptotic theory of large Toeplitz matrices to design a DFT-based pre-beamforming scheme requiring only coarse information about the users angles of arrival and angular spread. Finally, we extend these ideas to the case of a two-dimensional base station antenna array, with 3-dimensional beamforming, including multiple beams in the elevation angle direction. We provide guidelines for the pre-beamforming optimization and calculate the system spectral efficiency under proportional fairness and maxmin fairness criteria, showing extremely attractive performance. Our numerical results are obtained via an asymptotic random matrix theory tool known as deterministic equivalent approximation.
78 citations
Cites background or methods from "Noncooperative Cellular Wireless wi..."
...Interestingly, related eigen-structure properties of the covariance matrices were independently derived in [19] for the purpose of eliminating the pilot contamination effect which limits the performance of TDD massive MIMO with the maximal-ratio single-user beamforming advocated in [9]....
[...]
...Also for the sake of simplicity and in line with massive MIMO system simplification (see for example [9], [10]) we allocate to all users the same fraction of the total transmit power P , such that the data vector covariance matrix is given by E[dd] = PS IS ....
[...]
...By using M K antennas at the BS with TDD, as proposed in [9] (see also the more refined performance analysis and system optimization in [10], [11]), is very attractive for TDD systems both in terms of achieved throughput and in terms of simplified downlink scheduling and signal processing at the BS....
[...]
TL;DR: This paper derives an explicit analytical sum-rate expression for generic channel covariance-based beamforming scheme and proposes a low-complexity joint statistical beamforming and user scheduling algorithm via greedy search, where the beamforming is based on the signal-to-leakage-and-noise-ratio (SLNR) for closed-form design and tractable analysis.
Abstract: Statistical beamforming is an important technique for multi-user massive MIMO downlink, since it depends on the downlink channel covariance only. In this paper, we first derive an explicit analytical sum-rate expression for generic channel covariance-based beamforming scheme. Then, a low-complexity joint statistical beamforming and user scheduling algorithm via greedy search is proposed, where the beamforming is based on the signal-to-leakage-and-noise-ratio (SLNR) for closed-form design and tractable analysis, while the user scheduling is based on the derived sum-rate expression. Further, with the help of large-scale asymptotic simplifications and the introduction of the interference user number parameter, a simple analytical sum-rate expression of the joint algorithm is derived for channels with flat power beam spectrum. The expression explicitly exhibits the sum-rate behavior with respect to different network parameters and captures the effect of sum-rate-based user scheduling. Finally, simulation results are provided to verify our analytical results and to show the advantage of the proposed joint design compared with existing schemes.
78 citations
Cites background from "Noncooperative Cellular Wireless wi..."
...For TDD, the downlink channel covariance can be obtained via uplink training and channel reciprocity [4]....
[...]
...MASSIVE MIMO is a key technology for the fifthgeneration (5G) wireless communication systems due to its channel-hardening effect and high potential in interference mitigation [2]–[4]....
[...]
TL;DR: In this paper, the authors considered the downlink of a massive multiuser (MU) multiple-input multiple-output (MIMO) system in which the base station (BS) is equipped with low-resolution digital-to-analog converters (DACs).
Abstract: We consider the downlink of a massive multiuser (MU) multiple-input multiple-output (MIMO) system in which the base station (BS) is equipped with low-resolution digital-to-analog converters (DACs). In contrast to most existing results, we assume that the system operates over a frequency-selective wideband channel and uses orthogonal frequency division multiplexing (OFDM) to simplify equalization at the user equipments (UEs). Furthermore, we consider the practically relevant case of oversampling DACs. We theoretically analyze the uncoded bit error rate (BER) performance with linear precoders (e.g., zero forcing) and quadrature phase-shift keying using Bussgang’s theorem. We also develop a lower bound on the information-theoretic sum-rate throughput achievable with Gaussian inputs, which can be evaluated in closed form for the case of 1-bit DACs. For the case of multi-bit DACs, we derive approximate, yet accurate, expressions for the distortion caused by low-precision DACs, which can be used to establish the lower bounds on the corresponding sum-rate throughput. Our results demonstrate that, for a massive MU-MIMO-OFDM system with a 128-antenna BS serving 16 UEs, only 3–4 DAC bits are required to achieve an uncoded BER of ${10}^{-{4}}$ with a negligible performance loss compared to the infinite-resolution case at the cost of additional out-of-band emissions. Furthermore, our results highlight the importance of considering the inherent spatial and temporal correlations caused by low-precision DACs.
78 citations
TL;DR: This paper focuses on the problem of two-dimensional DOA estimation of incoherently distributed sources in massive MIMO systems using uniform rectangular arrays (URAs) and avoids spectral search and reduces the dimensions in matrix operations, thus, it is more computationally attractive than the existing techniques.
Abstract: In massive multiple-input multiple-output (MIMO) systems, accurate direction-of-arrival (DOA) estimation is critical for the transmitters to conduct downlink precoding. In this paper, we focus on the problem of two-dimensional DOA estimation of incoherently distributed sources in massive MIMO systems using uniform rectangular arrays (URAs). First, with the generalized array manifold, we obtain the beamspace array manifold by performing beamspace transformation on the observed vector of the URA, and establish one beamspace shift invariance structure via appropriate beamforming matrix design and array manifold selection. Second, from the beamspace array manifold, we extract two array manifolds, and derive the other beamspace shift invariance structure. Final, the total least squares approach is used to estimate the nominal azimuth and elevation DOAs. With the DOA estimates, the corresponding angular spreads are given in closed-form solutions. Our approach avoids spectral search and reduces the dimensions in matrix operations, thus, it is more computationally attractive than the existing techniques. Numerical results show that the proposed algorithm achieves performance comparable to that of the conventional estimators in massive MIMO systems.
78 citations
Cites background from "Noncooperative Cellular Wireless wi..."
...Compared with traditional MIMO configurations, massive MIMO systems, equipping with a large number of antennas at base station (BS), have a lot of advantages, such as higher throughput, enhanced link reliability, and improved spectral and energy efficiency [2], [9]–[13]....
[...]
...2875023 paradigm called massive MIMO, also known as large-scale MIMO, has created much interest both in academia [2]–[7] and industry [8], with the promise of meeting future capacity demands [9]....
[...]
10 Jul 2016
TL;DR: A new precoding technique to mitigate the inter-user-interference (IUI), the channel distortions in a 1-bit downlink MU-MISO system with QPSK symbols and a sort of mapping based on a look-up table (LUT) between the input signal and the transmit signal.
Abstract: 1-bit digital-to-analog (DACs) and analog-to-digital converters (ADCs) are gaining more interest in massive MIMO systems for economical and computational efficiency. We present a new precoding technique to mitigate the inter-user-interference (IUI) and the channel distortions in a 1-bit downlink MU-MISO system with QPSK symbols. The transmit signal vector is optimized taking into account the 1-bit quantization. We develop a sort of mapping based on a look-up table (LUT) between the input signal and the transmit signal. The LUT is updated for each channel realization. Simulation results show a significant gain in terms of the uncoded bit-error-ratio (BER) compared to the existing linear precoding techniques.
78 citations
Cites background from "Noncooperative Cellular Wireless wi..."
...I T ] 2 7 Ju n 20 17 Minimum BER Precoding in 1-Bit Massive MIMO Systems Hela Jedda and Josef A. Nossek Institute of Circuit Theory and Signal Processing Technische Universität München, 80290 Munich Germany Email: {hela.jedda, josef.a.nossek}@tum.de Amine Mezghani University of California, Irvine Irvine, CA 92697, USA Email: amezghan@uci.edu Abstract—1-bit digital-to-analog (DACs) and analog-to-digital converters (ADCs) are gaining more interest in massive MIMO systems for economical and computational efficiency....
[...]
...I T ] 2 7 Ju n 20 17 Minimum BER Precoding in 1-Bit Massive MIMO Systems Hela Jedda and Josef A. Nossek Institute of Circuit Theory and Signal Processing Technische Universität München, 80290 Munich Germany Email: {hela.jedda, josef.a.nossek}@tum.de Amine Mezghani University of California,…...
[...]
References
More filters
TL;DR: This paper addresses digital communication in a Rayleigh fading environment when the channel characteristic is unknown at the transmitter but is known (tracked) at the receiver with the aim of leveraging the already highly developed 1-D codec technology.
Abstract: This paper addresses digital communication in a Rayleigh fading environment when the channel characteristic is unknown at the transmitter but is known (tracked) at the receiver. Inventing a codec architecture that can realize a significant portion of the great capacity promised by information theory is essential to a standout long-term position in highly competitive arenas like fixed and indoor wireless. Use (n T , n R ) to express the number of antenna elements at the transmitter and receiver. An (n, n) analysis shows that despite the n received waves interfering randomly, capacity grows linearly with n and is enormous. With n = 8 at 1% outage and 21-dB average SNR at each receiving element, 42 b/s/Hz is achieved. The capacity is more than 40 times that of a (1, 1) system at the same total radiated transmitter power and bandwidth. Moreover, in some applications, n could be much larger than 8. In striving for significant fractions of such huge capacities, the question arises: Can one construct an (n, n) system whose capacity scales linearly with n, using as building blocks n separately coded one-dimensional (1-D) subsystems of equal capacity? With the aim of leveraging the already highly developed 1-D codec technology, this paper reports just such an invention. In this new architecture, signals are layered in space and time as suggested by a tight capacity bound.
6,812 citations
"Noncooperative Cellular Wireless wi..." refers background in this paper
...A point-to-point MIMO system [2] requires expensive multiple-antenna terminals....
[...]
TL;DR: Under certain mild conditions, this scheme is found to be throughput-wise asymptotically optimal for both high and low signal-to-noise ratio (SNR), and some numerical results are provided for the ergodic throughput of the simplified zero-forcing scheme in independent Rayleigh fading.
Abstract: A Gaussian broadcast channel (GBC) with r single-antenna receivers and t antennas at the transmitter is considered. Both transmitter and receivers have perfect knowledge of the channel. Despite its apparent simplicity, this model is, in general, a nondegraded broadcast channel (BC), for which the capacity region is not fully known. For the two-user case, we find a special case of Marton's (1979) region that achieves optimal sum-rate (throughput). In brief, the transmitter decomposes the channel into two interference channels, where interference is caused by the other user signal. Users are successively encoded, such that encoding of the second user is based on the noncausal knowledge of the interference caused by the first user. The crosstalk parameters are optimized such that the overall throughput is maximum and, surprisingly, this is shown to be optimal over all possible strategies (not only with respect to Marton's achievable region). For the case of r>2 users, we find a somewhat simpler choice of Marton's region based on ordering and successively encoding the users. For each user i in the given ordering, the interference caused by users j>i is eliminated by zero forcing at the transmitter, while interference caused by users j
2,616 citations
"Noncooperative Cellular Wireless wi..." refers background in this paper
...An alternative to a point-to-point MIMO system is a multiuser MIMO system [3], [4], [5], [6] in which an antenna array simultaneously serves a multiplicity of autonomous terminals....
[...]
Book•
28 Jun 2004TL;DR: A tutorial on random matrices is provided which provides an overview of the theory and brings together in one source the most significant results recently obtained.
Abstract: Random matrix theory has found many applications in physics, statistics and engineering since its inception. Although early developments were motivated by practical experimental problems, random matrices are now used in fields as diverse as Riemann hypothesis, stochastic differential equations, condensed matter physics, statistical physics, chaotic systems, numerical linear algebra, neural networks, multivariate statistics, information theory, signal processing and small-world networks. This article provides a tutorial on random matrices which provides an overview of the theory and brings together in one source the most significant results recently obtained. Furthermore, the application of random matrix theory to the fundamental limits of wireless communication channels is described in depth.
2,308 citations
"Noncooperative Cellular Wireless wi..." refers background in this paper
...It can be shown that the vector φkjΦ ∗ l has exactly the same probability distribution as does any row vector of Φl [15], [16]....
[...]
01 Jan 2004
2,180 citations
TL;DR: It is shown that the dirty paper achievable region achieves the sum-rate capacity of the MIMO BC by establishing that the maximum sum rate of this region equals an upper bound on the sum rate.
Abstract: We consider a multiuser multiple-input multiple- output (MIMO) Gaussian broadcast channel (BC), where the transmitter and receivers have multiple antennas. Since the MIMO BC is in general a nondegraded BC, its capacity region remains an unsolved problem. We establish a duality between what is termed the "dirty paper" achievable region (the Caire-Shamai (see Proc. IEEE Int. Symp. Information Theory, Washington, DC, June 2001, p.322) achievable region) for the MIMO BC and the capacity region of the MIMO multiple-access channel (MAC), which is easy to compute. Using this duality, we greatly reduce the computational complexity required for obtaining the dirty paper achievable region for the MIMO BC. We also show that the dirty paper achievable region achieves the sum-rate capacity of the MIMO BC by establishing that the maximum sum rate of this region equals an upper bound on the sum rate of the MIMO BC.
1,802 citations
"Noncooperative Cellular Wireless wi..." refers background in this paper
...An alternative to a point-to-point MIMO system is a multiuser MIMO system [3], [4], [5], [6] in which an antenna array simultaneously serves a multiplicity of autonomous terminals....
[...]