Researcher profile

Ying Cui

Ying Cui contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
27works
0followers
12topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

27 published item(s)

preprint2026arXiv

Learning Interpretable Point-Based Clinical Risk Scores via Direct Optimization

Many clinical risk scores are deployed as additive rules with nonnegative integer points assigned to relevant binary predictive features. These integer weights not only make the score easier to use in practice but also promote sparsity in the resulting prediction model. Such risk scores are often derived by first fitting a regression model and then rounding the estimated coefficients to the nearest integer after appropriate scaling. This approach is computationally fast but does not guarantee optimality of the resulting score. Alternatively, one may search over all possible integer weights to directly optimize a value function by posing the problem as an integer programming task. However, the associated computational burden can be substantial, especially when the value function is nonconcave or even discontinuous. In this paper, we develop new machine learning algorithms that employ a flexible greedy optimization strategy to learn such additive scoring directly under explicit and sensible optimality objectives. We apply the proposed method to a large electronic health record (EHR) cohort in Epic Cosmos to construct an integer-weighted comorbidity score for measuring the risk of post-discharge mortality. We also conduct a simulation study to examine the finite-sample operating characteristics.

preprint2023arXiv

Joint Service Caching and Computing Resource Allocation for Edge Computing-Enabled Networks

In this paper, we consider the service caching and the computing resource allocation in edge computing (EC) enabled networks. We introduce a random service caching design considering multiple types of latency sensitive services and the base stations (BSs)' service caching storage. We then derive a successful service probability (SSP). We also formulate a SSP maximization problem subject to the service caching distribution and the computing resource allocation. Then, we show that the optimization problem is nonconvex and develop a novel algorithm to obtain the stationary point of the SSP maximization problem by adopting the parallel successive convex approximation (SCA). Moreover, to further reduce the computational complexity, we also provide a low complex algorithm that can obtain the near-optimal solution of the SSP maximization problem in high computing capability region. Finally, from numerical simulations, we show that proposed solutions achieve higher SSP than baseline schemes. Moreover, we show that the near-optimal solution achieves reliable performance in the high computing capability region. We also explore the impacts of target delays, a BSs' service cache size, and an EC servers' computing capability on the SSP.

preprint2022arXiv

An Optimization Framework for Federated Edge Learning

The optimal design of federated learning (FL) algorithms for solving general machine learning (ML) problems in practical edge computing systems with quantized message passing remains an open problem. This paper considers an edge computing system where the server and workers have possibly different computing and communication capabilities and employ quantization before transmitting messages. To explore the full potential of FL in such an edge computing system, we first present a general FL algorithm, namely GenQSGD, parameterized by the numbers of global and local iterations, mini-batch size, and step size sequence. Then, we analyze its convergence for an arbitrary step size sequence and specify the convergence results under three commonly adopted step size rules, namely the constant, exponential, and diminishing step size rules. Next, we optimize the algorithm parameters to minimize the energy cost under the time constraint and convergence error constraint, with the focus on the overall implementing process of FL. Specifically, for any given step size sequence under each considered step size rule, we optimize the numbers of global and local iterations and mini-batch size to optimally implement FL for applications with preset step size sequences. We also optimize the step size sequence along with these algorithm parameters to explore the full potential of FL. The resulting optimization problems are challenging non-convex problems with non-differentiable constraint functions. We propose iterative algorithms to obtain KKT points using general inner approximation (GIA) and tricks for solving complementary geometric programming (CGP). Finally, we numerically demonstrate the remarkable gains of GenQSGD with optimized algorithm parameters over existing FL algorithms and reveal the significance of optimally designing general FL algorithms.

preprint2022arXiv

An Optimization Framework for General Rate Splitting for General Multicast

