SearcharxivSearch

arXiv subjects

H. D. Tuan

Publications and source records attributed to H. D. Tuan.

16 recordsLinked to original sources

Holographic Multi-User Multi-Stream Beamforming Maintaining Rate-Fairness

We present the first investigation into the transmission of multi-stream information from a base station equipped with reconfigurable holographic surfaces (RHS) to multiple users with the aid of multi-antenna arrays. Building upon this, we propose the joint design of RHS and baseband beamformers that enables multi-stream delivery at fair rates across all users. Specifically, we first introduce a max-min rate optimization approach, which aims for maximizing the minimum rate for all users through iterative solutions of quadratic problems. To reduce complexity, we then propose a surrogate-based optimization approach that offers a low-complexity design alternative relying on closed-form updates. Our simulations show that the surrogate-based approach achieves nearly the same minimum rate as max-min optimization, while delivering sum-rates comparable to those of sum-rate maximization, overcoming the rate-fairness deficiency typical of the latter.

cs.IT

A New Class of Analog Precoding for Multi-Antenna Multi-User Communications over High-Frequency Bands

A network relying on a large antenna-array-aided base station is designed for delivering multiple information streams to multi-antenna users over high-frequency bands such as the millimeter-wave and sub-Terahertz bands. The state-of-the-art analog precoder (AP) dissipates excessive circuit power due to its reliance on a large number of phase shifters. To mitigate the power consumption, we propose a novel AP relying on a controlled number of phase shifters. Within this new AP framework, we design a hybrid precoder (HP) for maximizing the users' minimum throughput, which poses a computationally challenging problem of large-scale, nonsmooth mixed discrete-continuous log-determinant optimization. To tackle this challenge, we develop an algorithm which iterates through solving convex problems to generate a sequence of HPs that converges to the max-min solution. We also introduce a new framework of smooth optimization termed soft max-min throughput optimization. Additionally, we develop another algorithm, which iterates by evaluating closed-form expressions to generate a sequence of HPs that converges to the soft max-min solution. Simulation results reveal that the HP soft max-min solution approaches the Pareto-optimal solution constructed for simultaneously optimizing both the minimum throughput and sum-throughput. Explicitly, it achieves a minimum throughput similar to directly maximizing the users' minimum throughput and it also attains a sum-throughput similar to directly maximizing the sum-throughput.

cs.IT

Long-Term Rate-Fairness-Aware Beamforming Based Massive MIMO Systems

This is the first treatise on multi-user (MU) beamforming designed for achieving long-term rate-fairness in fulldimensional MU massive multi-input multi-output (m-MIMO) systems. Explicitly, based on the channel covariances, which can be assumed to be known beforehand, we address this problem by optimizing the following objective functions: the users' signal-toleakage-noise ratios (SLNRs) using SLNR max-min optimization, geometric mean of SLNRs (GM-SLNR) based optimization, and SLNR soft max-min optimization. We develop a convex-solver based algorithm, which invokes a convex subproblem of cubic time-complexity at each iteration for solving the SLNR maxmin problem. We then develop closed-form expression based algorithms of scalable complexity for the solution of the GMSLNR and of the SLNR soft max-min problem. The simulations provided confirm the users' improved-fairness ergodic rate distributions.

cs.IT

Max-min Rate Optimization of Low-Complexity Hybrid Multi-User Beamforming Maintaining Rate-Fairness

A wireless network serving multiple users in the millimeter-wave or the sub-terahertz band by a base station is considered. High-throughput multi-user hybrid-transmit beamforming is conceived by maximizing the minimum rate of the users. For the sake of energy-efficient signal transmission, the array-of-subarrays structure is used for analog beamforming relying on low-resolution phase shifters. We develop a convexsolver based algorithm, which iteratively invokes a convex problem of the same beamformer size for its solution. We then introduce the soft max-min rate objective function and develop a scalable algorithm for its optimization. Our simulation results demonstrate the striking fact that soft max-min rate optimization not only approaches the minimum user rate obtained by max-min rate optimization but it also achieves a sum rate similar to that of sum-rate maximization. Thus, the soft max-min rate optimization based beamforming design conceived offers a new technique of simultaneously achieving a high individual quality-of-service for all users and a high total network throughput.

