Searcharxiv⌕ Search

arXiv subjects

Jun Zhang

Publications and source records attributed to Jun Zhang.

At least 1,117 records · Page 62Linked to original sources
arXiv2016

New Constructions of MDS Symbol-Pair Codes

Motivated by the application of high-density data storage technologies, symbol-pair codes are proposed to protect against pair-errors in symbol-pair channels, whose outputs are overlapping pairs of symbols. The research of symbol-pair codes with the largest minimum pair-distance is interesting since such codes have the best possible error-correcting capability. A symbol-pair code attaining the maximal minimum pair-distance is called a maximum distance separable (MDS) symbol-pair code. In this paper, we focus on constructing linear MDS symbol-pair codes over the finite field $\mathbb{F}_{q}$. We show that a linear MDS symbol-pair code over $\mathbb{F}_{q}$ with pair-distance $5$ exists if and only if the length $n$ ranges from $5$ to $q^2+q+1$. As for codes with pair-distance $6$, length ranging from $6$ to $q^{2}+1$, we construct linear MDS symbol-pair codes by using a configuration called ovoid in projective geometry. With the help of elliptic curves, we present a construction of linear MDS symbol-pair codes for any pair-distance $d+2$ with length $n$ satisfying $7\le d+2\leq n\le q+\lfloor 2\sqrt{q}\rfloor+δ(q)-3$, where $δ(q)=0$ or $1$.

cs.IT↗
arXiv2016

Dynamic Computation Offloading for Mobile-Edge Computing with Energy Harvesting Devices

Mobile-edge computing (MEC) is an emerging paradigm to meet the ever-increasing computation demands from mobile applications. By offloading the computationally intensive workloads to the MEC server, the quality of computation experience, e.g., the execution latency, could be greatly improved. Nevertheless, as the on-device battery capacities are limited, computation would be interrupted when the battery energy runs out. To provide satisfactory computation performance as well as achieving green computing, it is of significant importance to seek renewable energy sources to power mobile devices via energy harvesting (EH) technologies. In this paper, we will investigate a green MEC system with EH devices and develop an effective computation offloading strategy. The execution cost, which addresses both the execution latency and task failure, is adopted as the performance metric. A low-complexity online algorithm, namely, the Lyapunov optimization-based dynamic computation offloading (LODCO) algorithm is proposed, which jointly decides the offloading decision, the CPU-cycle frequencies for mobile execution, and the transmit power for computation offloading. A unique advantage of this algorithm is that the decisions depend only on the instantaneous side information without requiring distribution information of the computation task request, the wireless channel, and EH processes. The implementation of the algorithm only requires to solve a deterministic problem in each time slot, for which the optimal solution can be obtained either in closed form or by bisection search. Moreover, the proposed algorithm is shown to be asymptotically optimal via rigorous analysis. Sample simulation results shall be presented to verify the theoretical analysis as well as validate the effectiveness of the proposed algorithm.

cs.IT↗
arXiv2016

Mobility-Aware Caching for Content-Centric Wireless Networks: Modeling and Methodology

As mobile services are shifting from "connection-centric" communications to "content-centric" communications, content-centric wireless networking emerges as a promising paradigm to evolve the current network architecture. Caching popular content at the wireless edge, including base stations (BSs) and user terminals (UTs), provides an effective approach to alleviate the heavy burden on backhaul links, as well as lowering delays and deployment costs. In contrast to wired networks, a unique characteristic of content-centric wireless networks (CCWNs) is the mobility of mobile users. While it has rarely been considered by existing works in caching design, user mobility contains various helpful side information that can be exploited to improve caching efficiency at both BSs and UTs. In this paper, we present a general framework on mobility-aware caching in CCWNs. Key properties of user mobility patterns that are useful for content caching will be firstly identified, and then different design methodologies for mobility-aware caching will be proposed. Moreover, two design examples will be provided to illustrate the proposed framework in details, and interesting future research directions will be identified.

cs.IT↗
arXiv2016

Magnetic reconnection between a solar filament and nearby coronal loops

