A binary-switched parasitic antenna array with a quadratic current approximation achieves beamforming performance comparable to fully active arrays with significantly more RF chains.
Title resolution pending
12 Pith papers cite this work. Polarity classification is still indexing.
12
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
roles
method 1polarities
use method 1representative citing papers
Factor graph optimization problems can be lifted via Shor's relaxation and Burer-Monteiro factorization to produce certifiable estimators that preserve the original factor graph connectivity and can be implemented with existing libraries.
The paper extends uplink-downlink duality to integrated sensing and communications, equating BCRB minimization to directional power maximization and enabling iterative beamformer optimization under SINR constraints.
ProF repairs DNNs for individual fairness by using interval bound propagation to bound outputs over input sets and solving a MILP to adjust the model with guarantees on those sets.
A unified alpha-fairness scheme for clustered cell-free networking is achieved via closed-form deterministic equivalents and tight continuous relaxations that are exactly equivalent to the integer program in four cases of alpha.
A new LNS-based planner solves weighted-max multi-objective problems 10-100x faster than prior methods with comparable solution quality.
Derives closed-form links between per-subcarrier constellation statistics and sensing metrics for MF and RF receivers, proves at most three constellations suffice for Pareto optimality in flat fading, and gives a bilevel algorithm for frequency-selective channels with experimental validation.
A decentralized control framework using time-varying nonsmooth Lyapunov functions lets each agent satisfy only a local constraint, while the sum still converges, including exact decentralized coverage of time-varying densities.
A tractable robust beamforming framework for DMA transmitters in bistatic sensing, accounting for mutual coupling and waveguide losses, with codebook-based low-complexity designs matching digital benchmarks in simulation.
Introduces M-information as a scalable measure of higher-order information integration in multivariate time series, computed via convex optimization and tested on neuronal and neuroimaging data.
A method that obtains equality constraints for NPA-style SDP relaxations by randomly sampling quantum moment matrices to bound quantum correlations.
citing papers explorer
-
Parasitic MIMO Beamforming for Multi-Active Multi-Parasitic Antenna Arrays with Binary Control
A binary-switched parasitic antenna array with a quadratic current approximation achieves beamforming performance comparable to fully active arrays with significantly more RF chains.
-
Certifiable Factor Graph Optimization
Factor graph optimization problems can be lifted via Shor's relaxation and Burer-Monteiro factorization to produce certifiable estimators that preserve the original factor graph connectivity and can be implemented with existing libraries.
-
Uplink-Downlink Duality for Beamforming in Integrated Sensing and Communications
The paper extends uplink-downlink duality to integrated sensing and communications, equating BCRB minimization to directional power maximization and enabling iterative beamformer optimization under SINR constraints.
-
Provable Fairness Repair for Deep Neural Networks
ProF repairs DNNs for individual fairness by using interval bound propagation to bound outputs over input sets and solving a MILP to adjust the model with guarantees on those sets.
-
Achieving $\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach
A unified alpha-fairness scheme for clustered cell-free networking is achieved via closed-form deterministic equivalents and tight continuous relaxations that are exactly equivalent to the integer program in four cases of alpha.
-
Efficient Multi-Objective Planning with Weighted Maximization Using Large Neighbourhood Search
A new LNS-based planner solves weighted-max multi-objective problems 10-100x faster than prior methods with comparable solution quality.
-
Constellation Selection and Power Control for OFDM-based ISAC: From Theory to Prototype
Derives closed-form links between per-subcarrier constellation statistics and sensing metrics for MF and RF receivers, proves at most three constellations suffice for Pareto optimality in flat fading, and gives a bilevel algorithm for frequency-selective channels with experimental validation.
-
Disentangled Control of Multi-Agent Systems
A decentralized control framework using time-varying nonsmooth Lyapunov functions lets each agent satisfy only a local constraint, while the sum still converges, including exact decentralized coverage of time-varying densities.
-
Electromagnetics-Compliant Optimization of Dynamic Metasurface Antennas for Bistatic Sensing
A tractable robust beamforming framework for DMA transmitters in bistatic sensing, accounting for mutual coupling and waveguide losses, with codebook-based low-complexity designs matching digital benchmarks in simulation.
-
A scalable estimator of higher-order information in complex dynamical systems
Introduces M-information as a scalable measure of higher-order information integration in multivariate time series, computed via convex optimization and tested on neuronal and neuroimaging data.
-
Picking NPA constraints from a randomly sampled quantum moment matrix
A method that obtains equality constraints for NPA-style SDP relaxations by randomly sampling quantum moment matrices to bound quantum correlations.
- Coordinated Dynamic Operating Envelopes for Network-Admissible Flexibility at the Grid Edge