Solving the Corner-Turning Problem for Large Interferometers

TL;DR

This paper introduces a cost-effective, real-time data transposition method for large radio interferometers, solving the corner turning bottleneck without high bandwidth or expensive hardware, enabling scalable processing for massive arrays.

Contribution

A novel butterfly network design that transposes large data matrices in real time without additional memory or costly switches, suitable for large-scale radio telescopes.

Findings

The proposed solution operates in real time without bandwidth contention.

Implementation options include FPGA, CMOS, analog, and optical technologies.

Cost remains low even for future large radio arrays.

Abstract

The so-called corner turning problem is a major bottleneck for radio telescopes with large numbers of antennas. The problem is essentially that of rapidly transposing a matrix that is too large to store on one single device; in radio interferometry, it occurs because data from each antenna needs to be routed to an array of processors that will each handle a limited portion of the data (a frequency range, say) but requires input from each antenna. We present a low-cost solution allowing the correlator to transpose its data in real time, without contending for bandwidth, via a butterfly network requiring neither additional RAM memory nor expensive general-purpose switching hardware. We discuss possible implementations of this using FPGA, CMOS, analog logic and optical technology, and conclude that the corner turner cost can be small even for upcoming massive radio arrays.