arXiv subjects

Yindi Jing

Publications and source records attributed to Yindi Jing.

27 records · Page 2Linked to original sources

arXiv2017

Performance Scaling Law for Multi-Cell Multi-User Massive MIMO

This work provides a comprehensive scaling law based performance analysis for multi-cell multi-user massive multiple-input-multiple-output (MIMO) downlink systems. Imperfect channel state information (CSI), pilot contamination, and channel spatial correlation are all considered. First, a sum- rate lower bound is derived by exploiting the asymptotically deterministic property of the received signal power, while keeping the random nature of other components in the signal-to-interference-plus-noise-ratio (SINR) intact. Via a general scaling model on important network parameters, including the number of users, the channel training energy and the data transmission power, with respect to the number of base station antennas, the asymptotic scaling law of the effective SINR is obtained, which reveals quantitatively the tradeoff of the network parameters. More importantly, pilot contamination and pilot contamination elimination (PCE) are considered in the analytical framework. In addition, the applicability of the derived asymptotic scaling law in practical systems with large but finite antenna numbers are discussed. Finally, sufficient conditions on the parameter scalings for the SINR to be asymptotically deterministic in the sense of mean square convergence are provided, which covers existing results on such analysis as special cases and shows the effect of PCE explicitly.

cs.IT↗

arXiv2016

On Weighted MSE Model for MIMO Transceiver Optimization

Mean-squared-error (MSE) is one of the most widely used performance metrics for the designs and analysis of multi-input-multiple-output (MIMO) communications. Weighted MSE minimization, a more general formulation of MSE minimization, plays an important role in MIMO transceiver optimization. While this topic has a long history and has been extensively studied, existing treatments on the methods in solving the weighted MSE optimization are more or less sporadic and non-systematic. In this paper, we firstly review the two major methodologies, Lagrange multiplier method and majorization theory based method, and their common procedures in solving the weighted MSE minimization. Then some problems and limitations of the methods that were usually neglected or glossed over in existing literature are provided. These problems are fundamental and of critical importance for the corresponding MIMO transceiver optimizations. In addition, a new extended matrix-field weighted MSE model is proposed. Its solutions and applications are discussed in details. Compared with existing models, this new model has wider applications, e.g., nonlinear MIMO transceiver designs and capacity-maximization transceiver designs for general MIMO networks.

cs.IT↗

arXiv2016

Spectral Efficiency of Mixed-ADC Receivers for Massive MIMO Systems

This paper investigated the uplink of multi-user massive multi-input multi-output (MIMO) systems with a mixed analog-to-digital converter (ADC) receiver architecture, in which some antennas are equipped with costly full-resolution ADCs and others with less expensive low-resolution ADCs. A closed-form approximation of the achievable spectral efficiency (SE) with the maximum-ratio combining (MRC) detector is derived. Based on this approximated result, the effects of the number of base station antennas, the transmit power, the proportion of full-resolution ADCs in the mixed-ADC structure, and the number of quantization bits of the low-resolution ADCs are revealed. Results showcase that the achievable SE increases with the number of BS antennas and quantization bits, and it converges to a saturated value in the high user power regime or the full ADC resolution case. Most important, this work efficiency verifies that for massive MIMO, the mixed-ADC receiver with a small fraction of full-resolution ADCs can have comparable SE performance with the receiver with all full-resolution ADCs but at a considerably lower hardware cost.

cs.IT↗

arXiv2016

Performance Analysis and Scaling Law of MRC/MRT Relaying with CSI Error in Massive MIMO Systems

This work provides a comprehensive scaling law and performance analysis for multi-user massive MIMO relay networks, where the relay is equipped with massive antennas and uses MRC/MRT for low-complexity processing. CSI error is considered. First, a sum-rate lower bound is derived which manifests the effect of system parameters including the numbers of relay antennas and users, the CSI quality, and the transmit powers of the sources and the relay. Via a general scaling model on the system parameters with respect to the relay antenna number, the asymptotic scaling law of the SINR as a function of the parameter scalings is obtained, which shows quantitatively the tradeoff between the network parameters and their effect on the network performance. In addition, a sufficient condition on the parameter scalings for the SINR to be asymptotically deterministic is given, which covers existing studies on such analysis as special cases. Then, the scenario where the SINR increases linearly with the relay antenna number is studied. The sufficient and necessary condition on the parameter scaling for this scenario is proved. It is shown that in this case, the interference power is not asymptotically deterministic, then its distribution is derived, based on which the outage probability and average bit error rate of the relay network are analysed.

cs.NI↗

arXiv2014

Performance Analysis and Location Optimization for Massive MIMO Systems with Circularly Distributed Antennas

In this paper, we analyze the achievable rate of the uplink of a single-cell multi-user distributed massive multiple-input-multiple-output (MIMO) system. The multiple users are equipped with single antenna and the base station (BS) is equipped with a large number of distributed antennas. We derive an analytical expression for the asymptotic ergodic achievable rate of the system under zero-forcing (ZF) detector. In particular, we consider circular antenna array, where the distributed BS antennas are located evenly on a circle, and derive an analytical expression and closed-form tight bounds for the achievable rate of an arbitrarily located user. Subsequently, closed-form bounds on the average achievable rate per user are obtained under the assumption that the users are uniformly located in the cell. Based on the bounds, we can understand the behavior of the system rate with respect to different parameters and find the optimal location of the circular BS antenna array that maximizes the average rate. Numerical results are provided to assess our analytical results and examine the impact of the number and the location of the BS antennas, the transmit power, and the path-loss exponent on system performance. It is shown that circularly distributed massive MIMO system largely outperforms centralized massive MIMO system.