Immersive video, such as virtual reality (VR) and multi-view videos, is growing in popularity. Its wireless streaming is an instance of general multicast, extending conventional unicast and multicast, whose effective design is still open. This paper investigates general rate splitting for general multicast. Specifically, we consider a multi-carrier single-cell wireless network where a multi-antenna base station (BS) communicates to multiple single-antenna users via general multicast. We consider linear beamforming at the BS and joint decoding at each user in the slow fading and fast fading scenarios. In the slow fading scenario, we consider the maximization of the weighted sum average rate, which is a challenging nonconvex stochastic problem with numerous variables. To reduce computational complexity, we decouple the original nonconvex stochastic problem into multiple nonconvex deterministic problems, one for each system channel state. Then, we propose an iterative algorithm for each deterministic problem to obtain a Karush-Kuhn-Tucker (KKT) point using the concave-convex procedure (CCCP). In the fast fading scenario, we consider the maximization of the weighted sum ergodic rate. This problem is more challenging than the one for the slow fading scenario, as it is not separable. First, we propose a stochastic iterative algorithm to obtain a KKT point using stochastic successive convex approximation (SSCA) and the exact penalty method. Then, we propose two low-complexity iterative algorithms to obtain feasible points with promising performance for two cases of channel distributions using approximation and CCCP. The proposed optimization framework generalizes the existing ones for rate splitting for various types of services. Finally, we numerically show substantial gains of the proposed solutions over existing schemes in both scenarios.

preprint2022arXiv

Analysis and Optimization of A Double-IRS Cooperatively Assisted System with A Quasi-Static Phase Shift Design

The analysis and optimization of single intelligent reflecting surface (IRS)-assisted systems have been extensively studied, whereas little is known regarding multiple-IRS-assisted systems. This paper investigates the analysis and optimization of a double-IRS cooperatively assisted downlink system, where a multi-antenna base station (BS) serves a single-antenna user with the help of two multi-element IRSs, connected by an inter-IRS channel. The channel between any two nodes is modeled with Rician fading. The BS adopts the instantaneous CSI-adaptive maximum-ratio transmission (MRT) beamformer, and the two IRSs adopt a cooperative quasi-static phase shift design. The goal is to maximize the average achievable rate, which can be reflected by the average channel power of the equivalent channel between the BS and user, at a low phase adjustment cost and computational complexity. First, we obtain tractable expressions of the average channel power of the equivalent channel in the general Rician factor, pure line of sight (LoS), and pure non-line of sight (NLoS) regimes, respectively. Then, we jointly optimize the phase shifts of the two IRSs to maximize the average channel power of the equivalent channel in these regimes. The optimization problems are challenging non-convex problems. We obtain globally optimal closed-form solutions for some cases and propose computationally efficient iterative algorithms to obtain stationary points for the other cases. Next, we compare the computational complexity for optimizing the phase shifts and the optimal average channel power of the double-IRS cooperatively assisted system with those of a counterpart single-IRS-assisted system at a large number of reflecting elements in the three regimes. Finally, we numerically demonstrate notable gains of the proposed solutions over the existing solutions at different system parameters.

preprint2022arXiv

Joint Optimization of Preamble Selection and Access Barring for Random Access in MTC with General Device Activities

Most existing random access schemes for machine-type communications (MTC) simply adopt a uniform preamble selection distribution, irrespective of the underlying device activity distributions. Hence, they may yield unsatisfactory access efficiency. In this paper, we model device activities for MTC as multiple Bernoulli random variables following an arbitrary multivariate Bernoulli distribution which can reflect both dependent and independent device activities. Then, we optimize preamble selection and access barring for random access in MTC according to the underlying joint device activity distribution. Specifically, we investigate three cases of the joint device activity distribution, i.e., the cases of perfect, imperfect, and unknown joint device activity distributions, and formulate the average, worst-case average, and sample average throughput maximization problems, respectively. The problems in the three cases are challenging nonconvex problems. In the case of perfect joint device activity distribution, we develop an iterative algorithm and a low-complexity iterative algorithm to obtain stationary points of the original problem and an approximate problem, respectively. In the case of imperfect joint device activity distribution, we develop an iterative algorithm and a low-complexity iterative algorithm to obtain a Karush-Kuhn-Tucker (KKT) point of an equivalent problem and a stationary point of an approximate problem, respectively. Finally, in the case of unknown joint device activity distribution, we develop an iterative algorithm to obtain a stationary point. The proposed solutions are widely applicable and outperform existing solutions for dependent and independent device activities.

preprint2022arXiv

Low-complexity Robust Optimization for an IRS-assisted Multi-Cell Network

