Placing the Beamspace Window on a Hopping Carrier: Bin Drift, Exact Capture and the Cost of Rounding

A frequency-agile radar with a large digital array moves the spatial frequency of its look direction across the beams of a spatial FFT every time it changes carrier, so a beamspace adaptive processor must decide where to put its window at each hop. Because the beamspace transform is orthonormal, the output of the processor depends only on the span of the window, and a hop changes nothing but where the window sits. Centring the window exactly on the fractional bin of the look direction keeps the look vector fully inside it at every carrier, for the price of one phase ramp before the FFT. On a 32 by 32 array over 4 to 8 GHz the look bin drifts by 1.6 to 6.9 bins for look directions from u=0.2 to 60 degrees. Rounding to the nearest bin costs up to 1.34, 0.74 and 0.50 dB of look-direction capture for 3 by 3, 5 by 5 and 7 by 7 windows. In a three-jammer scenario with 41 carriers, a window frozen at the lowest carrier loses 39 to 60 dB at the worst carrier for a look direction of u=0.55, the exact window beats nearest-bin placement by 0.31 to 0.65 dB there, and the advantage reverses for a nine-beam window near broadside, where nearest-bin was 0.61 dB better.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-27
DOI
https://doi.org/10.48550/arxiv.2610.37067
Primary Topic
Direction-of-Arrival Estimation Techniques
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Placing the Beamspace Window on a Hopping Carrier: Bin Drift, Exact Capture and the Cost of Rounding

Andre Martin McDonald, Michaël Antonie van Wyk, Moris S. Mukwayi
arXiv (Cornell University)
Direction-of-Arrival Estimation Techniques
preprint

Placing the Beamspace Window on a Hopping Carrier: Bin Drift, Exact Capture and the Cost of Rounding

Andre Martin McDonald, Michaël Antonie van Wyk, Moris S. Mukwayi
preprint en

Abstract

A frequency-agile radar with a large digital array moves the spatial frequency of its look direction across the beams of a spatial FFT every time it changes carrier, so a beamspace adaptive processor must decide where to put its window at each hop. Because the beamspace transform is orthonormal, the output of the processor depends only on the span of the window, and a hop changes nothing but where the window sits. Centring the window exactly on the fractional bin of the look direction keeps the look vector fully inside it at every carrier, for the price of one phase ramp before the FFT. On a 32 by 32 array over 4 to 8 GHz the look bin drifts by 1.6 to 6.9 bins for look directions from u=0.2 to 60 degrees. Rounding to the nearest bin costs up to 1.34, 0.74 and 0.50 dB of look-direction capture for 3 by 3, 5 by 5 and 7 by 7 windows. In a three-jammer scenario with 41 carriers, a window frozen at the lowest carrier loses 39 to 60 dB at the worst carrier for a look direction of u=0.55, the exact window beats nearest-bin placement by 0.31 to 0.65 dB there, and the advantage reverses for a nine-beam window near broadside, where nearest-bin was 0.61 dB better.

arXiv (Cornell University)
Direction-of-Arrival Estimation Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon