arXiv subjects

Xie Xie

Publications and source records attributed to Xie Xie.

7 recordsLinked to original sources

arXiv2022

Joint Precoding for Active Intelligent Transmitting Surface Empowered Outdoor-to-Indoor Communication in mmWave Cellular Networks

Outdoor-to-indoor communications in millimeter-wave (mmWave) cellular networks have been one challenging research problem due to the severe attenuation and the high penetration loss caused by the propagation characteristics of mmWave signals. We propose a viable solution to implement the outdoor-to-indoor mmWave communication system with the aid of an active intelligent transmitting surface (active-ITS), where the active-ITS allows the incoming signal from an outdoor base station (BS) to pass through the surface and be received by the indoor user-equipments (UEs) after shifting its phase and magnifying its amplitude. Then, the problem of joint precoding of the BS and active-ITS is investigated to maximize the weighted sum-rate (WSR) of the communication system. An efficient block coordinate descent (BCD) based algorithm is developed to solve it with the suboptimal solutions in nearly closed-forms. In addition, to reduce the size and hardware cost of an active-ITS, we provide a block-amplifying architecture to partially remove the circuit components for power-amplifying, where multiple transmissive-type elements (TEs) in each block share a same power amplifier. Simulations indicate that active-ITS has the potential of achieving a given performance with much fewer TEs compared to the passive-ITS under the same total system power consumption, which makes it suitable for application to the size-limited and aesthetic-needed scenario, and the inevitable performance degradation caused by the block-amplifying architecture is acceptable.

cs.IT↗

arXiv2022

Robust Joint Design for Intelligent Reflecting Surfaces Assisted Cell-Free Networks

Intelligent reflecting surfaces (IRSs) have emerged as a promising economical solution to implement cell-free networks. However, the performance gains achieved by IRSs critically depend on smartly tuned passive beamforming based on the assumption that the accurate channel state information (CSI) knowledge is available, which is practically impossible. Thus, in this paper, we investigate the impact of the CSI uncertainty on IRS-assisted cell-free networks. We adopt a stochastic programming method to cope with the CSI uncertainty by maximizing the expectation of the sum-rate, which guarantees robust performance over the average. Accordingly, an average sum-rate maximization problem is formulated, which is non-convex and arduous to obtain its optimal solution due to the coupled variables and the expectation operation with respect to CSI uncertainties. As a compromising approach, we develop an efficient robust joint design algorithm with low-complexity. Particularly, the original problem is equivalently transformed into a tractable form, and then, the locally optimal solution can be obtained by employing the block coordinate descent method. We further prove that the CSI uncertainty impacts the design of the active transmitting beamforming of APs, but surprisingly does not directly impact the design of the passive reflecting beamforming of IRSs. It is worth noting that the investigated scenario is flexible and general, and thus the proposed algorithm can act as a general framework to solve various sum-rate maximization problems. Simulation results demonstrate that IRSs can achieve considerable data rate improvement for conventional cell-free networks, and confirm the resilience of the proposed algorithm against the CSI uncertainty.

cs.IT↗

arXiv2021

A Neat Linked Queue with the Rear Blank Node

We introduce a very simple queue implementation with the singly linked list. With the help of the rear blank node instead of the usual header node, we avoid additional check steps for the dequeue operation in the traditional implementations existing for many decades. The essence of our representation is the half-opened pointer interval with the same direction of the queue operations, which can guarantee the uniform treatment even in the empty queue case. The simplification of queue implementations cuts off unnecessary steps, and it minimizes the number of steps in the dequeue operation with the time limitation of enqueue operation, which could contribute to the performance of the real-time systems. We extend the linked queue to the circularly linked queue, which can also be used to implement stack and take advantage of the maximal information of the single direction in the circularly linked list, and it actually constructs the output-restricted deque. We also present a variant: lazy circularly linked queue, which is more efficient in some special cases, especially for the dequeue operations.

cs.DS↗

arXiv2021

Multiple Intelligent Reflecting Surfaces Assisted Cell-Free MIMO Communications

In this paper, we investigate an intelligent reflecting surface (IRS) assisted cell-free multiple input multiple output (MIMO) communication system, where distributed multiple IRSs are dedicated deployed to assist distributed multiple base stations (BSs) for cooperative transmission. Our objective is to maximize the achievable sum-rate of the cell-free system by jointly optimizing the active transmit beamforming matrices at BSs and the passive reflecting beamforming matrices at IRSs, while the constraints on the maximum transmit power of each BS and the phase shift of each IRS element are satisfied. We propose an efficient framework to jointly design the BSs, the IRSs, and the user equipment (UEs). As a compromise approach, we first transform the non-convex problem into an equivalent form based on the fractional programming methods and then decompose the reformulated problem into two subproblems and solve them alternately. Particularly, we propose a Lagrangian dual sub-gradient based algorithm to solve the subproblem of optimizing the active transmit beamforming with nearly closed-form solutions. We reformulate the subproblem of optimizing the passive reflecting beamforming as a constant modulus constrained quadratic programming (CMC-QP) problem. We first provide two feasible solutions by proposing a pair of relaxation-based algorithms. We also develop a low-complexity alternating sequential optimization (ASO) algorithm to obtain closed-form solutions. All three algorithms are guaranteed to converge to locally optimal solutions. Simulation results demonstrate that the proposed algorithms achieve considerable performance improvements compared with the benchmark schemes.

