arXiv subjects

Wei Yu

Publications and source records attributed to Wei Yu.

At least 181 records · Page 10Linked to original sources

arXiv2019

Optimization of MIMO Device-to-Device Networks via Matrix Fractional Programming: A Minorization-Maximization Approach

Interference management is a fundamental issue in device-to-device (D2D) communications whenever the transmitter-and-receiver pairs are located in close proximity and frequencies are fully reused, so active links may severely interfere with each other. This paper devises an optimization strategy named FPLinQ to coordinate the link scheduling decisions among the interfering links, along with power control and beamforming. The key enabler is a novel optimization method called matrix fractional programming (FP) that generalizes previous scalar and vector forms of FP in allowing multiple data streams per link. From a theoretical perspective, this paper provides a deeper understanding of FP by showing a connection to the minorization-maximization (MM) algorithm. From an application perspective, this paper shows that as compared to the existing methods for coordinating scheduling in the D2D network, such as FlashLinQ, ITLinQ, and ITLinQ+, the proposed FPLinQ approach is more general in allowing multiple antennas at both the transmitters and the receivers, and further in allowing arbitrary and multiple possible associations between the devices via matching. Numerical results show that FPLinQ significantly outperforms the previous state-of-the-art in a typical D2D communication environment.

cs.IT↗

arXiv2019

Interference Mitigation via Relaying

This paper studies the effectiveness of relaying for interference mitigation in an interference-limited communication scenario. We are motivated by the observation that in a cellular network, a relay node placed at the cell edge observes a combination of intended signal and inter-cell interference that is correlated with the received signal at a nearby destination, so a relaying link can effectively allow the antennas at the relay and at the destination to be pooled together for both signal enhancement and interference mitigation. We model this scenario by a MIMO Gaussian relay channel with a digital relay-to-destination link of finite capacity, and with correlated noise across the relay and destination antennas. Assuming a compress-and-forward strategy with Gaussian input distribution and quantization noise, we propose a coordinate ascent algorithm for obtaining a stationary point of the non-convex joint optimization of the transmit and quantization covariance matrices. For fixed input distribution, the globally optimum quantization noise covariance matrix can be found in closed-form using a transformation of the relay's observation that simultaneously diagonalizes two conditional covariance matrices by congruence. For fixed quantization, the globally optimum transmit covariance matrix can be found via convex optimization. This paper further shows that such an optimized achievable rate is within a constant additive gap of the MIMO relay channel capacity. The optimal structure of the quantization noise covariance enables a characterization of the slope of the achievable rate as a function of the relay-to-destination link capacity. Moreover, this paper shows that the improvement in spatial degrees of freedom by MIMO relaying in the presence of noise correlation is related to the aforementioned slope via a connection to the deterministic relay channel.

cs.IT↗

arXiv2019

Two-Timescale Hybrid Compression and Forward for Massive MIMO Aided C-RAN

We consider the uplink of a cloud radio access network (C-RAN), where massive MIMO remote radio heads (RRHs) serve as relays between users and a centralized baseband unit (BBU). Although employing massive MIMO at RRHs can improve the spectral efficiency, it also significantly increases the amount of data transported over the fronthaul links between RRHs and BBU, which becomes a performance bottleneck. Existing fronthaul compression methods for conventional C-RAN are not suitable for the massive MIMO regime because they require fully-digital processing and/or real-time full channel state information (CSI), incurring high implementation cost for massive MIMO RRHs. To overcome this challenge, we propose to perform a two-timescale hybrid analog-and-digital spatial filtering at each RRH to reduce the fronthaul consumption. Specifically, the analog filter is adaptive to the channel statistics to achieve massive MIMO array gain, and the digital filter is adaptive to the instantaneous effective CSI to achieve spatial multiplexing gain. Such a design can alleviate the performance bottleneck of limited fronthaul with reduced hardware cost and power consumption, and is more robust to the CSI delay. We propose an online algorithm for the two-timescale non-convex optimization of analog and digital filters, and establish its convergence to stationary solutions. Finally, simulations verify the advantages of the proposed scheme.

cs.IT↗

arXiv2019

Interference Mitigation for Ultrareliable Low-Latency Wireless Communication