The impacts of channel estimation errors, inter-cell interference, phase adjustment cost, and computation cost on an intelligent reflecting surface (IRS)-assisted system are severe in practice but have been ignored for simplicity in most existing works. In this paper, we investigate a multi-antenna base station (BS) serving a single-antenna user with the help of a multi-element IRS in the presence of channel estimation errors and inter-cell interference. We consider imperfect channel state information (CSI) at the BS, i.e., imperfect CSIT, and focus on the robust optimization of the BS's instantaneous CSI-adaptive beamforming and the IRS's quasi-static phase shifts. First, we formulate the robust optimization of the BS's instantaneous channel state information (CSI)-adaptive beamforming and IRS's quasi-static phase shifts for the ergodic rate maximization as a very challenging two-timescale stochastic non-convex problem. Then, we obtain a closed-form beamformer for any given phase shifts and a more tractable single-timescale stochastic non-convex problem only for phase shifts. Next, we propose a low-complexity stochastic algorithm to obtain quasi-static phase shifts which correspond to a KKT point of the single-timescale stochastic problem. It is worth noting that the proposed method offers a closed-form robust instantaneous CSI-adaptive beamforming design that can promptly adapt to rapid CSI changes over slots and a robust quasi-static phase shift design of low computation and phase adjustment costs in the presence of channel estimation errors and inter-cell interference. Finally, numerical results demonstrate the notable gains of the proposed robust joint design over existing ones and reveal the practical values of the proposed solutions.

preprint2022arXiv

Nonconvex and Nonsmooth Approaches for Affine Chance-Constrained Stochastic Programs

Chance-constrained programs (CCPs) constitute a difficult class of stochastic programs due to its possible nondifferentiability and nonconvexity even with simple linear random functionals. Existing approaches for solving the CCPs mainly deal with convex random functionals within the probability function. In the present paper, we consider two generalizations of the class of chance constraints commonly studied in the literature; one generalization involves probabilities of disjunctive nonconvex functional events and the other generalization involves mixed-signed affine combinations of the resulting probabilities; together, we coin the term affine chance constraint (ACC) system for these generalized chance constraints. Our proposed treatment of such an ACC system involves the fusion of several individually known ideas: (a) parameterized upper and lower approximations of the indicator function in the expectation formulation of probability; (b) external (i.e., fixed) versus internal (i.e., sequential) sampling-based approximation of the expectation operator; (c) constraint penalization as relaxations of feasibility; and (d) convexification of nonconvexity and nondifferentiability via surrogation. The integration of these techniques for solving the affine chance-constrained stochastic program (ACC-SP) with various degrees of practicality and computational efforts is the main contribution of this paper.

preprint2022arXiv

PointAttN: You Only Need Attention for Point Cloud Completion

Point cloud completion referring to completing 3D shapes from partial 3D point clouds is a fundamental problem for 3D point cloud analysis tasks. Benefiting from the development of deep neural networks, researches on point cloud completion have made great progress in recent years. However, the explicit local region partition like kNNs involved in existing methods makes them sensitive to the density distribution of point clouds. Moreover, it serves limited receptive fields that prevent capturing features from long-range context information. To solve the problems, we leverage the cross-attention and self-attention mechanisms to design novel neural network for processing point cloud in a per-point manner to eliminate kNNs. Two essential blocks Geometric Details Perception (GDP) and Self-Feature Augment (SFA) are proposed to establish the short-range and long-range structural relationships directly among points in a simple yet effective way via attention mechanism. Then based on GDP and SFA, we construct a new framework with popular encoder-decoder architecture for point cloud completion. The proposed framework, namely PointAttN, is simple, neat and effective, which can precisely capture the structural information of 3D shapes and predict complete point clouds with highly detailed geometries. Experimental results demonstrate that our PointAttN outperforms state-of-the-art methods by a large margin on popular benchmarks like Completion3D and PCN. Code is available at: https://github.com/ohhhyeahhh/PointAttN

preprint2022arXiv

Rate Splitting for General Multicast

Immersive video, such as virtual reality (VR) and multi-view videos, is growing in popularity. Its wireless streaming is an instance of general multicast, extending conventional unicast and multicast, whose effective design is still open. This paper investigates the optimization of general rate splitting with linear beamforming for general multicast. Specifically, we consider a multi-carrier single-cell wireless network where a multi-antenna base station (BS) communicates to multiple single-antenna users via general multicast. Linear beamforming is adopted at the BS, and joint decoding is adopted at each user. We consider the maximization of the weighted sum rate, which is a challenging nonconvex problem. Then, we propose an iterative algorithm for the problem to obtain a KKT point using the concave-convex procedure (CCCP). The proposed optimization framework generalizes the existing ones for rate splitting for various types of services. Finally, we numerically show substantial gains of the proposed solutions over existing schemes and reveal the design insights of general rate splitting for general multicast.

preprint2022arXiv

