arXiv subjects

Yunlong Cai

Publications and source records attributed to Yunlong Cai.

87 records · Page 5Linked to original sources

arXiv2018

An Edge-Computing Based Architecture for Mobile Augmented Reality

In order to mitigate the long processing delay and high energy consumption of mobile augmented reality (AR) applications, mobile edge computing (MEC) has been recently proposed and is envisioned as a promising means to deliver better quality of experience (QoE) for AR consumers. In this article, we first present a comprehensive AR overview, including the indispensable components of general AR applications, fashionable AR devices, and several existing techniques for overcoming the thorny latency and energy consumption problems. Then, we propose a novel hierarchical computation architecture by inserting an edge layer between the conventional user layer and cloud layer. Based on the proposed architecture, we further develop an innovated operation mechanism to improve the performance of mobile AR applications. Three key technologies are also discussed to further assist the proposed AR architecture. Simulation results are finally provided to verify that our proposals can significantly improve the latency and energy performance as compared against existing baseline schemes.

cs.IT↗

arXiv2018

UAV Communications Based on Non-Orthogonal Multiple Access

This article proposes a novel framework for unmaned aerial vehicle (UAV) networks with massive access capability supported by non-orthogonal multiple access (NOMA). In order to better understand NOMA enabled UAV networks, three case studies are carried out. We first provide performance evaluation of NOMA enabled UAV networks by adopting stochastic geometry to model the positions of UAVs and ground users. Then we investigate the joint trajectory design and power allocation for static NOMA users based on a simplified two-dimensional (2D) model that UAV is flying around at fixed height. As a further advance, we demonstrate the UAV placement issue with the aid of machine learning techniques when the ground users are roaming and the UAVs are capable of adjusting their positions in three-dimensions (3D) accordingly. With these case studies, we can comprehensively understand the UAV systems from fundamental theory to practical implementation.

eess.SP↗

arXiv2017

Joint Cooperative Computation and Interactive Communication for Relay-Assisted Mobile Edge Computing

To realize cooperative computation and communication in a relay mobile edge computing system, we develop a hybrid relay forward protocol, where we seek to balance the execution delay and network energy consumption. The problem is formulated as a nondifferentible optimization problem which is nonconvex with highly coupled constraints. By exploiting the problem structure, we propose a lightweight algorithm based on inexact block coordinate descent method. Our results show that the proposed algorithm exhibits much faster convergence as compared with the popular concave-convex procedure based algorithm, while achieving good performance.

cs.IT↗

arXiv2017

A Simple Two-stage Equalizer With Simplified Orthogonal Time Frequency Space Modulation Over Rapidly Time-varying Channels

In this work, we derive a equivalent delay-Doppler channel matrix of the Orthogonal Time Frequency Space (OTFS) modulation that has not been studied in previous literature. It has the similar structure as the banded channel matrix of OFDM systems over rapidly time-varying channels. However, the band in the equivalent channel matrix will no longer spread with the increase of the Doppler spread once the length of maximum channel delay spread and the OTFS frame duration are deter- mined. Furthermore, the equivalent channel matrix can simplify the OTFS modulation in the transmitter side. Incorporating the equivalent channel matrix, we propose a simple two-stage equal- izer in 1 dimensional operations for OTFS modulation. First, the receive signal is equalized using the conventional OFDM single- tap equalizer in the frequency domain. The multipath effects can be removed. In the second stage, another low complexity delay- Doppler domain equalizer is employed to eliminate the effects of the residual interference caused by the Doppler spread with the equivalent channel matrix. The simulation results demonstrate that the proposed method is superior to the conventional single- tap equalizer and full minimum mean squared error (MMSE) equalizer of OFDM systems in terms of BER in high Doppler spread scenarios.

cs.IT↗

arXiv2017

Latency Optimization for Resource Allocation in Mobile-Edge Computation Offloading

By offloading intensive computation tasks to the edge cloud located at the cellular base stations, mobile-edge computation offloading (MECO) has been regarded as a promising means to accomplish the ambitious millisecond-scale end-to-end latency requirement of the fifth-generation networks. In this paper, we investigate the latency-minimization problem in a multi-user time-division multiple access MECO system with joint communication and computation resource allocation. Three different computation models are studied, i.e., local compression, edge cloud compression, and partial compression offloading. First, closed-form expressions of optimal resource allocation and minimum system delay for both local and edge cloud compression models are derived. Then, for the partial compression offloading model, we formulate a piecewise optimization problem and prove that the optimal data segmentation strategy has a piecewise structure. Based on this result, an optimal joint communication and computation resource allocation algorithm is developed. To gain more insights, we also analyze a specific scenario where communication resource is adequate while computation resource is limited. In this special case, the closed-form solution of the piecewise optimization problem can be derived. Our proposed algorithms are finally verified by numerical results, which show that the novel partial compression offloading model can significantly reduce the end-to-end latency.