This paper proposes interference mitigation techniques for provisioning ultrareliable low-latency wireless communication in an industrial automation setting, where multiple transmissions from controllers to actuators interfere with each other. Channel fading and interference are key impairments in wireless communication. This paper leverages the recently proposed ``Occupy CoW'' protocol that efficiently exploits the broadcast opportunity and spatial diversity through a two-hop cooperative communication strategy among distributed receivers to combat deep fading, but points out that because this protocol avoids interference by frequency division orthogonal transmission, it is not scalable in terms of bandwidth required for achieving ultrareliability, when multiple controllers simultaneously communicate with multiple actuators (akin to the downlink of a multicell network). The main observation of this paper is that full frequency reuse in the first phase, together with successive decoding and cancellation of interference, can improve the performance of this strategy notably. We propose two protocols depending on whether interference cancellation or avoidance is implemented in the second phase, and show that both outperform Occupy CoW in terms of the required bandwidth and power for achieving ultrareliability at practical values of the transmit power.

cs.IT↗

arXiv2019

Towards Optimal Power Control via Ensembling Deep Neural Networks

A deep neural network (DNN) based power control method is proposed, which aims at solving the non-convex optimization problem of maximizing the sum rate of a multi-user interference channel. Towards this end, we first present PCNet, which is a multi-layer fully connected neural network that is specifically designed for the power control problem. PCNet takes the channel coefficients as input and outputs the transmit power of all users. A key challenge in training a DNN for the power control problem is the lack of ground truth, i.e., the optimal power allocation is unknown. To address this issue, PCNet leverages the unsupervised learning strategy and directly maximizes the sum rate in the training phase. Observing that a single PCNet does not globally outperform the existing solutions, we further propose ePCNet, a network ensemble with multiple PCNets trained independently. Simulation results show that for the standard symmetric multi-user Gaussian interference channel, ePCNet can outperform all state-of-the-art power control methods by 1.2%-4.6% under a variety of system configurations. Furthermore, the performance improvement of ePCNet comes with a reduced computational complexity.

eess.SP↗

arXiv2019

Generalized Approximate Message Passing for Massive MIMO mmWave Channel Estimation with Laplacian Prior

This paper tackles the problem of millimeter-Wave (mmWave) channel estimation in massive MIMO communication systems. A new Bayes-optimal channel estimator is derived using recent advances in the approximate belief propagation (BP) Bayesian inference paradigm. By leveraging the inherent sparsity of the mmWave MIMO channel in the angular domain, we recast the underlying channel estimation problem into that of reconstructing a compressible signal from a set of noisy linear measurements. Then, the generalized approximate message passing (GAMP) algorithm is used to find the entries of the unknown mmWave MIMO channel matrix. Unlike all the existing works on the same topic, we model the angular-domain channel coefficients by Laplacian distributed random variables. Further, we establish the closed-form expressions for the various statistical quantities that need to be updated iteratively by GAMP. To render the proposed algorithm fully automated, we also develop an expectation-maximization (EM) based procedure that can be easily embedded within GAMP's iteration loop in order to learn all the unknown parameters of the underlying Bayesian inference problem. Computer simulations show that the proposed combined EM-GAMP algorithm under a Laplacian prior exhibits improvements both in terms of channel estimation accuracy, achievable rate, and computational complexity as compared to the Gaussian mixture prior that has been advocated in the recent literature. In addition, it is found that the Laplacian prior speeds up the convergence time of GAMP over the entire signal-to-noise ratio (SNR) range.

cs.IT↗

arXiv2019

Decimeter Ranging with Channel State Information

This paper aims at the problem of time-of-flight (ToF) estimation using channel state information (CSI) obtainable from commercialized MIMO-OFDM WLAN receivers. It was often claimed that the CSI phase is contaminated with errors of known and unknown natures rendering ToF-based positioning difficult. To search for an answer, we take a bottom-up approach by first understanding CSI, its constituent building blocks, and the sources of error that contaminate it. We then model these effects mathematically. The correctness of these models is corroborated based on the CSI collected in extensive measurement campaign including radiated, conducted and chamber tests. Knowing the nature of contamination in CSI phase and amplitude, we proceed with introducing pre-processing methods to clean CSI from those errors and make it usable for range estimation. To check the validity of proposed algorithms, the MUSIC super-resolution algorithm is applied to post-processed CSI to perform range estimates. Results substantiate that median accuracy of 0.6m, 0.8m, and 0.9m is achievable in highly multipath line-of-sight environment where transmitter and receiver are 5m, 10m, and 15m apart.

eess.SP↗

arXiv2019