Sample-based and Feature-based Federated Learning for Unconstrained and Constrained Nonconvex Optimization via Mini-batch SSCA

Federated learning (FL) has become a hot research area in enabling the collaborative training of machine learning models among multiple clients that hold sensitive local data. Nevertheless, unconstrained federated optimization has been studied mainly using stochastic gradient descent (SGD), which may converge slowly, and constrained federated optimization, which is more challenging, has not been investigated so far. This paper investigates sample-based and feature-based federated optimization, respectively, and considers both unconstrained and constrained nonconvex problems for each of them. First, we propose FL algorithms using stochastic successive convex approximation (SSCA) and mini-batch techniques. These algorithms can adequately exploit the structures of the objective and constraint functions and incrementally utilize samples. We show that the proposed FL algorithms converge to stationary points and Karush-Kuhn-Tucker (KKT) points of the respective unconstrained and constrained nonconvex problems, respectively. Next, we provide algorithm examples with appealing computational complexity and communication load per communication round. We show that the proposed algorithm examples for unconstrained federated optimization are identical to FL algorithms via momentum SGD and provide an analytical connection between SSCA and momentum SGD. Finally, numerical experiments demonstrate the inherent advantages of the proposed algorithms in convergence speeds, communication and computation costs, and model specifications.

preprint2021arXiv

A tighter constraint on Earth-system sensitivity from long-term temperature and carbon-cycle observations

The long-term temperature response to a given change in CO2 forcing, or Earth-system sensitivity (ESS), is a key parameter quantifying our understanding about the relationship between changes in Earth's radiative forcing and the resulting long-term Earth-system response. Current ESS estimates are subject to sizable uncertainties. Long-term carbon cycle models can provide a useful avenue to constrain ESS, but previous efforts either use rather informal statistical approaches or focus on discrete paleoevents. Here, we improve on previous ESS estimates by using a Bayesian approach to fuse deep-time CO2 and temperature data over the last 420 Myrs with a long-term carbon cycle model. Our median ESS estimate of 3.4 deg C (2.6-4.7 deg C; 5-95% range) shows a narrower range than previous assessments. We show that weaker chemical weathering relative to the a priori model configuration via reduced weatherable land area yields better agreement with temperature records during the Cretaceous. Research into improving the understanding about these weathering mechanisms hence provides potentially powerful avenues to further constrain this fundamental Earth-system property.

preprint2021arXiv

Device Activity Detection for Massive Grant-Free Access Under Frequency-Selective Rayleigh Fading

Device activity detection and channel estimation for massive grant-free access under frequency-selective fading have unfortunately been an outstanding problem. This paper aims to address the challenge. Specifically, we present an orthogonal frequency division multiplexing (OFDM)-based massive grant-free access scheme for a wideband system with one M-antenna base station (BS), N single-antenna Internet of Things (IoT) devices, and P channel taps. We obtain two different but equivalent models for the received pilot signals under frequency-selective Rayleigh fading. Based on each model, we formulate device activity detection as a non-convex maximum likelihood estimation (MLE) problem and propose an iterative algorithm to obtain a stationary point using optimal techniques. The two proposed MLE-based methods have the identical computational complexity order O(NPL^2), irrespective of M, and degrade to the existing MLE-based device activity detection method when P=1. Conventional channel estimation methods can be readily applied for channel estimation of detected active devices under frequency-selective Rayleigh fading, based on one of the derived models for the received pilot signals. Numerical results show that the two proposed methods have different preferable system parameters and complement each other to offer promising device activity detection design for grant-free massive access under frequency-selective Rayleigh fading.

preprint2021arXiv

Statistical Device Activity Detection for OFDM-based Massive Grant-Free Access

Existing works on grant-free access, proposed to support massive machine-type communication (mMTC) for the Internet of things (IoT), mainly concentrate on narrow band systems under flat fading. However, little is known about massive grant-free access for wideband systems under frequency-selective fading. This paper investigates massive grant-free access in a wideband system under frequency-selective fading. First, we present an orthogonal frequency division multiplexing (OFDM)-based massive grant-free access scheme. Then, we propose two different but equivalent models for the received pilot signal, which are essential for designing various device activity detection and channel estimation methods for OFDM-based massive grant-free access. One directly models the received signal for actual devices, whereas the other can be interpreted as a signal model for virtual devices. Next, we investigate statistical device activity detection under frequency-selective Rayleigh fading based on the two signal models. We first model device activities as unknown deterministic quantities and propose three maximum likelihood (ML) estimation-based device activity detection methods with different detection accuracies and computation times. We also model device activities as random variables with a known joint distribution and propose three maximum a posterior probability (MAP) estimation-based device activity methods, which further enhance the accuracies of the corresponding ML estimation-based methods. Optimization techniques and matrix analysis are applied in designing and analyzing these methods. Finally, numerical results show that the proposed statistical device activity detection methods outperform existing state-of-the-art device activity detection methods under frequency-selective Rayleigh fading.