cs.IT↗

arXiv2017

Modulation and Multiple Access for 5G Networks

Fifth generation (5G) wireless networks face various challenges in order to support large-scale heterogeneous traffic and users, therefore new modulation and multiple access (MA) schemes are being developed to meet the changing demands. As this research space is ever increasing, it becomes more important to analyze the various approaches, therefore in this article we present a comprehensive overview of the most promising modulation and MA schemes for 5G networks. We first introduce the different types of modulation that indicate their potential for orthogonal multiple access (OMA) schemes and compare their performance in terms of spectral efficiency, out-of-band leakage, and bit-error rate. We then pay close attention to various types of non-orthogonal multiple access (NOMA) candidates, including power-domain NOMA, code-domain NOMA, and NOMA multiplexing in multiple domains. From this exploration we can identify the opportunities and challenges that will have significant impact on the design of modulation and MA for 5G networks.

cs.OH↗

arXiv2016

Joint Source-Relay Design for Full--Duplex MIMO AF Relay Systems

The performance of full-duplex (FD) relay systems can be greatly impacted by the self-interference (SI) at relays. By exploiting multi-antenna in FD relay systems, the spectral efficiency of FD relay systems can be enhanced through spatial SI mitigation. This paper studies joint source transmit beamforming and relay processing to achieve rate maximization for FD MIMO amplify-and-forward (AF) relay systems with consideration of relay processing delay. The problem is difficult to solve due mainly to the SI constraint induced by the relay processing delay. In this paper, we first present a sufficient condition under which the relay amplification matrix has rank one structure. Then, for the case of rank one amplification matrix, the rate maximization problem is equivalently simplified into an unconstrained problem which can be locally solved using gradient ascent method. Next, we propose a penalty-based algorithmic framework, called P-BSUM, for a class of constrained optimization problems which have difficult equality constraints in addition to some convex constraints. By rewriting the rate maximization problem with a set of auxiliary variables, we apply the P-BSUM algorithm to the rate maximization problem in the general case. Finally, numerical results validate the efficiency of the proposed algorithms and show that the joint source-relay design approach under the rank one assumption could be strictly suboptimal as compared to the P-BSUM-based joint source-relay design approach.

cs.IT↗

arXiv2016

Efficient Reduced-Rank DOA Estimation Algorithms Using Alternating Low-Rank Decompositions

In this work, we propose an alternating low-rank decomposition (ALRD) approach and novel subspace algorithms for direction-of-arrival (DOA) estimation. In the ALRD scheme, the decomposition matrix for rank reduction is composed of a set of basis vectors. A low-rank auxiliary parameter vector is then employed to compute the output power spectrum. Alternating optimization strategies based on recursive least squares (RLS), denoted as ALRD-RLS and modified ALRD-RLS (MARLD-RLS), are devised to compute the basis vectors and the auxiliary parameter vector. Simulations for large sensor arrays with both uncorrelated and correlated sources are presented, showing that the proposed algorithms are superior to existing techniques.

cs.IT↗

arXiv2015

Joint Transceiver Design Algorithms for Multiuser MISO Relay Systems with Energy Harvesting

In this paper, we investigate a multiuser relay system with simultaneous wireless information and power transfer. Assuming that both base station (BS) and relay station (RS) are equipped with multiple antennas, this work studies the joint transceiver design problem for the BS beamforming vectors, the RS amplify-and-forward transformation matrix and the power splitting (PS) ratios at the single-antenna receivers. Firstly, an iterative algorithm based on alternating optimization (AO) and with guaranteed convergence is proposed to successively optimize the transceiver coefficients. Secondly, a novel design scheme based on switched relaying (SR) is proposed that can significantly reduce the computational complexity and overhead of the AO based designs while maintaining a similar performance. In the proposed SR scheme, the RS is equipped with a codebook of permutation matrices. For each permutation matrix, a latent transceiver is designed which consists of BS beamforming vectors, optimally scaled RS permutation matrix and receiver PS ratios. For the given CSI, the optimal transceiver with the lowest total power consumption is selected for transmission. We propose a concave-convex procedure based and subgradient-type iterative algorithms for the non-robust and robust latent transceiver designs. Simulation results are presented to validate the effectiveness of all the proposed algorithms.

cs.IT↗

arXiv2015

Robust Transceiver Design for MISO Interference Channel with Energy Harvesting