cs.IT

Low-Complexity Pareto-Optimal 3D Beamforming for the Full-Dimensional Multi-User Massive MIMO Downlink

Full-dimensional (FD) multi-user massive multiple input multiple output (m-MIMO) systems employ large two-dimensional (2D) rectangular antenna arrays to control both the azimuth and elevation angles of signal transmission. We introduce the sum of two outer products of the azimuth and elevation beamforming vectors having moderate dimensions as a new class of FD beamforming. We show that this low-complexity class is capable of outperforming 2D beamforming relying on the single outer product of the azimuth and elevation beamforming vectors. It is also capable of performing close to its FD counterpart of massive dimensions in terms of either the users minimum rate or their geometric mean rate (GM-rate), or sum rate (SR). Furthermore, we also show that even FD beamforming may be outperformed by our outer product-based improper Gaussian signaling solution. Explicitly, our design is based on low-complexity algorithms relying on convex problems of moderate dimensions for max-min rate optimization or on closed-form expressions for GM-rate and SR maximization.

cs.IT

Finite-Blocklength RIS-Aided Transmit Beamforming

This paper considers the downlink of an ultra-reliable low-latency communication (URLLC) system in which a base station (BS) serves multiple single-antenna users in the short (finite) blocklength (FBL) regime with the assistance of a reconfigurable intelligent surface (RIS). In the FBL regime, the users' achievable rates are complex functions of the beamforming vectors and of the RIS's programmable reflecting elements (PREs). We propose the joint design of the transmit beamformers and PREs, the problem of maximizing the geometric mean (GM) of these rates (GM-rate) and show that this aforementioned results are providing fair rate distribution and thus reliable links to all users. A novel computational algorithm is developed, which is based on closed forms to generate improved feasible points, using its execution. The simulations show the merit of our solution.

cs.IT

RIS-aided Zero-Forcing and Regularized Zero-Forcing Beamforming in Integrated Information and Energy Delivery

This paper considers a network of a multi-antenna array base station (BS) and a reconfigurable intelligent surface (RIS) to deliver both information to information users (IUs) and power to energy users (EUs). The RIS links the connection between the IUs and the BS as there is no direct path between the former and the latter. The EUs are located nearby the BS in order to effectively harvest energy from the high-power signal from the BS, while the much weaker signal reflected from the RIS hardly contributes to the EUs' harvested energy. To provide reliable links for all users over the same time-slot, we adopt the transmit time-switching (transmit-TS) approach, under which information and energy are delivered over different time-slot fractions. This allows us to rely on conjugate beamforming for energy links and zero-forcing/regularized zero-forcing beamforming (ZFB/RZFB) and on the programmable reflecting coefficients (PRCs) of the RIS for information links. We show that ZFB/RZFB and PRCs can be still separately optimized in their joint design, where PRC optimization is based on iterative closed-form expressions. We then develop a path-following algorithm for solving our max-min IU throughput optimization problem subject to a realistic constraint on the quality-of-energy-service in terms of the EUs' harvested energy thresholds. We also propose a new RZFB for substantially improving the IUs' throughput.

cs.IT

A New Class of Structured Beamforming for Content-Centric Fog Radio Access Networks

A multi-user fog radio access network (F-RAN) is designed for supporting content-centric services. The requested contents are partitioned into sub-contents, which are then 'beam- formed' by the remote radio heads (RRHs) for transmission to the users. Since a large number of beamformers must be designed, this poses a computational challenge. We tackle this challenge by proposing a new class of regularized zero forcing beamforming (RZFB) for directly mitigating the inter-content interferences, while the 'intra-content interference' is mitigated by successive interference cancellation at the user end. Thus each beamformer is decided by a single real variable (for proper Gaus- sian signaling) or by a pair of complex variables (for improper Gaussian signaling). Hence the total number of decision variables is substantially reduced to facilitate tractable computation. To address the problem of energy efficiency optimization subject to multiple constraints, such as individual user-rate requirement and the fronthauling constraint of the links between the RRHs and the centralized baseband signal processing unit, as well as the total transmit power budget, we develop low-complexity path- following algorithms. Finally, we actualize their performance by simulations.