preprint2020arXiv

Insights on pion production mechanism and symmetry energy at high density

The $NΔ\to NN$ cross sections, which take into account the $Δ$-mass dependence of M-matrix and momentum $p_{NΔ}$, are applied on the calculation of pion production within the framework of the UrQMD model. Our study shows that UrQMD calculations with the $Δ$-mass dependent $NΔ\to NN$ cross sections enhance the pion multiplicities and decrease the $π^-/π^+$ ratios. By analyzing the time evolution of the pion production rate and the density in the overlapped region for Au+Au at the beam energy of 0.4A GeV, we find that the pion multiplicity probes the symmetry energy in the region of 1-2 times normal density. The process of pion production in the reaction is tracked including the loops of $NN\leftrightarrow NΔ$ and $Δ\leftrightarrow Nπ$, our calculations show that the sensitivity of $π^-/π^+$ to symmetry energy is weakened after 4-5 N-$Δ$-$π$ loops in the pion production path, while the $π^{-}/π^{+}$ ratio in reactions at near threshold energies remains its sensitivity to the symmetry energy. By comparing the calculations to the FOPI data, we obtain a model dependent conclusion on the symmetry energy and the symmetry energy at two times normal density is $S(2ρ_0)$=38-73 MeV within $1σ$ uncertainties. Under the constraints of tidal deformability and maximum mass of neutron star, the symmetry energy at two times normal density is reduced to $48-58$ MeV and slope of symmetry energy $L=54-81$ MeV, and it is consistent with the constraints from ASY-EOS flow data.

preprint2020arXiv

Joint Optimal Software Caching, Computation Offloading and Communications Resource Allocation for Mobile Edge Computing

As software may be used by multiple users, caching popular software at the wireless edge has been considered to save computation and communications resources for mobile edge computing (MEC). However, fetching uncached software from the core network and multicasting popular software to users have so far been ignored. Thus, existing design is incomplete and less practical. In this paper, we propose a joint caching, computation and communications mechanism which involves software fetching, caching and multicasting, as well as task input data uploading, task executing (with non-negligible time duration) and computation result downloading, and mathematically characterize it. Then, we optimize the joint caching, offloading and time allocation policy to minimize the weighted sum energy consumption subject to the caching and deadline constraints. The problem is a challenging two-timescale mixed integer nonlinear programming (MINLP) problem, and is NP-hard in general. We convert it into an equivalent convex MINLP problem by using some appropriate transformations and propose two low-complexity algorithms to obtain suboptimal solutions of the original non-convex MINLP problem. Specifically, the first suboptimal solution is obtained by solving a relaxed convex problem using the consensus alternating direction method of multipliers (ADMM), and then rounding its optimal solution properly. The second suboptimal solution is proposed by obtaining a stationary point of an equivalent difference of convex (DC) problem using the penalty convex-concave procedure (Penalty-CCP) and ADMM. Finally, by numerical results, we show that the proposed solutions outperform existing schemes and reveal their advantages in efficiently utilizing storage, computation and communications resources.

preprint2020arXiv

Joint Optimization of File Placement and Delivery in Cache-Assisted Wireless Networks with Limited Lifetime and Cache Space

In this paper, the scheduling of downlink file transmission in one cell with the assistance of cache nodes with finite cache space is studied. Specifically, requesting users arrive randomly and the base station (BS) reactively multicasts files to the requesting users and selected cache nodes. The latter can offload the traffic in their coverage areas from the BS. We consider the joint optimization of the abovementioned file placement and delivery within a finite lifetime subject to the cache space constraint. Within the lifetime, the allocation of multicast power and symbol number for each file transmission at the BS is formulated as a dynamic programming problem with a random stage number. Note that there are no existing solutions to this problem. We develop an asymptotically optimal solution framework by transforming the original problem to an equivalent finite-horizon Markov decision process (MDP) with a fixed stage number. A novel approximation approach is then proposed to address the curse of dimensionality, where the analytical expressions of approximate value functions are provided. We also derive analytical bounds on the exact value function and approximation error. The approximate value functions depend on some system statistics, e.g., requesting users' distribution. One reinforcement learning algorithm is proposed for the scenario where these statistics are unknown.