cs.IT↗

arXiv2021

A Joint Power Splitting, Active and Passive Beamforming Optimization Framework for IRS Assisted MIMO SWIPT System

This paper considers an intelligent reflecting surface (IRS) assisted multi-input multi-output (MIMO) power splitting (PS) based simultaneous wireless information and power transfer (SWIPT) system with multiple PS receivers (PSRs). The objective is to maximize the achievable data rate of the system by jointly optimizing the PS ratios at the PSRs, the active transmit beamforming (ATB) at the access point (AP), and the passive reflective beamforming (PRB) at the IRS, while the constraints on maximum transmission power at the AP, the reflective phase shift of each element at the IRS, the individual minimum harvested energy requirement of each PSR, and the domain of PS ratio of each PSR are all satisfied. For this unsolved problem, however, since the optimization variables are intricately coupled and the constraints are conflicting, the formulated problem is non-convex, and cannot be addressed by employing exist approaches directly. To this end, we propose a joint optimization framework to solve this problem. Particularly, we reformulate it as an equivalent form by employing the Lagrangian dual transform and the fractional programming transform, and decompose the transformed problem into several sub-problems. Then, we propose an alternate optimization algorithm by capitalizing on the dual sub-gradient method, the successive convex approximation method, and the penalty-based majorization-minimization approach, to solve the sub-problems iteratively, and obtain the optimal solutions in nearly closed-forms. Numerical simulation results verify the effectiveness of the IRS in SWIPT system and indicate that the proposed algorithm offers a substantial performance gain.

cs.IT↗

arXiv2018

On the Study of Chaos and Memory Effects in the Bonhoeffer-van der Pol Oscillator with a Non-Ideal Capacitor

In this paper, the voltage fluctuations of the Bonhoeffer van der pol oscillator system with a non-ideal capacitor were investigated. Here, the capacitor was modeled, using a fractional differential equation in which the order of the fractional derivative is also a measure of the memory in the dielectric. The governing fractional differential equation was derived using two methods, namely a differential and integral approach. The former method utilized a hierarchical resistor-capacitor (RC) ladder model while the latter utilized the theory of the universal dielectric-response. The dynamical behavior of the potential across the capacitor was found to be affected by this parameter, and, therefore, the memory of the system. Additionally, findings indicate that an increase in the memory parameter was associated with an increase in the energy stored in the dielectric. It was found that oscillation death resulted in a higher amount of stored energy in the dielectric over time, as compared to behavior, which displayed relaxation oscillations or chaotic fluctuations. The relatively-lower stored energy resulting from the latter types of dynamical behavior appeared to be a consequence of the memory effect, where present accumulations of energy in the capacitor are affected by previous decreases in the potential. Hence, in this type of scenario, the dielectric material can be thought of as remembering the past behavior of the voltage, which leads to either a decrease, or an enhancement in the stored energy. The non-ideal capacitor was also found to have a transitory nature, where it behaves more like a resistor as α approaches 0, and conversely, more like a capacitor as α goes to 1. Here, a decrease in α was linked to an enhanced metallic character of the dielectric.

physics.data-an↗

arXiv2017

Complexity Analysis of Chaos and Other Fluctuating Phenomena

The refined composite multiscale-entropy algorithm was applied to the time-dependent behavior of the Weierstrass functions, colored noise, and Logistic map to provide fresh insight into the dynamics of these fluctuating phenomena. For the Weierstrass function, the complexity of fluctuations was found to increase with respect to the fractional dimension, D, of the graph. Additionally, the sample-entropy curves increased in an exponential fashion with increasing D. This increase in the complexity was found to correspond to a rising amount of irregularities in the oscillations. In terms of the colored noise, the complexity of the fluctuations was found to be highest for the 1/f noise (f is the frequency of the generated noise), which is in agreement with findings in the literature. Moreover, the sample-entropy curves exhibited a decreasing trend for noise when the spectral exponent, β, was less than 1 and obeyed an increasing trend when β> 1. Importantly, a direct relationship was observed between the power-law exponents for the curves and the spectral exponents of the noise. For the logistic map, a correspondence was observed between the complexity maps and its bifurcation diagrams. Specifically, the map of the sample-entropy curves was negligible when the bifurcation parameter, R, varied between 3 - 3.5. Beyond these values, the curves attained non-zero values that increased with increasing R, in general.

physics.data-an↗