arXiv subjects

Jing Yang

Publications and source records attributed to Jing Yang.

444 records · Page 25Linked to original sources

arXiv2013

Energy Cooperation in Energy Harvesting Communications

In energy harvesting communications, users transmit messages using energy harvested from nature during the course of communication. With an optimum transmit policy, the performance of the system depends only on the energy arrival profiles. In this paper, we introduce the concept of energy cooperation, where a user wirelessly transmits a portion of its energy to another energy harvesting user. This enables shaping and optimization of the energy arrivals at the energy-receiving node, and improves the overall system performance, despite the loss incurred in energy transfer. We consider several basic multi-user network structures with energy harvesting and wireless energy transfer capabilities: relay channel, two-way channel and multiple access channel. We determine energy management policies that maximize the system throughput within a given duration using a Lagrangian formulation and the resulting KKT optimality conditions. We develop a two-dimensional directional water-filling algorithm which optimally controls the flow of harvested energy in two dimensions: in time (from past to future) and among users (from energy-transferring to energy-receiving) and show that a generalized version of this algorithm achieves the boundary of the capacity region of the two-way channel.

cs.IT↗

arXiv2013

Weight Distribution of a Class of Cyclic Codes with Arbitrary Number of Zeros

Cyclic codes have been widely used in digital communication systems and consume electronics as they have efficient encoding and decoding algorithms. The weight distribution of cyclic codes has been an important topic of study for many years. It is in general hard to determine the weight distribution of linear codes. In this paper, a class of cyclic codes with any number of zeros are described and their weight distributions are determined.

cs.IT↗

arXiv2012

Two-particle interferometry for the sources undergoing first-order QCD phase transition in high energy heavy ion collisions

We investigate the two-particle interferometry for the particle-emitting sources which undergo the first-order phase transition from the quark-gluon plasma with a finite baryon chemical potential to hadron resonance gas. The effects of source expansion, lifetime, and particle absorption on the transverse interferometry radii $R_{\rm out}$ and $R_{\rm side}$ are examined. We find that the emission durations of the particles become large when the system is initially located at the boundary between the mixed phase and the quark-gluon plasma. In this case, the difference between the radii $R_{\rm out}$ and $R_{\rm side}$ increases with the transverse momentum of the particle pair significantly. The ratio of $\sqrt{R_{\rm out}^2 -R_{\rm side}^2}$ to the transverse velocity of the pair is an observable for the enhancement of the emission duration.

nucl-th↗

arXiv2012

Optimal Backpressure Scheduling in Wireless Networks using Mutual Information Accumulation

In this paper we develop scheduling policies that maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. When the link quality between nodes is not sufficiently high that a packet can be decoded within a single slot, the system can accumulate information across multiple slots, eventually decoding the packet. The result is an expanded stability region. The accumulation process over weak links is temporally coupled and therefore does not satisfy the independent and identically distributed (i.i.d) assumption that underlies many previous analysis in this area. Therefore the problem setting also poses new analytic challenges. We propose two dynamic scheduling algorithms to cope with the non-i.i.d nature of the decoding. The first performs scheduling every $T$ slots, and approaches the boundary of the stability region as $T$ gets large, but at the cost of increased average delay. The second introduces virtual queues for each link and constructs a virtual system wherein two virtual nodes are introduced for each link. The constructed virtual system is shown to have the same stability region as the original system. Through controlling the virtual queues in the constructed system, we avoid the non-i.i.d analysis difficulty and attain the full stability region. We derive performance bounds for both algorithms and compare them through simulation results.

cs.IT↗

arXiv2011

Hamming Weights in Irreducible Cyclic Codes

Irreducible cyclic codes are an interesting type of codes and have applications in space communications. They have been studied for decades and a lot of progress has been made. The objectives of this paper are to survey and extend earlier results on the weight distributions of irreducible cyclic codes, present a divisibility theorem and develop bounds on the weights in irreducible cyclic codes.

cs.IT↗

arXiv2011

Cooperative Packet Routing using Mutual Information Accumulation

We consider the resource allocation problem in cooperative wireless networks wherein nodes perform mutual information accumulation. We consider a unicast setting and arbitrary arrival processes at the source node. Source arrivals can be broken down into numerous packets to better exploit the spatial and temporal diversity of the routes available in the network. We devise a linear-program-based algorithm which allocates network resource to meet a certain transmission objective. Given a network, a source with multiple arriving packets and a destination, our algorithm generates a policy that regulates which nodes should participate in transmitting which packets, when and with what resource. By routing different packets through different nodes the policy exploits spatial route diversity, and by sequencing packet transmissions along the same route it exploits temporal route diversity.

cs.IT↗

arXiv2011