preprint2020arXiv

Jointly Sparse Signal Recovery and Support Recovery via Deep Learning with Applications in MIMO-based Grant-Free Random Access

In this paper, we investigate jointly sparse signal recovery and jointly sparse support recovery in Multiple Measurement Vector (MMV) models for complex signals, which arise in many applications in communications and signal processing. Recent key applications include channel estimation and device activity detection in MIMO-based grant-free random access which is proposed to support massive machine-type communications (mMTC) for Internet of Things (IoT). Utilizing techniques in compressive sensing, optimization and deep learning, we propose two model-driven approaches, based on the standard auto-encoder structure for real numbers. One is to jointly design the common measurement matrix and jointly sparse signal recovery method, and the other aims to jointly design the common measurement matrix and jointly sparse support recovery method. The proposed model-driven approaches can effectively utilize features of sparsity patterns in designing common measurement matrices and adjusting model-driven decoders, and can greatly benefit from the underlying state-of-the-art recovery methods with theoretical guarantee. Hence, the obtained common measurement matrices and recovery methods can significantly outperform the underlying advanced recovery methods. We conduct extensive numerical results on channel estimation and device activity detection in MIMO-based grant-free random access. The numerical results show that the proposed approaches provide pilot sequences and channel estimation or device activity detection methods which can achieve higher estimation or detection accuracy with shorter computation time than existing ones. Furthermore, the numerical results explain how such gains are achieved via the proposed approaches.

preprint2020arXiv

Jointly Sparse Signal Recovery via Deep Auto-Encoder and Parallel Coordinate Descent Unrolling

In this paper, utilizing techniques in compressed sensing, parallel optimization and deep learning, we propose a model-driven approach to jointly design the common measurement matrix and GROUP LASSO-based jointly sparse signal recovery method for complex sparse signals, based on the standard auto-encoder structure for real numbers. The encoder achieves noisy linear compression for jointly sparse signals, with a common measurement matrix. The GROUP LASSO-based decoder realizes jointly sparse signal recovery based on an iterative parallel-coordinate descent (PCD) algorithm which is proposed to solve GROUP LASSO in a parallel manner. In particular, the decoder consists of an approximation part which unfolds (several iterations of) the proposed iterative algorithm to obtain an approximate solution of GROUP LASSO and a correction part which reduces the difference between the approximate solution and the actual jointly sparse signals. The proposed model-driven approach achieves higher recovery accuracy with less computation time than the classic GROUP LASSO method, and the gain significantly increases in the presence of extra structures in sparse patterns. The common measurement matrix obtained by the proposed model-driven approach is also suitable for the classic GROUP LASSO method. We consider an application example, i.e., channel estimation in Multiple-Input Multiple-Output (MIMO)-based grant-free random access which is proposed to support massive machine-type communications (mMTC) for Internet of Things (IoT). By numerical results, we demonstrate the substantial gains of the proposed model-driven approach over GROUP LASSO and AMP when the number of jointly sparse signals is not very large.

preprint2020arXiv

Jointly Sparse Support Recovery via Deep Auto-encoder with Applications in MIMO-based Grant-Free Random Access for mMTC

In this paper, a data-driven approach is proposed to jointly design the common sensing (measurement) matrix and jointly support recovery method for complex signals, using a standard deep auto-encoder for real numbers. The auto-encoder in the proposed approach includes an encoder that mimics the noisy linear measurement process for jointly sparse signals with a common sensing matrix, and a decoder that approximately performs jointly sparse support recovery based on the empirical covariance matrix of noisy linear measurements. The proposed approach can effectively utilize the feature of common support and properties of sparsity patterns to achieve high recovery accuracy, and has significantly shorter computation time than existing methods. We also study an application example, i.e., device activity detection in Multiple-Input Multiple-Output (MIMO)-based grant-free random access for massive machine type communications (mMTC). The numerical results show that the proposed approach can provide pilot sequences and device activity detection with better detection accuracy and substantially shorter computation time than well-known recovery methods.

preprint2020arXiv

ML Estimation and MAP Estimation for Device Activities in Grant-Free Random Access with Interference

