Most phase-shift models for reconfigurable intelligent surfaces (RIS) rely on ideal models of the reflection coefficient, i.e., assuming full-reflection amplitude and constant reflection coefficient for any incident a...
详细信息
Most phase-shift models for reconfigurable intelligent surfaces (RIS) rely on ideal models of the reflection coefficient, i.e., assuming full-reflection amplitude and constant reflection coefficient for any incident angle. Since electromagnetic waves incident on RIS from varying directions exhibit different responses, ideal phase-shift models may overestimate the capacity gain of the RIS-aided multiple-input-multiple-output (MIMO) communications system. With varactor diode-based RIS, this letter performs full-wave simulation to verify the impact of incident angle on its reflection coefficient. Specifically, we first propose an angle-dependent amplitude-phase response model. The proposed model is then applied to a RIS-aided MIMO communications system, where the capacity maximization problem is formulated and solved via joint RIS reflection coefficients and transmit covariance matrix optimization. Simulation results quantify the capacity gain achieved by RIS with varying incident angles.
This letter rethinks the probabilistic broadcast gossip scheme to achieve fast distributed average consensus in wireless networks. The consensus attainment in this scheme is heavily influenced by the broadcast probabi...
详细信息
This letter rethinks the probabilistic broadcast gossip scheme to achieve fast distributed average consensus in wireless networks. The consensus attainment in this scheme is heavily influenced by the broadcast probability of each node, which directly affects the convergence rate. To reduce communication costs for achieving consensus, we formulate an optimization problem to determine the optimal broadcast probability for each node. This problem involves a challenging nonconvex spectral radius term in the objective function. To address this challenge, we introduce an enhanced majorization-minimization-based approach that leverages a novel surrogate function to effectively upper bound the spectral radius function. Simulation results show that the proposed method provides substantial performance improvements over existing heuristic methods for broadcast probability optimization.
Full waveform inversion (FWI) is a challenging, ill-posed nonlinear inverse problem that requires robust regularization techniques to stabilize the solution and yield geologically meaningful results, especially when d...
详细信息
Full waveform inversion (FWI) is a challenging, ill-posed nonlinear inverse problem that requires robust regularization techniques to stabilize the solution and yield geologically meaningful results, especially when dealing with sparse data. Standard Tikhonov regularization, though commonly used in FWI, applies uniform smoothing that often leads to oversmoothing of key geological features, as it fails to account for the underlying structural complexity of the subsurface. To overcome this limitation, we propose an FWI algorithm enhanced by a novel Tikhonov regularization technique involving a parametric regularizer, which is automatically optimized to apply directional space-variant smoothing. Specifically, the parameters defining the regularizer (orientation and anisotropy) are treated as additional unknowns in the objective function, allowing the algorithm to estimate them simultaneously with the model. We introduce an efficient numerical implementation for FWI with the proposed space-variant regularization. Numerical tests on sparse data demonstrate the proposed method's effectiveness and robustness in reconstructing models with complex structures, significantly improving the inversion results compared with the standard Tikhonov regularization.
Movable antenna (MA) is a new technology which leverages local movement of antennas to improve channel qualities and enhance the communication performance. Nevertheless, to fully realize the potential of MA systems, c...
详细信息
Movable antenna (MA) is a new technology which leverages local movement of antennas to improve channel qualities and enhance the communication performance. Nevertheless, to fully realize the potential of MA systems, complete channel state information (CSI) between the transmitter-MA and the receiver-MA is required, which involves estimating a large number of channel parameters and incurs an excessive amount of training overhead. To address this challenge, in this letter, we propose a CSI-free MA position optimization method. The basic idea is to treat position optimization as a derivative-free problem involving an unknown objective function and calculate the gradient of the unknown objective function using zeroth-order (ZO) gradient approximation techniques. Simulation results show that the proposed ZO-based method, through adaptively adjusting the position of the MA, can achieve a favorable signal-to-noise-ratio (SNR) using a smaller number of position measurements than the CSI-based approach. Such a merit makes the proposed algorithm more adaptable to fast-changing propagation channels.
We consider the problem of robustly fitting a model to data that includes outliers by formulating a percentile optimization problem. This problem is non-smooth and non-convex, hence hard to solve. We derive properties...
详细信息
We consider the problem of robustly fitting a model to data that includes outliers by formulating a percentile optimization problem. This problem is non-smooth and non-convex, hence hard to solve. We derive properties that the minimizers of such problems must satisfy. These properties lead to methods that solve the percentile formulation both for general residuals and for convex residuals. The methods fit the model to subsets of the data, and then extract the solution of the percentile formulation from these partial fits. As illustrative simulations show, such methods endure higher outlier percentages, when compared with standard robust estimates. Additionally, the derived properties provide a broader and alternative theoretical validation for existing robust methods, whose validity was previously limited to specific forms of the residuals.
Graph-based multi-view clustering has garnered considerable attention owing to its effectiveness. Nevertheless, despite the promising performance achieved by previous studies, several limitations remain to be addresse...
详细信息
Graph-based multi-view clustering has garnered considerable attention owing to its effectiveness. Nevertheless, despite the promising performance achieved by previous studies, several limitations remain to be addressed. Most graph-based models employ a two-stage strategy involving relaxation and discretization to derive clustering results, which may lead to deviation from the original problem. Moreover, graph-based methods do not adequately address the challenges of overlapping clusters or ambiguous cluster membership. Additionally, assigning appropriate weights based on the importance of each view is crucial. To address these problems, we propose a self-weighted multi-view fuzzy clustering algorithm that incorporates multiple graph learning. Specifically, we automatically allocate weights corresponding to each view to construct a fused similarity graph matrix. Subsequently, we approximate it as the scaled product of fuzzy membership matrices to directly derive clustering assignments. An iterative optimization algorithm is designed for solving the proposed model. Experiment evaluations conducted on benchmark datasets illustrate that the proposed method outperforms several leading multi-view clustering approaches.
Joint admission control and power minimization are critical challenges in intelligent reflecting surface (IRS)-assisted networks. Traditional methods often rely on $ l_{1} $ -norm approximations and alternating optimi...
详细信息
Joint admission control and power minimization are critical challenges in intelligent reflecting surface (IRS)-assisted networks. Traditional methods often rely on $ l_{1} $ -norm approximations and alternating optimization (AO) techniques, which suffer from high computational complexity and lack robust convergence guarantees. To address these limitations, we propose a sigmoid-based approximation of the $ l_{0} $ -norm AC indicator, enabling a more efficient and tractable reformulation of the problem. Additionally, we introduce a penalty dual decomposition (PDD) algorithm to jointly optimize beamforming and admission control, ensuring convergence to a stationary solution. This approach reduces computational complexity and supports distributed implementation. Moreover, it outperforms existing methods by achieving lower power consumption, accommodating more users, and reducing computational time.
This letter investigates the low-variance broad beampattern design method in distributed phased multiple-input multiple-output (phased-MIMO) radar. The constant modulus constraint across multiple subarrays results in ...
详细信息
This letter investigates the low-variance broad beampattern design method in distributed phased multiple-input multiple-output (phased-MIMO) radar. The constant modulus constraint across multiple subarrays results in a low-rank and nonconvex objective function, which is traditionally addressed by reformulating it into a solvable semidefinite program through convex relaxation. In contrast, we propose a Riemannian manifold-based method to directly address the low-rank problem without relaxation. The low-variance broad beampattern design is first transformed into an unconstrained quadratic form on a complex constant modulus manifold. Then, a Riemannian conjugate gradient descent (RCGD)-based optimization is proposed to solve the nonconvex objective function by deriving the gradient descent direction and adaptive step size. Numerical simulations demonstrate the superior performance in terms of computation speed and accuracy compared to the conventional methods.
We investigate the joint admission control and discrete-phase multicast beamforming design for integrated sensing and commmunications (ISAC) systems, where sensing and communications functionalities have different hie...
详细信息
We investigate the joint admission control and discrete-phase multicast beamforming design for integrated sensing and commmunications (ISAC) systems, where sensing and communications functionalities have different hierarchies. Specifically, the ISAC system first allocates resources to the higher-hierarchy functionality and opportunistically uses the remaining resources to support the lower-hierarchy one. This resource allocation problem is a nonconvex mixed-integer nonlinear program (MINLP). We propose an exact mixed-integer linear program (MILP) reformulation, leading to a globally optimal solution. In addition, we implemented three baselines for comparison, which our proposed method outperforms by more than 39%.
Numerical optimization techniques are widely used in microwave circuits but are limited to fixed topologies, constraining their achievable performance and suffering from suboptimal designs. This letter presents a nove...
详细信息
Numerical optimization techniques are widely used in microwave circuits but are limited to fixed topologies, constraining their achievable performance and suffering from suboptimal designs. This letter presents a novel topological algorithm that can automatically synthesize practical circuit layouts that can satisfy prescribed specifications without preselecting the topology. To achieve this goal, the proposed method integrates a pixelated circuit generation strategy with the differential evolution algorithm (DEA). A new objective function is also developed to match the fundamental impedances while controlling harmonic responses. Good agreement between simulation and measurements for a wideband high-efficiency power amplifier (PA) validates the proposed algorithm.
暂无评论