In this paper, we consider multiuser multiple-input single-output (MISO) interference channel where the received signal is divided into two parts for information decoding and energy harvesting (EH), respectively. The transmit beamforming vectors and receive power splitting (PS) ratios are jointly designed in order to minimize the total transmission power subject to both signal-to-interference-plus-noise ratio (SINR) and EH constraints. Most joint beamforming and power splitting (JBPS) designs assume that perfect channel state information (CSI) is available; however CSI errors are inevitable in practice. To overcome this limitation, we study the robust JBPS design problem assuming a norm-bounded error (NBE) model for the CSI. Three different solution approaches are proposed for the robust JBPS problem, each one leading to a different computational algorithm. Firstly, an efficient semidefinite relaxation (SDR)-based approach is presented to solve the highly non-convex JBPS problem, where the latter can be formulated as a semidefinite programming (SDP) problem. A rank-one recovery method is provided to recover a robust feasible solution to the original problem. Secondly, based on second order cone programming (SOCP) relaxation, we propose a low complexity approach with the aid of a closed-form robust solution recovery method. Thirdly, a new iterative method is also provided which can achieve near-optimal performance when the SDR-based algorithm results in a higher-rank solution. We prove that this iterative algorithm monotonically converges to a Karush-Kuhn-Tucker (KKT) solution of the robust JBPS problem. Finally, simulation results are presented to validate the robustness and efficiency of the proposed algorithms.

cs.IT↗

arXiv2014

Set-Membership Adaptive Constant Modulus Algorithm with a Generalized Sidelobe Canceler and Dynamic Bounds for Beamforming

In this work, we propose an adaptive set-membership constant modulus (SM-CM) algorithm with a generalized sidelobe canceler (GSC) structure for blind beamforming. We develop a stochastic gradient (SG) type algorithm based on the concept of SM filtering for adaptive implementation. The filter weights are updated only if the constraint cannot be satisfied. In addition, we also propose an extension of two schemes of time-varying bounds for beamforming with a GSC structure and incorporate parameter and interference dependence to characterize the environment which improves the tracking performance of the proposed algorithm in dynamic scenarios. A convergence analysis of the proposed adaptive SM filtering techniques is carried out. Simulation results show that the proposed adaptive SM-CM-GSC algorithm with dynamic bounds achieves superior performance to previously reported methods at a reduced update rate.

cs.IT↗

arXiv2013

Low-Complexity Constrained Constant Modulus SG-based Beamforming Algorithms with Variable Step Size

In this paper, two low-complexity adaptive step size algorithms are investigated for blind adaptive beamforming. Both of them are used in a stochastic gradient (SG) algorithm, which employs the constrained constant modulus (CCM) criterion as the design approach. A brief analysis is given for illustrating their properties. Simulations are performed to compare the performances of the novel algorithms with other well-known methods. Results indicate that the proposed algorithms achieve superior performance, better convergence behavior and lower computational complexity in both stationary and non-stationary environments.

cs.IT↗

arXiv2013

Low-Complexity Variable Forgetting Factor Techniques for RLS Algorithms in Interference Rejection Applications

We propose a low-complexity variable forgetting factor (VFF) mechanism for recursive least square (RLS) algorithms in interference suppression applications. The proposed VFF mechanism employs an updated component related to the time average of the error correlation to automatically adjust the forgetting factor in order to ensure fast convergence and good tracking of the interference and the channel. Convergence and tracking analyses are carried out and analytical expressions for predicting the mean squared error of the proposed adaptation technique are obtained. Simulation results for a direct-sequence code-division multiple access (DS-CDMA) system are presented in nonstationary environments and show that the proposed VFF mechanism achieves superior performance to previously reported methods at a reduced complexity.

cs.IT↗

arXiv2013

Adaptive Minimum BER Reduced-Rank Interference Suppression Algorithms Based on Joint and Iterative Optimization of Parameters

In this letter, we propose a novel adaptive reduced-rank strategy based on joint iterative optimization (JIO) of filters according to the minimization of the bit error rate (BER) cost function. The proposed optimization technique adjusts the weights of a subspace projection matrix and a reduced-rank filter jointly. We develop stochastic gradient (SG) algorithms for their adaptive implementation and introduce a novel automatic rank selection method based on the BER criterion. Simulation results for direct-sequence code-division-multiple-access (DS-CDMA) systems show that the proposed adaptive algorithms significantly outperform the existing schemes.

cs.IT↗

arXiv2013

Adaptive Minimum BER Reduced-Rank Linear Detection for Massive MIMO Systems

In this paper, we propose a novel adaptive reduced-rank strategy for very large multiuser multi-input multi-output (MIMO) systems. The proposed reduced-rank scheme is based on the concept of joint iterative optimization (JIO) of filters according to the minimization of the bit error rate (BER) cost function. The proposed optimization technique adjusts the weights of a projection matrix and a reduced-rank filter jointly. We develop stochastic gradient (SG) algorithms for their adaptive implementation and introduce a novel automatic rank selection method based on the BER criterion. Simulation results for multiuser MIMO systems show that the proposed adaptive algorithms significantly outperform existing schemes.

cs.IT↗