Device activity detection is one main challenge in grant-free random access, which is recently proposed to support massive access for massive machine-type communications (mMTC). Existing solutions fail to consider interference generated by massive Internet of Things (IoT) devices, or important prior information on device activities and interference. In this paper, we consider device activity detection at an access point (AP) in the presence of interference generated by massive devices from other cells. We consider the joint maximum likelihood (ML) estimation and the joint maximum a posterior probability (MAP) estimation of both the device activities and interference powers, jointly utilizing tools from probability, stochastic geometry and optimization. Each estimation problem is a difference of convex (DC) programming problem, and a coordinate descent algorithm is proposed to obtain a stationary point. The proposed ML estimation extends the existing ML estimation by considering the estimation of interference powers together with the estimation of device activities. The proposed MAP estimation further enhances the proposed ML estimation by exploiting prior distributions of device activities and interference powers. Numerical results show the substantial gains of the proposed joint estimation designs, and reveal the importance of explicit consideration of interference and the value of prior information in device activity detection.

preprint2020arXiv

Optimal Streaming of 360 VR Videos with Perfect, Imperfect and Unknown FoV Viewing Probabilities

In this paper, we investigate wireless streaming of multi-quality tiled 360 virtual reality (VR) videos from a multi-antenna server to multiple single-antenna users in a multi-carrier system. To capture the impact of field-of-view (FoV) prediction, we consider three cases of FoV viewing probability distributions, i.e., perfect, imperfect and unknown FoV viewing probability distributions, and use the average total utility, worst average total utility and worst total utility as the respective performance metrics. We adopt rate splitting with successive decoding for efficient transmission of multiple sets of tiles of different 360 VR videos to their requesting users. In each case, we optimize the encoding rates of the tiles, minimum encoding rates of the FoVs, rates of the common and private messages and transmission beamforming vectors to maximize the total utility. The problems in the three cases are all challenging nonconvex optimization problems. We successfully transform the problem in each case into a difference of convex (DC) programming problem with a differentiable objective function, and obtain a suboptimal solution using concave-convex procedure (CCCP). Finally, numerical results demonstrate the proposed solutions achieve notable gains over existing schemes in all three cases. To the best of our knowledge, this is the first work revealing the impact of FoV prediction and its accuracy on the performance of streaming of multi-quality tiled 360 VR videos.

preprint2020arXiv

Optimal Transmission of Multi-Quality Tiled 360 VR Video by Exploiting Multicast Opportunities

In this paper, we would like to investigate fundamental impacts of multicast opportunities on efficient transmission of a 360 VR video to multiple users in the cases with and without transcoding at each user. We establish a novel mathematical model that reflects the impacts of multicast opportunities on the average transmission energy in both cases and the transcoding energy in the case with user transcoding, and facilitates the optimal exploitation of transcoding-enabled multicast opportunities. In the case without user transcoding, we optimize the transmission resource allocation to minimize the average transmission energy by exploiting natural multicast opportunities. The problem is nonconvex. We transform it to an equivalent convex problem and obtain an optimal solution using standard convex optimization techniques. In the case with user transcoding, we optimize the transmission resource allocation and the transmission quality level selection to minimize the weighted sum of the average transmission energy and the transcoding energy by exploiting both natural and transcoding-enabled multicast opportunities. The problem is a challenging mixed discrete-continuous optimization problem. We transform it to a Difference of Convex (DC) programming problem and obtain a suboptimal solution using a DC algorithm. Finally, numerical results demonstrate the importance of effective exploitation of transcoding-enabled multicast opportunities in the case with user transcoding.

preprint2020arXiv

Optimal Wireless Streaming of Multi-Quality 360 VR Video by Exploiting Natural, Relative Smoothness-enabled and Transcoding-enabled Multicast Opportunities

In this paper, we would like to investigate optimal wireless streaming of a multi-quality tiled 360 virtual reality (VR) video from a server to multiple users. To this end, we propose to maximally exploit potential multicast opportunities by effectively utilizing characteristics of multi-quality tiled 360 VR videos and computation resources at the users' side. In particular, we consider two requirements for quality variation in one field-of-view (FoV), i.e., the absolute smoothness requirement and the relative smoothness requirement, and two video playback modes, i.e., the direct-playback mode (without user transcoding) and transcode-playback mode (with user transcoding). Besides natural multicast opportunities, we introduce two new types of multicast opportunities, namely, relative smoothness-enabled multicast opportunities, which allow flexible tradeoff between viewing quality and communications resource consumption, and transcoding-enabled multicast opportunities, which allow flexible tradeoff between computation and communications resource consumptions. Then, we establish a novel mathematical model that reflects the impacts of natural, relative smoothness-enabled and transcoding-enabled multicast opportunities on the average transmission energy and transcoding energy. Based on this model, we optimize the transmission resource allocation, playback quality level selection and transmission quality level selection to minimize the energy consumption in the four cases with different requirements for quality variation and video playback modes. By comparing the optimal values in the four cases, we prove that the energy consumption reduces when more multicast opportunities can be utilized. Finally, numerical results show substantial gains of the proposed solutions over existing schemes, and demonstrate the importance of effective exploitation of the three types of multicast opportunities.

