惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

美团技术团队
J
Java Code Geeks
有赞技术团队
有赞技术团队
GbyAI
GbyAI
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 叶小钗
阮一峰的网络日志
阮一峰的网络日志
Microsoft Security Blog
Microsoft Security Blog
IT之家
IT之家
G
Google Developers Blog
月光博客
月光博客
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
S
SegmentFault 最新的问题
博客园 - 三生石上(FineUI控件)
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园 - Franky
腾讯CDC
V
Visual Studio Blog
博客园 - 【当耐特】
D
Docker
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Engineering at Meta
Engineering at Meta
L
LangChain Blog

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
How Many Simultaneous Beamformers are Needed for Integrat...
Kareem M. Attiah, Wei Yu · 2025-07-20 · via math updates on arXiv.org

Consider a downlink integrated sensing and communications (ISAC) system in which a base station employs linear beamforming to communicate to $K$ users, while simultaneously uses sensing beams to perform a sensing task of estimating $L$ real parameters. How many beamformers are needed to achieve the best performance for both sensing and communications? This paper establishes bounds on the minimum number of downlink beamformers, in which sensing performance is measured in terms of the Cramér-Rao bound for parameter estimation and communications performance is measured in terms of the signal-to-interference-and-noise ratios. We show that an ISAC system requires at most $K + \sqrt{\frac{L(L+1)}{2}}$ beamformers if the remote users have the ability to cancel the interference caused by the sensing beams. If cancelling interference due to the sensing beams is not possible, the bound becomes $\sqrt{K^2 + \frac{L(L+1)}{2}}$. Interestingly, in the latter case, the bound on the number of beamformers is less than the sum of the bounds for each task individually. These results can be extended to sensing tasks for which the performance is measured as a function of $d$ quadratic terms in the beamformers. In this case, the bound becomes $K + \sqrt{d}$ and $\sqrt{K^2 + d}$, respectively. Specifically, for estimating complex path losses and angles-of-arrival of $N_\text{tr}$ targets while communicating to $K$ users, the bound on the minimum number of beamformers scales linearly in $K$ and in $N_\text{tr}$, assuming interference from sensing can be cancelled. When interference cancellation is not possible, the following exact characterization for the case of $N_\text{tr} = 1$ can be obtained: when $K=0$ or $1$, two beamformers should be used; when $K \ge 2$, exactly $K$ beamformers should be used, i.e., communication beamformers alone are already sufficient.