Transmission with Energy Harvesting Nodes in Fading Wireless Channels: Optimal Policies

Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the nodes can harvest energy throughout the duration in which communication takes place. As such, transmission policies of the nodes need to adapt to these harvested energy arrivals. In this paper, we consider optimization of point-to-point data transmission with an energy harvesting transmitter which has a limited battery capacity, communicating in a wireless fading channel. We consider two objectives: maximizing the throughput by a deadline, and minimizing the transmission completion time of the communication session. We optimize these objectives by controlling the time sequence of transmit powers subject to energy storage capacity and causality constraints. We, first, study optimal offline policies. We introduce a directional water-filling algorithm which provides a simple and concise interpretation of the necessary optimality conditions. We show the optimality of an adaptive directional water-filling algorithm for the throughput maximization problem. We solve the transmission completion time minimization problem by utilizing its equivalence to its throughput maximization counterpart. Next, we consider online policies. We use stochastic dynamic programming to solve for the optimal online policy that maximizes the average number of bits delivered by a deadline under stochastic fading and energy arrival processes with causal channel state feedback. We also propose near-optimal policies with reduced complexity, and numerically study their performances along with the performances of the offline and online optimal policies under various different configurations.

cs.IT↗

arXiv2010

Broadcasting with an Energy Harvesting Rechargeable Transmitter

In this paper, we investigate the transmission completion time minimization problem in a two-user additive white Gaussian noise (AWGN) broadcast channel, where the transmitter is able to harvest energy from the nature, using a rechargeable battery. The harvested energy is modeled to arrive at the transmitter randomly during the course of transmissions. The transmitter has a fixed number of packets to be delivered to each receiver. Our goal is to minimize the time by which all of the packets for both users are delivered to their respective destinations. To this end, we optimize the transmit powers and transmission rates intended for both users. We first analyze the structural properties of the optimal transmission policy. We prove that the optimal total transmit power has the same structure as the optimal single-user transmit power. We also prove that there exists a cut-off power level for the stronger user. If the optimal total transmit power is lower than this cut-off level, all transmit power is allocated to the stronger user, and when the optimal total transmit power is larger than this cut-off level, all transmit power above this level is allocated to the weaker user. Based on these structural properties of the optimal policy, we propose an algorithm that yields the globally optimal off-line scheduling policy. Our algorithm is based on the idea of reducing the two-user broadcast channel problem into a single-user problem as much as possible.

cs.IT↗

arXiv2010

Optimal Packet Scheduling in an Energy Harvesting Communication System

We consider the optimal packet scheduling problem in a single-user energy harvesting wireless communication system. In this system, both the data packets and the harvested energy are modeled to arrive at the source node randomly. Our goal is to adaptively change the transmission rate according to the traffic load and available energy, such that the time by which all packets are delivered is minimized. Under a deterministic system setting, we assume that the energy harvesting times and harvested energy amounts are known before the transmission starts. For the data traffic arrivals, we consider two different scenarios. In the first scenario, we assume that all bits have arrived and are ready at the transmitter before the transmission starts. In the second scenario, we consider the case where packets arrive during the transmissions, with known arrival times and sizes. We develop optimal off-line scheduling policies which minimize the time by which all packets are delivered to the destination, under causality constraints on both data and energy arrivals.

cs.IT↗

arXiv2010

Complete Solving for Explicit Evaluation of Gauss Sums in the Index 2 Case

Let $p$ be a prime number, $q=p^f$ for some positive integer $f$, $N$ be a positive integer such that $\gcd(N,p)=1$, and let $\k$ be a primitive multiplicative character of order $N$ over finite field $\fq$. This paper studies the problem of explicit evaluation of Gauss sums in "\textsl{index 2 case}" (i.e. $f=\f{\p(N)}{2}=[\zn:\pp]$, where $\p(\cd)$ is Euler function). Firstly, the classification of the Gauss sums in index 2 case is presented. Then, the explicit evaluation of Gauss sums $G(\k^\la) (1\laN-1)$ in index 2 case with order $N$ being general even integer (i.e. $N=2^{r}\cd N_0$ where $r,N_0$ are positive integers and $N_03$ is odd.) is obtained. Thus, the problem of explicit evaluation of Gauss sums in index 2 case is completely solved.

math.NT↗

arXiv2009

A note on the sign (unit root) ambiguities of Gauss sums in index 2 and 4 cases

Recently, the explicit evaluation of Gauss sums in the index 2 and 4 cases have been given in several papers (see [2,3,7,8]). In the course of evaluation, the sigh (or unit root) ambiguities are unavoidably occurred. This paper presents another method, different from [7] and [8], to determine the sigh (unit root) ambiguities of Gauss sums in the index 2 case, as well as the ones with odd order in the non-cyclic index 4 case. And we note that the method in this paper are more succinct and effective than [8] and [7].

math.NT↗

arXiv2009

Kinematics of the swimming of Spiroplasma

\emph{Spiroplasma} swimming is studied with a simple model based on resistive-force theory. Specifically, we consider a bacterium shaped in the form of a helix that propagates traveling-wave distortions which flip the handedness of the helical cell body. We treat cell length, pitch angle, kink velocity, and distance between kinks as parameters and calculate the swimming velocity that arises due to the distortions. We find that, for a fixed pitch angle, scaling collapses the swimming velocity (and the swimming efficiency) to a universal curve that depends only on the ratio of the distance between kinks to the cell length. Simultaneously optimizing the swimming efficiency with respect to inter-kink length and pitch angle, we find that the optimal pitch angle is 35.5$^\circ$ and the optimal inter-kink length ratio is 0.338, values in good agreement with experimental observations.

physics.bio-ph↗