preprint2020arXiv

Rate Splitting for Multi-Antenna Downlink: Precoder Design and Practical Implementation

Rate splitting (RS) is a potentially powerful and flexible technique for multi-antenna downlink transmission. In this paper, we address several technical challenges towards its practical implementation for beyond 5G systems. To this end, we focus on a single-cell system with a multi-antenna base station (BS) and K single-antenna receivers. We consider RS in its most general form, and joint decoding to fully exploit the potential of RS. First, we investigate the achievable rates under joint decoding and formulate the precoder design problems to maximize a general utility function, or to minimize the transmit power under pre-defined rate targets. Building upon the concave-convex procedure (CCCP), we propose precoder design algorithms for an arbitrary number of users. Our proposed algorithms approximate the intractable non-convex problems with a number of successively refined convex problems, and provably converge to stationary points of the original problems. Then, to reduce the decoding complexity, we consider the optimization of the precoder and the decoding order under successive decoding. Further, we propose a stream selection algorithm to reduce the number of precoded signals. With a reduced number of streams and successive decoding at the receivers, our proposed algorithm can even be implemented when the number of users is relatively large, whereas the complexity was previously considered as prohibitively high in the same setting. Finally, we propose a simple adaptation of our algorithms to account for the imperfection of the channel state information at the transmitter. Numerical results demonstrate that the general RS scheme provides a substantial performance gain as compared to state-of-the-art linear precoding schemes, especially with a moderately large number of users.

preprint2019arXiv

Optimal Multi-View Video Transmission in Multiuser Wireless Networks by Exploiting Natural and View Synthesis-Enabled Multicast Opportunities

Multi-view videos (MVVs) provide immersive viewing experience, at the cost of traffic load increase for wireless networks. In this paper, we would like to optimize MVV transmission in a multiuser wireless network by exploiting both natural multicast opportunities and view synthesis-enabled multicast opportunities. Specifically, we first establish a mathematical model to specify view synthesis at the server and each user, and characterize its impact on multicast opportunities. This model is highly nontrivial and fundamentally enables the optimization of view synthesis-based multicast opportunities. For given video quality requirements of all users, we consider the optimization of view selection, transmission time and power allocation to minimize the average weighted sum energy consumption for view transmission and synthesis. In addition, under the energy consumption constraints at the server and each user respectively, we consider the optimization of view selection, transmission time and power allocation and video quality selection to maximize the total utility. These two optimization problems are challenging mixed discrete-continuous optimization problems. For the first problem, we propose an algorithm to obtain an optimal solution with reduced computational complexity by exploiting optimality properties. For each problem, to reduce computational complexity, we also propose a low-complexity algorithm to obtain a suboptimal solution, using Difference of Convex (DC) programming. Finally, numerical results show the advantage of the proposed solutions over existing ones, and demonstrate the importance of the optimization of view synthesis-enabled multicast opportunities in MVV transmission.

preprint2019arXiv

Optimal Multi-View Video Transmission in OFDMA Systems

In this letter, we study the transmission of a multi-view video (MVV) to multiple users in an Orthogonal Frequency Division Multiple Access (OFDMA) system. To maximally improve transmission efficiency, we exploit both natural multicast opportunities and view synthesis-enabled multicast opportunities. First, we establish a communication model for transmission of a MVV to multiple users in an OFDMA system. Then, we formulate the minimization problem of the average weighted sum energy consumption for view transmission and synthesis with respect to view selection and transmission power and subcarrier allocation. The optimization problem is a challenging mixed discrete-continuous optimization problem with huge numbers of variables and constraints. A low-complexity algorithm is proposed to obtain a suboptimal solution. Finally, numerical results further demonstrate the value of view synthesis-enabled multicast opportunities for MVV transmission in OFDMA systems.