Papers
Topics
Authors
Recent
Search
2000 character limit reached

How Many RF Chains Does a Microwave Linear Analog Computer (MiLAC) Need to Match the Fully-Digital Cramér-Rao Bound?

Published 22 Jun 2026 in cs.IT and eess.SP | (2606.23986v1)

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 KK 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.