Magnetic reconnection, the rearrangement of magnetic field topology, is a fundamental physical process in magnetized plasma systems all over the universe1,2. Its process is difficult to be directly observed. Coronal structures, such as coronal loops and filament spines, often sketch the magnetic field geometry and its changes in the solar corona3. Here we show a highly suggestive observation of magnetic reconnection between an erupting solar filament and its nearby coronal loops, resulting in changes in connection of the filament. X-type structures form when the erupting filament encounters the loops. The filament becomes straight, and bright current sheets form at the interfaces with the loops. Many plasmoids appear in these current sheets and propagate bi-directionally. The filament disconnects from the current sheets, which gradually disperse and disappear, reconnects to the loops, and becomes redirected to the loop footpoints. This evolution of the filament and the loops suggests successive magnetic reconnection predicted by theories1 but rarely detected with such clarity in observations. Our results on the formation, evolution, and disappearance of current sheets, confirm three-dimensional magnetic reconnection theory and have implications for the evolution of dissipation regions and the release of magnetic energy for reconnection in many magnetized plasma systems.

astro-ph.SR↗
arXiv2016

Magnetic field induced dynamical instabilities in an anti-ferromagnetic spin-1 Bose-Einstein condensate

We theoretically investigate four types of dynamical instability, in particular the periodic and oscillatory type $I_O$, in an anti-ferromagnetic spin-1 Bose-Einstein condensate in a nonzero magnetic field, by employing the coupled-mode theory and numerical method. This is in sharp contrast to the dynamical stability of the same system in zero field. Remarkably, a pattern transition from a periodic dynamical instability $I_O$ to a uniform one $III_O$ occurs at a critical magnetic field. All the four types of dynamical instability and the pattern transition are ready to be detected in $^{23}$Na condensates within the availability of the current experimental techniques.

cond-mat.quant-gas↗
arXiv2016

Delay-Optimal Computation Task Scheduling for Mobile-Edge Computing Systems

Mobile-edge computing (MEC) emerges as a promising paradigm to improve the quality of computation experience for mobile devices. Nevertheless, the design of computation task scheduling policies for MEC systems inevitably encounters a challenging two-timescale stochastic optimization problem. Specifically, in the larger timescale, whether to execute a task locally at the mobile device or to offload a task to the MEC server for cloud computing should be decided, while in the smaller timescale, the transmission policy for the task input data should adapt to the channel side information. In this paper, we adopt a Markov decision process approach to handle this problem, where the computation tasks are scheduled based on the queueing state of the task buffer, the execution state of the local processing unit, as well as the state of the transmission unit. By analyzing the average delay of each task and the average power consumption at the mobile device, we formulate a power-constrained delay minimization problem, and propose an efficient one-dimensional search algorithm to find the optimal task scheduling policy. Simulation results are provided to demonstrate the capability of the proposed optimal stochastic task scheduling policy in achieving a shorter average execution delay compared to the baseline policies.

cs.IT↗
arXiv2016

Schedule path optimization for quantum annealing and adiabatic quantum computing

Adiabatic quantum computing and optimization have garnered much attention recently as possible models for achieving a quantum advantage over classical approaches to optimization and other special purpose computations. Both techniques are probabilistic in nature and the minimum gap between the ground state and first excited state of the system during evolution is a major factor in determining the success probability. In this work we investigate a strategy for increasing the minimum gap and success probability by introducing intermediate Hamiltonians that modify the evolution path between initial and final Hamiltonians. We focus on an optimization problem relevant to recent hardware implementations and present numerical evidence for the existence of a purely local intermediate Hamiltonian that achieve the optimum performance in terms of pushing the minimum gap to one of the end points of the evolution. As a part of this study we develop a convex optimization formulation of the search for optimal adiabatic schedules that makes this computation more tractable, and which may be of independent interest. We further study the effectiveness of random intermediate Hamiltonians on the minimum gap and success probability, and empirically find that random Hamiltonians have a significant probability of increasing the success probability, but only by a modest amount.

quant-ph↗
arXiv2016

Energy Efficient Downlink Transmission for Multi-cell Massive DAS with Pilot Contamination

In this paper, we study the energy efficiency (EE) of a downlink multi-cell massive distributed antenna system (DAS) in the presence of pilot contamination (PC), where the antennas are clustered on the remote radio heads (RRHs). We employ a practical power consumption model by considering the transmit power, the circuit power, and the backhaul power, in contrast to most of the existing works which focus on co-located antenna systems (CAS) where the backhaul power is negligible. For a given average user rate, we consider the problem of maximizing the EE with respect to the number of each RRH antennas $n$, the number of RRHs $M$, the number of users $K$, and study the impact of system parameters on the optimal $n$, $M$ and $K$. Specifically, by applying random matrix theory, we derive the closed-form expressions of the optimal $n$, and find the solution of the optimal $M$ and $K$, under a simplified channel model with maximum ratio transmission. From the results, we find that to achieve the optimal EE, a large number of antennas is needed for a given user rate and PC. As the number of users increases, EE can be improved further by having more RRHs and antennas. Moreover, if the backhauling power is not large, massive DAS can be more energy efficient than massive CAS. These insights provide a useful guide to practical deployment of massive DAS.

