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

推荐订阅源

量子位
Vercel News
Vercel News
Microsoft Azure Blog
Microsoft Azure Blog
爱范儿
爱范儿
N
Netflix TechBlog - Medium
Google DeepMind News
Google DeepMind News
H
Help Net Security
罗磊的独立博客
The Cloudflare Blog
J
Java Code Geeks
博客园 - 叶小钗
I
InfoQ
B
Blog
Blog — PlanetScale
Blog — PlanetScale
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
腾讯CDC
月光博客
月光博客
博客园_首页
雷峰网
雷峰网
M
MIT News - Artificial intelligence
博客园 - 【当耐特】
美团技术团队
T
The Blog of Author Tim Ferriss
博客园 - 司徒正美

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 RF Chains Does a Microwave Linear Analog Compute...
[Submitted on 22 Jun 2026] · 2026-06-24 · via math updates on arXiv.org

View PDF

Abstract:A microwave linear analog computer (MiLAC) is a tunable microwave network that performs linear operations directly on radio-frequency signals through wave propagation. Used as an antenna-array front end, it can map many antenna signals to a small number of active RF chains. While lossless reciprocal MiLACs have been shown to provide flexible or capacity-achieving beamforming for wireless communications, their sensing performance remains largely unexplored. We analyze direction-of-arrival estimation for $K$ far-field targets using a tunable receive-side lossless reciprocal MiLAC combiner. We show that the Fisher information matrix depends on the combiner only through the orthogonal projector onto its row space and never exceeds that of a fully digital receiver. Equality holds when the row space contains the $2K$-dimensional joint steering--derivative subspace, establishing a zero-gap threshold of two RF chains per target. A dimension-counting argument lower-bounds the number of tunable components required to achieve the digital Cramér--Rao bound for every target configuration. The stem-connected MiLAC attains this bound asymptotically, up to an antenna-count-independent additive overhead, while scaling linearly with the antenna and target counts. Unlike a phase-shifter front end with the same number of RF chains, MiLAC can exactly attain the fully digital bound. Numerical results validate the analysis.

Submission history

From: Yuchen Zhang [view email]
[v1] Mon, 22 Jun 2026 22:34:22 UTC (128 KB)