Type-based Over-the-Air Computation

Abstract

Over-the-air computation (OAC) exploits the superposition property of wireless channels to compute functions of distributed data, reducing the communication overhead associated with its multiple access. However, existing OAC frameworks are often designed around specific classes of functions, limiting their applicability to more general nonlinear computations. This paper investigates type-based multiple access (TBMA) as a general framework for OAC, enabling the receiver to recover a histogram of the distributed observations and compute a broad class of functions without modifying the underlying communication scheme. We formulate TBMA as a histogram estimation problem and propose two digital detectors. We prove that a low-complexity successive cancellation algorithm achieves the optimal maximum-likelihood (ML) performance. We derive analytical expressions for the mean squared error (MSE) and compare TBMA with conventional schemes in terms of computation accuracy, transmission duration, bandwidth and energy consumption. Numerical experiments validate the analytical results and demonstrate that, unlike existing OAC techniques, TBMA exhibits an exponential MSE decay with increasing signal-to-noise ratio (SNR) and constant transmit energy, independently of the function being computed. These findings position TBMA as a step toward more versatile OAC architectures, compatible with existing transmission schemes, and broadening the range of functions that can be computed directly over the wireless channel and enabling new possibilities for distributed computation and decision-making.