cs.IT↗
arXiv2016

Photon statistics on the extreme entanglement

The effects of photon bunching and antibunching correspond to the classical and quantum features of the electromagnetic field, respectively. No direct evidence suggests whether these effects can be potentially related to quantum entanglement. Here we design a cavity quantum electrodynamics model with two atoms trapped in to demonstrate the connections between the steady-state photon statistics and the two-atom entanglement . It is found that within the weak dissipations and to some good approximation, the local maximal two-atom entanglements perfectly correspond to not only the quantum feature of the electromagnetic field---the optimal photon antibunching, but also the classical feature---the optimal photon bunching. We also analyze the influence of strong dissipations and pure dephasing. An intuitive physical understanding is also given finally.

quant-ph↗
arXiv2016

Periodically modulated electromagnetically induced transparency

Phenomena of electromagnetically induced transparency (PEIT) may be interpreted by the Autler-Townes Splitting (ATS), where the coupled states are split by the coupling laser field, or by the quantum destructive interference (QDI), where the atomic phases caused by the coupling laser and the probe laser field cancel. We propose modulated experiments to explore the PEIT in an alternative way by periodically modulating the coupling and the probe fields in a ?-type three-level system. Our analytical and numerical results rule out the ATS interpretation and show that the QDI interpretation is more appropriate for the modulated experiments. The proposed experiments are readily implemented in atomic gases, artificial atoms in superconducting quantum devices, or three-level meta-atoms in meta-materials.

quant-ph↗
arXiv2016

Trace and determinant preserving maps of matrices

Suppose a map $ϕ$ on the set of positive definite matrices satisfies $\det(A+B)=\det(ϕ(A)+ϕ(B))$. Then we have $${\rm tr}(AB^{-1}) = {\rm tr}(ϕ(A){ϕ(B)}^{-1}).$$ Through this viewpoint, we show that $ϕ$ is of the form $ϕ(A)= M^*AM$ or $ϕ(A)= M^*A^tM$ for some invertible matrix $M$ with $\det (M^*M)=1$. We also characterize the map $ϕ: \mathcal{S} \rightarrow \mathcal{S}$ preserving the determinant of convex combinations in $\mathcal{S}$ by using similar method. Here $\mathcal{S}$ can be the set of complex matrices, positive definite matrices, symmetric matrices, and upper triangular matrices.

math.RA↗
arXiv2016

Subarcsecond Bright Points and Quasi-periodic Upflows Below a Quiescent Filament Observed by the IRIS

Using UV spectra and SJIs from the IRIS, and coronal images and magnetograms from the Solar Dynamics Observatory (SDO), we present the new features in a quiescent filament channel: subarcsecond bright points (BPs) and quasi-periodic upflows. The BPs in the TR have a spatial scale of about 350$-$580 km and lifetime of more than several tens of minutes. They are located at stronger magnetic structures in the filament channel, with magnetic flux of about 10$^{17}$$-$10$^{18}$ Mx. Quasi-periodic brightenings and upflows are observed in the BPs and the period is about 4$-$5 min. The BP and the associated jet-like upflow comprise a "tadpole-shaped" structure. The upflows move along bright filament threads and their directions are almost parallel to the spine of the filament. The upflows initiated from the BPs with opposite polarity magnetic fields have opposite directions. The velocity of the upflows in plane of sky is about 5$-$50 km s$^{-1}$. The emission line of Si IV 1402.77 Å at the locations of upflows exhibits obvious blueshifts of about 5$-$30 km s$^{-1}$, and the line profile is broadened with the width of more than 20 km s$^{-1}$. The BPs seem to be the bases of filament threads and the upflows are able to convey mass for the dynamic balance of the filament. The "counter-streaming" flows in previous observations may be caused by the propagation of bi-directional upflows initiated from opposite polarity magnetic fields. We suggest that quasi-periodic brightenings of BPs and quasi-periodic upflows result from small-scale oscillatory magnetic reconnections, which are modulated by solar p-mode waves.

astro-ph.SR↗
arXiv2016

Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit

