Search arXivSearch

arXiv · 2607.10637

Detector-level simulation closure of radio air-shower reconstruction with native RF-chain inversion and out-of-fold endpoint interpolation

Abstract

Autonomous radio arrays reconstruct air showers from trigger-selected digitized voltage traces rather than ideal electric-field footprints. We present a detector-level simulation-closure test linking RF-chain-triggered ZHAireS event packages to reconstructed direction, energy and quality diagnostics. Voltage amplitudes and station timing determine geometry through a robust joint timing--amplitude axis fit. Native-grid RF-chain inversion recovers 50--200 MHz electric-field peaks along the shower-plane v cross B axis. Symmetric four-arm iron and proton templates generated with 2 ns time bins provide endpoint estimates that are combined by a nested five-fold out-of-fold interpolation estimator. One estimator is used over the full angular range without a fitted multiplicative energy scale. Of 972 triggered event packages, 725 pass common quality selection in raw-noisy weighted, hard-gated denoised equal-weight and clean equal-weight branches. In the primary reconstructed-zenith range 60--85 degrees, 693 common events have mean energy residuals of -0.05, -0.30 and -0.66 percent with standard deviations of 11.04, 10.90 and 10.75 percent. The hard-gated denoised branch has a median angular separation of 0.052 degrees. Boundary zenith ranges are reported separately; the upper boundary has a mean energy residual of +14.2 percent and a 19.9 percent standard deviation. These results describe cross-fitted closure within a matched simulation framework, not deployed-array resolution or independent energy calibration.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xin Xu, Pengfei Zhang, Fufu Yang, Xiaosong Liu, Chao Zhang. 2026-07-22. Detector-level simulation closure of radio air-shower reconstruction with native RF-chain inversion and out-of-fold endpoint interpolation. https://arxiv.org/abs/2607.10637

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Simons Observatory: Development of a Pipeline to Detect Rapid Transients in Time-Ordered Data

We introduce a method for detecting astrophysical transients evolving on timescales of milliseconds to minutes using cosmic microwave background (CMB) survey telescopes. While previous transient searches in CMB data operate in map space, our pipeline directly processes the raw time-ordered data, enabling sensitivity to fast, dynamic signals. We integrate our detection approach into the Simons Observatory time-domain pipeline and assess the performance by injecting symmetric, stellar flare-like light curves into simulated observations. For events flaring with a timescale of 0.5 s, the pipeline detects $\gtrsim90$ % of events at flux densities of 800, 1150, 1650, and 4250\,mJy when measured in the 93, 145, 225, and 280 GHz bands respectively. At a fixed peak flux density, the pipeline more readily detects longer flares. The limiting flux density for 90 % completeness is four times lower for a $\ge5$ s flare than for a 0.5 s flare, while the flux density limits for $\gtrsim50$ % detection efficiency are comparable to the rms noise of the time-ordered data. We are able to determine the position of detected events in each observing band, with a positional uncertainty at the detection threshold comparable to the telescope resolution at that band. These results demonstrate the readiness of this pipeline for incorporation into upcoming Simons Observatory data analyses.

astro-ph.IM

Fitting Moving Objects in Up-The-Ramp Data with Applications to the Roman Space Telescope and JWST

A moving object breaks the fundamental property of constant per-pixel count rates in an astronomical image read out up-the-ramp. In this paper, we show how to fit a moving object's path across a detector as that detector is read out nondestructively. We write the full likelihood function for every pixel subject to a constant count rate plus a time-dependent count rate due to a moving source. Assuming the moving source to be point-like and assuming the effective point-spread function to be known, we are left with four parameters that enter the likelihood nonlinearly: two for position and two for velocity. All remaining parameters can be optimized using closed-form expressions. Our approach extracts maximal information on a moving source's position and speed and enables the source to be accurately removed from the image. We investigate the dependence of flux, position, and velocity precision on the target's speed and the readout pattern. We also find a small, positive bias on the recovered flux due to the need to fit for an uncertain position and speed. Our approach can be used for space-based images with minor Solar system bodies in the foreground, e.g.~from Roman and JWST, or for ground-based observations with satellites in the foreground. We demonstrate the promise of our method with a fit to an asteroid track observed serendipitously by the NIRISS instrument on JWST, comparing it to the performance of the JWST pipeline. Python code implementing our approach is available at https://github.com/t-brandt/moving_source. The total computational cost to fit the track of a moving object is $\sim$1 second on a 2023 Macbook Pro.

astro-ph.IM

Options for Compression of radio interferometry data: lossy compression of visibilities and lossless compression of uv-visibility grids for the MHONGOOSE survey

Next generation radio astronomy telescopes are challenging existing data reduction paradigms. With ever more antennas, larger bandwidths, and sometimes multiple primary beams, they often generate more observed data products than can readily be stored long-term. Thus, data storage becomes a major cost driver and processing constraint. In this paper, we test two methods of addressing this problem: grid-stacking, a two-stage lossless compression solution; and the lossy compression of the raw visibilities before traditional processing. To demonstrate these solutions we utilised a deep imaging pipeline based on software for the ASKAP telescope, ASKAPSoft, but applied to a strong source (NGC1566) from the deep MeerKAT HI spectral line project, MHONGOOSE. The grid-stacking solution reproduces the spectrum from traditional processing to within better than 0.7%, and also allows for the reconstruction of other weighting scales without significant computing costs. In comparison, image-stacking also reproduces the spectrum from the traditional processing, to within better than 3% but with worse image residuals in the cube. The lossy compression, even at a near ten-fold reduction in file size, reproduces the spectra almost perfectly (to better than ~0.01% in all cases). Thus both compression methods are promising solutions, and we discuss considerations for their application.

astro-ph.IM