cs.IT

Full-Duplex MIMO-OFDM Communication with Self-Energy Recycling

This paper focuses on energy recycling in full-duplex (FD) relaying multiple-input-multiple-output orthogonal frequency division multiplexing (OFDM) communication. The loop self-interference (SI) due to full-duplexing is seen as an opportunity for the energy-constrained relay node to replenish its energy requirement through wireless power transfer. In forwarding the source information to the destination, the FD relay can simultaneously harvest energy from the source wireless transmission and also through energy recycling from its own transmission. The objective is to maximize the overall spectral efficiency by designing the optimal power allocation over OFDM sub-carriers and transmit antennas. Due to a large number of sub-carriers, this design problem poses a large-scale nonconvex optimization problem involving a few thousand variables of power allocation, which is very computationally challenging. A new path-following algorithm is proposed, which converges to an optimal solution. This algorithm is very efficient since it is based on \textit{closed-form} calculations. Numerical results for a practical simulation setting show promising results by achieving high spectral efficiency.

cs.IT

Bang-Bang Charging of Electrical Vehicles by Smart Grid Technology

The success of the transportation electricification in this century particularly requires the penentration of the internet of plug-in electric vehicles (PEVs) into the smart power grid. Beside the function of serving the traditional residential power demand, next-generation power grids also aim to support the internet of PEVs at the same time. The distinct difference between the traditional power demand and PEVs' power demand is that while the statistics of the former is rich enough for treating it as inelastic/known before hand, the latter is unknown until random PEVs' arrivals. Massive penentration of PEVs certainly causes the grid unpredictable fluctuation. The present paper considers the joint PEVs charging coordination and grid power generation to minimizing both of the negative impact of PEVs' integration and the cost of power generation while meeting the grid operating constraints and all parties' demand. The bang-bang PEVs charging strategy is adopted to exploit its simple implementation. By using a recently developed model predictive control (MPC) model for this problem, the online compuation is based on a predictive mixed integer nonlinear programming (MINP). A new solution computation for this optimization problem is developed. Its capacity of achieving the globally optimal solution is shown by numerical comparison between its performance and that by an off-line optimal solution.

eess.SY

NOMA for throughput and EE maximization in Energy Harvesting Enabled Networks

Wireless power transfer via radio-frequency (RF) radiation is regarded as a potential solution to energize energy-constrained users, who are deployed close to the base stations (near-by users). However, energy transfer requires much more transmit power than normal information transfer, which makes it very challenging to provide the quality of service in terms of throughput for all near-by users and cell-edge users. Thus, it is of practical interest to employ non-orthogonal multiple access (NOMA) to improve the throughput of all network users, while fulfilling the energy harvesting requirements of the near-by users. To realize both energy harvesting and information decoding, we consider a transmit time-switching (transmit-TS) protocol. We formulate two important beamfoming problems of users' max-min throughput optimization and energy efficiency maximization under power constraint and energy harvesting thresholds at the nearly-located users. For these problems, the optimization objective and energy harvesting are non-convex in beamforming vectors. Thus, we develop efficient path-following algorithms to solve them. In addition, we also consider conventional power splitting (PS)-based energy harvesting receiver. Our numerical results confirm that the proposed transmit-TS based algorithms clearly outperform PS-based algorithms in terms of both, throughput and energy efficiency.

cs.IT

PMU Placement Optimization for Smart Grid Obvervability and State Estimation