In this paper, we present a flexible low-rank matrix completion (LRMC) approach for topological interference management (TIM) in the partially connected K-user interference channel. No channel state information (CSI) is required at the transmitters except the network topology information. The previous attempt on the TIM problem is mainly based on its equivalence to the index coding problem, but so far only a few index coding problems have been solved. In contrast, in this paper, we present an algorithmic approach to investigate the achievable degrees-of-freedom (DoFs) by recasting the TIM problem as an LRMC problem. Unfortunately, the resulting LRMC problem is known to be NP-hard, and the main contribution of this paper is to propose a Riemannian pursuit (RP) framework to detect the rank of the matrix to be recovered by iteratively increasing the rank. This algorithm solves a sequence of fixed-rank matrix completion problems. To address the convergence issues in the existing fixed-rank optimization methods, the quotient manifold geometry of the search space of fixed-rank matrices is exploited via Riemannian optimization. By further exploiting the structure of the low-rank matrix varieties, i.e., the closure of the set of fixed- rank matrices, we develop an efficient rank increasing strategy to find good initial points in the procedure of rank pursuit. Simulation results demonstrate that the proposed RP algorithm achieves a faster convergence rate and higher achievable DoFs for the TIM problem compared with the state-of-the-art methods.

cs.IT↗
arXiv2016

QoS-Aware Joint Mode Selection and Channel Assignment for D2D Communications

Underlaying device-to-device (D2D) communications to a cellular network is considered as a key technique to improve spectral efficiency in 5G networks. For such D2D systems, mode selection and resource allocation have been widely utilized for managing interference. However, previous works allowed at most one D2D link to access the same channel, while mode selection and resource allocation are typically separately designed. In this paper, we jointly optimize the mode selection and channel assignment in a cellular network with underlaying D2D communications, where multiple D2D links may share the same channel. Meanwhile, the QoS requirements for both cellular and D2D links are guaranteed, in terms of Signal-to-Interference-plus-Noise Ratio (SINR). We first propose an optimal dynamic programming (DP) algorithm, which provides a much lower computation complexity compared to exhaustive search and serves as the performance bench mark. A bipartite graph based greedy algorithm is then proposed to achieve a polynomial time complexity. Simulation results will demonstrate the advantage of allowing each channel to be accessed by multiple D2D links in dense D2D networks, as well as, the effectiveness of the proposed algorithms.

cs.IT↗
arXiv2016

Selective Uplink Training for Massive MIMO Systems

As a promising technique to meet the drastically growing demand for both high throughput and uniform coverage in the fifth generation (5G) wireless networks, massive multiple-input multiple-output (MIMO) systems have attracted significant attention in recent years. However, in massive MIMO systems, as the density of mobile users (MUs) increases, conventional uplink training methods will incur prohibitively high training overhead, which is proportional to the number of MUs. In this paper, we propose a selective uplink training method for massive MIMO systems, where in each channel block only part of the MUs will send uplink pilots for channel training, and the channel states of the remaining MUs are predicted from the estimates in previous blocks, taking advantage of the channels' temporal correlation. We propose an efficient algorithm to dynamically select the MUs to be trained within each block and determine the optimal uplink training length. Simulation results show that the proposed training method provides significant throughput gains compared to the existing methods, while much lower estimation complexity is achieved. It is observed that the throughput gain becomes higher as the MU density increases.

cs.IT↗
arXiv2016

Cache Size Allocation in Backhaul Limited Wireless Networks

Caching popular content at base stations is a powerful supplement to existing limited backhaul links for accommodating the exponentially increasing mobile data traffic. Given the limited cache budget, we investigate the cache size allocation problem in cellular networks to maximize the user success probability (USP), taking wireless channel statistics, backhaul capacities and file popularity distributions into consideration. The USP is defined as the probability that one user can successfully download its requested file either from the local cache or via the backhaul link. We first consider a single-cell scenario and derive a closed-form expression for the USP, which helps reveal the impacts of various parameters, such as the file popularity distribution. More specifically, for a highly concentrated file popularity distribution, the required cache size is independent of the total number of files, while for a less concentrated file popularity distribution, the required cache size is in linear relation to the total number of files. Furthermore, we study the multi-cell scenario, and provide a bisection search algorithm to find the optimal cache size allocation. The optimal cache size allocation is verified by simulations, and it is shown to play a more significant role when the file popularity distribution is less concentrated.

cs.IT↗