Efficiency enhancement on the solar steam generation by wick materials with wrapped graphene nanoparticles

Solar steam generation technology can utilize abundant and renewable solar energy for many applications. In this work, we proposed a solar steam generator using wick material with wrapped graphene nanoparticles, and the energy efficiency can reaches up to 80%. Instead of traditional smearing method, the chemical wrapping method was used to better adhere the graphene nanoparticles on the wick materials. Through the SEM morphological results, the graphene nanoparticles are shown to be evenly wrapped across the fibres of the wick material, which have better dispersity and stability. The evaporation rate, instantaneous energy efficiency and the absorptivity of three wick materials with/without nanoparticles under different conditions were compared and analyzed. Among the three different wick materials, the flannel cloth with dense fine hairs can provide three-dimensional contact area for wrapping graphene nanoparticles and thus contribute to better evaporation. Additionally, the influence of two different reduction methods and different concentrations of graphene oxide solution on the energy efficiency was also discussed. Our work offers a simple and effective way of using nanotechnology in practical application for solar steam generation.

physics.app-ph↗

arXiv2018

Anti-lock Brake System for Integrated Electric Parking Brake Actuator Based on Sliding-mode Control

Integrated electric parking brake (iEPB) is popularizing on passenger cars due to its easier operation and automatic functions. As a parking brake, EPB have to act as the secondary brake system in case of hydraulic brake failure. To guarantee the stability and safety of a car during iEPB braking, the rear slip ratio has to be controlled accurately within the optimized value to get the shortest brake distance without undesired loss of control. In this paper, a sliding-mode controller (SMC) is investigated to achieve rear-wheel anti-lock brake control, which is robust against uncertainties and disturbance of the parameters. And a sliding-mode observer (SMO) is present to estimate the load torque of d.c. motor and calculate the brake torque. The tyre/road friction coefficient estimator is designed to obtain the optimal rear slip ratio timely. The simulation model of iEPB system is initially constructed in AMESim and the vehicle model is built in MATLAB/Simulink, and the complete system is co-simulated by these two software simultaneously with different road conditions. Simulation results show that the proposed observer and estimator are feasible. This study may provide a useful method to realize rear slip ratio control so that the safety and stability of vehicle could be improved significantly in specified condition

eess.SY↗

arXiv2018

Isotropic non-local Gilbert damping driven by spin currents in epitaxial Pd/Fe/MgO(001) films

Although both theoretical predications and experimental observations demonstrated that the damping factor is anisotropic at ferromagnet/semiconductor interface with robust interfacial spin-orbit coupling, it is not well understood whether non-local Gilbert damping driven by spin currents in heavy metal/ferromagnetic metal (HM/FM) bilayers is anisotropic or not. Here, we investigated the in-plane angular- and frequency- dependence of magnetic relaxation of epitaxial Fe/MgO(001) films with different capping layers of Pd and Cu. After disentangling the parasitic contributions, such as two-magnon scattering (TMS), mosaicity, and field-dragging effect, we unambiguously observed that both local and non-local Gilbert damping are isotropic in Fe(001) plane, suggesting that the pure spin currents absorption is independent of Fe magnetization orientation in the epitaxial Pd/Fe heterostructure. First principles calculation reveals that the effective spin mixing conductance of Pd/Fe interface is nearly invariant for different magnetization directions in good agreement with the experimental observations. These results offer a valuable insight into the transmission and absorption of pure spin currents, and facilitate us to utilize next-generation spintronic devices.

cond-mat.mtrl-sci↗

arXiv2018

Enhancing Cellular Performance through Device-to-Device Distributed MIMO

The integration of local device-to-device (D2D) communications and cellular connections has been intensively studied to satisfy co-existing D2D and cellular communication demand. In future cellular networks, there will be numerous standby users possessing D2D communication capabilities in close proximity to each other. Considering that these standby users do not necessarily request D2D communications all the time, in this paper we propose a hybrid D2D-cellular scheme to make use of these standby users and to improve the rate performance for cellular users. More specifically, through D2D links, a virtual antenna array can be formed by sharing antennas across different terminals to realize the diversity gain of MIMO channels. This paper considers the use of millimeter wave (mmWave) links to enable high data rate D2D communications. We then design an orthogonal D2D multiple access protocol and formulate the optimization problem of joint cellular and D2D resource allocation for downlink transmissions using the proposed scheme. We obtain a closed-form solution for D2D resource allocation, which reveals useful insights for practical system design. Numerical results from extensive system-level simulations demonstrate that the rate performance of cellular users is significantly improved.