cs.IT↗

arXiv2012

Power Allocation and Pricing in Multi-User Relay Networks Using Stackelberg and Bargaining Games

This paper considers a multi-user single-relay wireless network, where the relay gets paid for helping the users forward signals, and the users pay to receive the relay service. We study the relay power allocation and pricing problems, and model the interaction between the users and the relay as a two-level Stackelberg game. In this game, the relay, modeled as the service provider and the leader of the game, sets the relay price to maximize its revenue; while the users are modeled as customers and the followers who buy power from the relay for higher transmission rates. We use a bargaining game to model the negotiation among users to achieve a fair allocation of the relay power. Based on the proposed fair relay power allocation rule, the optimal relay power price that maximizes the relay revenue is derived analytically. Simulation shows that the proposed power allocation scheme achieves higher network sum-rate and relay revenue than the even power allocation. Furthermore, compared with the sum-rate-optimal solution, simulation shows that the proposed scheme achieves better fairness with comparable network sum-rate for a wide range of network scenarios. The proposed pricing and power allocation solutions are also shown to be consistent with the laws of supply and demand.

cs.IT↗

arXiv2011

Relay Selection and Performance Analysis in Multiple-User Networks

This paper investigates the relay selection (RS) problem in networks with multiple users and multiple common amplify-and-forward (AF) relays. Considering the overall quality-of-service of the network, we first specify our definition of optimal RS for multiple-user relay networks. Then an optimal RS (ORS) algorithm is provided, which is a straightforward extension of an RS scheme in the literature that maximizes the minimum end-to-end receive signal-to-noise ratio (SNR) of all users. The complexity of the ORS is quadratic in both the number of users and the number of relays. Then a suboptimal RS (SRS) scheme is proposed, which has linear complexity in the number of relays and quadratic complexity in the number of users. Furthermore, diversity orders of both the ORS and the proposed SRS are theoretically derived and compared with those of a naive RS scheme and the single-user RS network. It is shown that the ORS achieves full diversity; while the diversity order of the SRS decreases with the the number of users. For two-user networks, the outage probabilities and array gains corresponding to the minimum SNR of the RS schemes are derived in closed forms. It is proved that the advantage of the SRS over the naive RS scheme increases as the number of relays in the network increases. Simulation results are provided to corroborate the analytical results.

cs.IT↗

arXiv2010

Multi-Source Transmission for Wireless Relay Networks with Linear Complexity

This paper considers transmission schemes in multi-access relay networks (MARNs) where $J$ single-antenna sources send independent information to one $N$-antenna destination through one $M$-antenna relay. For complexity considerations, we propose a linear framework, where the relay linearly transforms its received signals to generate the forwarded signals without decoding and the destination uses its multi-antennas to fully decouple signals from different sources before decoding, by which the decoding complexity is linear in the number of sources. To achieve a high symbol rate, we first propose a scheme called DSTC-ICRec in which all sources' information streams are concurrently transmitted in both the source-relay link and the relay-destination link. In this scheme, distributed space-time coding (DSTC) is applied at the relay, which satisfies the linear constraint. DSTC also allows the destination to conduct the zero-forcing interference cancellation (IC) scheme originally proposed for multi-antenna systems to fully decouple signals from different sources. Our analysis shows that the symbol rate of DSTC-ICRec is $1/2$ symbols/source/channel use and the diversity gain of the scheme is upperbounded by $M-J+1$. To achieve a higher diversity gain, we propose another scheme called TDMA-ICRec in which the sources time-share the source-relay link. The relay coherently combines the signals on its antennas to maximize the signal-to-noise ratio (SNR) of each source, then concurrently forwards all sources' information. The destination performs zero-forcing IC. It is shown through both analysis and simulation that when $N \ge 2J-1$, TDMA-ICRec achieves the same maximum diversity gain as the full TDMA scheme in which the information stream from each source is assigned to an orthogonal channel in both links, but with a higher symbol rate.

cs.IT↗

arXiv2010

Interference Cancellation at the Relay for Multi-User Wireless Cooperative Networks

We study multi-user transmission and detection schemes for a multi-access relay network (MARN) with linear constraints at all nodes. In a $(J, J_a, R_a, M)$ MARN, $J$ sources, each equipped with $J_a$ antennas, communicate to one $M$-antenna destination through one $R_a$-antenna relay. A new protocol called IC-Relay-TDMA is proposed which takes two phases. During the first phase, symbols of different sources are transmitted concurrently to the relay. At the relay, interference cancellation (IC) techniques, previously proposed for systems with direct transmission, are applied to decouple the information of different sources without decoding. During the second phase, symbols of different sources are forwarded to the destination in a time division multi-access (TDMA) fashion. At the destination, the maximum-likelihood (ML) decoding is performed source-by-source. The protocol of IC-Relay-TDMA requires the number of relay antennas no less than the number of sources, i.e., $R_a\ge J$. Through outage analysis, the achievable diversity gain of the proposed scheme is shown to be $\min\{J_a(R_a-J+1),R_aM\}$. When {\small$M\le J_a\left(1-\frac{J-1}{R_a}\right)$}, the proposed scheme achieves the maximum interference-free (int-free) diversity gain $R_aM$. Since concurrent transmission is allowed during the first phase, compared to full TDMA transmission, the proposed scheme achieves the same diversity, but with a higher symbol rate.

cs.IT↗