In this paper, phasor measurement unit (PMU) placement for power grid state estimation under different degrees of observability is studied. Observability degree is the depth of the buses' reachability by the placed PMUs and thus constitutes an important characteristic for PMU placement. However, the sole observability as addressed in many works still does not guarantee a good estimate for the grid state. Some existing works also considered the PMU placement for minimizing the mean squared error or maximizing the mutual information between the measurement output and grid state. However, they ignore the observability requirements for computational tractability and thus potentially lead to artificial results such as acceptance of the estimate for an unobserved state component as its unconditional mean. In this work, the PMU placement optimization problem is considered by minimizing the mean squared error or maximizing the mutual information between the measurement output and grid state, under grid observability constraints. The provided solution is free from the mentioned fundamental drawbacks in the existing PMU placement designs. The problems are posed as binary nonlinear optimization problems, for which this paper develops efficient algorithms for computational solutions. The performance of the proposed algorithms is analyzed in detail through numerical examples on large-scale IEEE power networks.

eess.SY

Mixed integer nonlinear programming for Joint Coordination of Plug-in Electrical Vehicles Charging and Smart Grid Operations

The problem of joint coordination of plug-in electric vehicles (PEVs) charging and grid power control is to minimize both PEVs charging cost and energy generation cost while meeting both residential and PEVs' power demands and suppressing the potential impact of PEVs integration. A bang-bang PEV charging strategy is adopted to exploit its simple online implementation, which requires computation of a mixed integer nonlinear programming problem (MINP) in binary variables of the PEV charging strategy and continuous variables of the grid voltages. A new solver for this MINP is proposed. Its efficiency is shown by numerical simulations.

eess.SY

Global Optimal Power Flow over Large-Scale Power Transmission Network

Optimal power flow (OPF) over power transmission networks poses challenging large-scale nonlinear optimization problems, which involve a large number of quadratic equality and indefinite quadratic inequality constraints. These computationally intractable constraints are often expressed by linear constraints plus matrix additional rank-one constraints on the outer products of the voltage vectors. The existing convex relaxation technique, which drops the difficult rank-one constraints for tractable computation, cannot yield even a feasible point. We address these computationally difficult problems by an iterative procedure, which generates a sequence of improved points that converge to a rank-one solution. Each iteration calls a semi-definite program. Intensive simulations for the OPF problems over networks with a few thousands of buses are provided to demonstrate the efficiency of our approach. The suboptimal values of the OPF problems found by our computational procedure turn out to be the global optimal value with computational tolerance less than 0.01%.

eess.SY

Parameterized Bilinear Matrix Inequality Techniques in ${\cal H}_{\infty}$ Fuzzy PID Control Design

Proportional-integral-derivative (PID) structured controller is the most popular class of industrial control but still could not be appropriately exploited in fuzzy systems. To gain the practicability and tractability of fuzzy systems, this paper develops a parameterized bilinear matrix inequality characterization for the ${\cal H}_{\infty}$ fuzzy PID control design, which is then relaxed into a bilinear matrix inequality optimization problem of nonconvex optimization. Several computational procedures are then developed for its solution. The merit of the developed algorithms is shown through the benchmark examples.

eess.SY

Model Predictive Control for Smart Grids with Multiple Electric-Vehicle Charging Stations

Next-generation power grids will likely enable concurrent service for residences and plug-in electric vehicles (PEVs). While the residence power demand profile is known and thus can be considered inelastic, the PEVs' power demand is only known after random PEVs' arrivals. PEV charging scheduling aims at minimizing the potential impact of the massive integration of PEVs into power grids to save service costs to customers while power control aims at minimizing the cost of power generation subject to operating constraints and meeting demand. The present paper develops a model predictive control (MPC)- based approach to address the joint PEV charging scheduling and power control to minimize both PEV charging cost and energy generation cost in meeting both residence and PEV power demands. Unlike in related works, no assumptions are made about the probability distribution of PEVs' arrivals, the known PEVs' future demand, or the unlimited charging capacity of PEVs. The proposed approach is shown to achieve a globally optimal solution. Numerical results for IEEE benchmark power grids serving Tesla Model S PEVs show the merit of this approach.

eess.SY