cs.IT↗

arXiv2018

Optimizing the MIMO Cellular Downlink: Multiplexing, Diversity, or Interference Nulling?

A base-station (BS) equipped with multiple antennas can use its spatial dimensions in three different ways: (1) to serve multiple users, thereby achieving a multiplexing gain, (2) to provide spatial diversity in order to improve user rates and (3) to null interference in neighboring cells. This paper answers the following question: What is the optimal balance between these three competing benefits? We answer this question in the context of the downlink of a cellular network, where multi-antenna BSs serve multiple single-antenna users using zero-forcing beamforming with equal power assignment, while nulling interference at a subset of out-of-cell users. Any remaining spatial dimensions provide transmit diversity for the scheduled users. Utilizing tools from stochastic geometry, we show that, surprisingly, to maximize the per-BS ergodic sum rate, with an optimal allocation of spatial resources, interference nulling does not provide a tangible benefit. The strategy of avoiding inter-cell interference nulling, reserving some fraction of spatial resources for multiplexing and using the rest to provide diversity, is already close-to-optimal in terms of the sum-rate. However, interference nulling does bring significant benefit to cell-edge users, particularly when adopting a range-adaptive nulling strategy where the size of the cooperating BS cluster is increased for cell-edge users.

cs.IT↗

arXiv2018

Stochastic Modeling and Analysis of User-Centric Network MIMO Systems

This paper provides an analytical performance characterization of both uplink (UL) and downlink (DL) user-centric network multiple-input multiple-output (MIMO) systems, where a cooperating BS cluster is formed for each user individually and the clusters for different users may overlap. In this model, cooperating BSs (each equipped with multiple antennas) jointly perform zero-forcing beamforming to the set of single-antenna users associated with them. As compared to a baseline network MIMO systems with disjoint BS clusters, the effect of user-centric clustering is that it improves signal strength in both UL and DL, while reducing cluster-edge interference in DL. This paper quantifies these effects by assuming that BSs and users form Poisson point processes and by further approximating both the signal and interference powers using Gamma distributions of appropriate parameters. We show that BS cooperation provides significant gain as compared to single-cell processing for both UL and DL, but the advantage of user-centric clustering over the baseline disjoint clustering system is significant for the DL cluster-edge users only. Although the analytic results are derived with the assumption of perfect channel state information and infinite backhaul between the cooperating BSs, they nevertheless provide architectural insight into the design of future cooperative cellular networks.

cs.IT↗

arXiv2018

Joint Frequency Reuse and Cache Optimization in Backhaul-Limited Small-Cell Wireless Networks

Caching at base stations (BSs) is a promising approach for supporting the tremendous traffic growth of content delivery over future small-cell wireless networks with limited backhaul. This paper considers exploiting spatial caching diversity (i.e., caching different subsets of popular content files at neighboring BSs) that can greatly improve the cache hit probability, thereby leading to a better overall system performance. A key issue in exploiting spatial caching diversity is that the cached content may not be located at the nearest BS, which means that to access such content, a user needs to overcome strong interference from the nearby BSs; this significantly limits the gain of spatial caching diversity. In this paper, we consider a joint design of frequency reuse and caching, such that the benefit of an improved cache hit probability induced by spatial caching diversity and the benefit of interference coordination induced by frequency reuse can be achieved simultaneously. We obtain a closed-form characterization of the approximate successful transmission probability for the proposed scheme and analyze the impact of key operating parameters on the performance. We design a low-complexity algorithm to optimize the frequency reuse factor and the cache storage allocation. Simulations show that the proposed scheme achieves a higher successful transmission probability than existing caching schemes.

eess.SP↗

arXiv2018

Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things

The next wave of wireless technologies will proliferate in connecting sensors, machines, and robots for myriad new applications, thereby creating the fabric for the Internet of Things (IoT). A generic scenario for IoT connectivity involves a massive number of machine-type connections. But in a typical application, only a small (unknown) subset of devices are active at any given instant, thus one of the key challenges for providing massive IoT connectivity is to detect the active devices first and then to decode their data with low latency. This article outlines several key signal processing techniques that are applicable to the problem of massive IoT access, focusing primarily on advanced compressed sensing technique and its application for efficient detection of the active devices. We show that massive multiple-input multiple-output (MIMO) is especially well-suited for massive IoT connectivity in the sense that the device detection error can be driven to zero asymptotically in the limit as the number of antennas at the base station goes to infinity by using the multiple-measurement vector (MMV) compressed sensing techniques. The paper also provides a perspective on several related important techniques for massive access, such as embedding of short messages onto the device activity detection process and the coded random access.

