Searcharxiv⌕ Search

arXiv subjects

Hongyan Li

Publications and source records attributed to Hongyan Li.

61 records · Page 4Linked to original sources

Time-Varying Downlink Channel Tracking for Quantized Massive MIMO Networks

This paper proposes a Bayesian downlink channel estimation algorithm for time-varying massive MIMO networks. In particular, the quantization effects at the receiver are considered. In order to fully exploit the sparsity and time correlations of channels, we formulate the time-varying massive MIMO channel as the simultaneously sparse signal model. Then, we propose a sparse Bayesian learning (SBL) framework to learn the model parameters of the sparse virtual channel. To reduce complexity, we employ the expectation maximization (EM) algorithm to achieve the approximated solution. Specifically, the factor graph and the general approximate message passing (GAMP) algorithms are used to compute the desired posterior statistics in the expectation step, so that high-dimensional integrals over the marginal distributions can be avoided. The non-zero supporting vector of a virtual channel is then obtained from channel statistics by a k-means clustering algorithm. After that, the reduced dimensional GAMP based scheme is applied to make the full use of the channel temporal correlation so as to enhance the virtual channel tracking accuracy. Finally, we demonstrate the efficacy of the proposed schemes through simulations.

cs.IT↗

GAMENet: Graph Augmented MEmory Networks for Recommending Medication Combination

Recent progress in deep learning is revolutionizing the healthcare domain including providing solutions to medication recommendations, especially recommending medication combination for patients with complex health conditions. Existing approaches either do not customize based on patient health history, or ignore existing knowledge on drug-drug interactions (DDI) that might lead to adverse outcomes. To fill this gap, we propose the Graph Augmented Memory Networks (GAMENet), which integrates the drug-drug interactions knowledge graph by a memory module implemented as a graph convolutional networks, and models longitudinal patient records as the query. It is trained end-to-end to provide safe and personalized recommendation of medication combination. We demonstrate the effectiveness and safety of GAMENet by comparing with several state-of-the-art methods on real EHR data. GAMENet outperformed all baselines in all effectiveness measures, and also achieved 3.60% DDI rate reduction from existing EHR data.

cs.AI↗

Generative Adversarial Network for Abstractive Text Summarization

In this paper, we propose an adversarial process for abstractive text summarization, in which we simultaneously train a generative model G and a discriminative model D. In particular, we build the generator G as an agent of reinforcement learning, which takes the raw text as input and predicts the abstractive summarization. We also build a discriminator which attempts to distinguish the generated summary from the ground truth summary. Extensive experiments demonstrate that our model achieves competitive ROUGE scores with the state-of-the-art methods on CNN/Daily Mail dataset. Qualitatively, we show that our model is able to generate more abstractive, readable and diverse summaries.

cs.CL↗

Interference-Alignment and Soft-Space-Reuse Based Cooperative Transmission for Multi-cell Massive MIMO Networks

As a revolutionary wireless transmission strategy, interference alignment (IA) can improve the capacity of the cell-edge users. However, the acquisition of the global channel state information (CSI) for IA leads to unacceptable overhead in the massive MIMO systems. To tackle this problem, in this paper, we propose an IA and soft-space-reuse (IA-SSR) based cooperative transmission scheme under the two-stage precoding framework. Specifically, the cell-center and the cell-edge users are separately treated to fully exploit the spatial degrees of freedoms (DoF). Then, the optimal power allocation policy is developed to maximize the sum-capacity of the network. Next, a low-cost channel estimator is designed for the proposed IA-SSR framework. Some practical issues in IA-SSR implementation are also discussed. Finally, plenty of numerical results are presented to show the efficiency of the proposed algorithm.

cs.IT↗

Base Station Selection for Massive MIMO Networks with Two-stage Precoding

The two-stage precoding has been proposed to reduce the overhead of both the channel training and the channel state information (CSI) feedback for the massive multiple-input multiple-output (MIMO) system. But the overlap of the angle-spreading-ranges (ASR) for different user clusters may seriously degrade the performance of the two-stage precoding. In this letter, we propose one ASR overlap mitigating scheme through the base station (BS) selection. Firstly, the BS selection is formulated as a sum signal-to-interference-plus-noise ratio (SINR) maximization problem. Then, the problem is solved by a low-complex algorithm through maximizing signal-to-leakage-plus-noise ratio (SLNR). In addition, we propose one low-overhead algorithm with the lower bound on the average SLNR as the objective function. Finally, we demonstrate the efficacy of the proposed schemes through the numerical simulations.

cs.IT↗

Information-Centric Wireless Networks with Virtualization and D2D Communications

Wireless network virtualization and information-centric networking (ICN) are two promising technologies for next generation wireless networks. Although some excellent works have focused on these two technologies, device-to-device (D2D) communications have not beeen investigated in information-centric virtualized cellular networks. Meanwhile, content caching in mobile devices has attracted great attentions due to the saved backhaul consumption or reduced transmission latency in D2D-assisted cellular networks. However, when it comes to the multi-operator scenario, the direct content sharing between different operators via D2D communications is typically infeasible. In this article, we propose a novel information-centric virtualized cellular network framework with D2D communications, enabling not only content caching in the air, but also inter-operator content sharing between mobile devices. Moreover, we describe the key components in the proposed framework, and present the interactions among them. In addition, we incorporate and formulate the content caching strategies in resource allocation optimization, to maximize the total utility of mobile virtual network operators (MVNOs) through caching popular contents in mobile devices. Simulations results demonstrate the effectiveness of the proposed framework and scheme with different system parameters.

cs.NI↗

Random Attractor for Stochastic Wave Equation with Arbitrary Exponent and Additive Noise on $\mathbb{R}^n$

Asymptotic random dynamics of weak solutions for a damped stochastic wave equation with the nonlinearity of arbitrarily large exponent and the additive noise on $\mathbb{R}^n$ is investigated. The existence of a pullback random attractor is proved in a parameter region with a breakthrough in proving the pullback asymptotic compactness of the cocycle with the quasi-trajectories defined on the integrable function space of arbitrary exponent and on the unbounded domain of arbitrary dimension.

math.AP↗