cs.IT↗

arXiv2018

Hybrid Data-Sharing and Compression Strategy for Downlink Cloud Radio Access Network

This paper studies transmission strategies for the downlink of a cloud radio access network, in which the base stations are connected to a centralized cloud-computing based processor with digital fronthaul or backhaul links. We provide a system-level performance comparison of two fundamentally different strategies, namely the data-sharing strategy and the compression strategy, that differ in the way the fronthaul/backhaul is utilized. It is observed that the performance of both strategies depends crucially on the available fronthaul or backhaul capacity. When the fronthaul/backhaul capacity is low, the datasharing strategy performs better, while under moderate-to-high fronthaul/backhaul capacity, the compression strategy is superior. Using insights from such a comparison, we propose a novel hybrid strategy, combining the data-sharing and compression strategies, that allows for better control over the fronthaul/backhaul capacity utilization. An optimization framework for the hybrid strategy is proposed. Numerical evidence demonstrates the performance gain of the hybrid strategy.

cs.IT↗

arXiv2018

A D2D-based Protocol for Ultra-Reliable Wireless Communications for Industrial Automation

As one indispensable use case for the 5G wireless systems on the roadmap, ultra-reliable and low latency communications (URLLC) is a crucial requirement for the coming era of wireless industrial automation. This paper aims to develop communication techniques for making such a paradigm shift from the conventional human-type broadband communications to the emerging machine-type URLLC. One fundamental task for URLLC is to deliver a short command from the controller to each actuator within the stringent delay requirement and also with high-reliability in the downlink. Motivated by the geographic feature in industrial automation that in the factories many tasks are assigned to different groups of devices who work in close proximity to each other and thus can form clusters of reliable device-to-device (D2D) networks, this paper proposes a novel two-phase transmission protocol for achieving the above goal. Specifically, in the first phase within the latency requirement, the multi-antenna base station (BS) combines the messages of each group together and multicasts them to the corresponding groups; while in the second phase, the devices that have decoded the messages successfully, who are defined as the leaders, help relay the messages to the other devices in their groups. Under this protocol, we further design an innovative leader selection based beamforming strategy at the BS by utilizing the sparse optimization technique, which leads to the desired sparsity pattern in user activity, i.e., at least one leader exists in each group, in the first phase, thus making full utilization of the reliable D2D networks in the second phase. Simulation results are provided to show that the proposed two-phase transmission protocol considerably improves the reliability of the whole system within the stringent latency requirement as compared to other existing schemes for URLLC such as Occupy CoW.

cs.IT↗

arXiv2018

Optimized Base-Station Cache Allocation for Cloud Radio Access Network with Multicast Backhaul

The performance of cloud radio access network (C-RAN) is limited by the finite capacities of the backhaul links connecting the centralized processor (CP) with the base-stations (BSs), especially when the backhaul is implemented in a wireless medium. This paper proposes the use of wireless multicast together with BS caching, where the BSs pre-store contents of popular files, to augment the backhaul of C-RAN. For a downlink C-RAN consisting of a single cluster of BSs and wireless backhaul, this paper studies the optimal cache size allocation strategy among the BSs and the optimal multicast beamforming transmission strategy at the CP such that the user's requested messages are delivered from the CP to the BSs in the most efficient way. We first state a multicast backhaul rate expression based on a joint cache-channel coding scheme, which implies that larger cache sizes should be allocated to the BSs with weaker channels. We then formulate a two-timescale joint cache size allocation and beamforming design problem, where the cache is optimized offline based on the long-term channel statistical information, while the beamformer is designed during the file delivery phase based on the instantaneous channel state information. By leveraging the sample approximation method and the alternating direction method of multipliers (ADMM), we develop efficient algorithms for optimizing cache size allocation among the BSs, and quantify how much more cache should be allocated to the weaker BSs. We further consider the case with multiple files having different popularities and show that it is in general not optimal to entirely cache the most popular files first. Numerical results show considerable performance improvement of the optimized cache size allocation scheme over the uniform allocation and other heuristic schemes.

cs.IT↗