Reciprocity Calibration of Dual-Antenna Repeaters via MMSE Estimation
Shoma Hara, Takumi Takahashi, Hiroki Iimori, Hideki Ochiai, Erik G. Larsson
TL;DR
This work tackles reciprocity calibration in repeater-assisted MIMO under TDD by formulating a Bayesian MMSE framework that leverages detailed prior models for repeater-induced non-reciprocity and measurement noise. It introduces a von Mises denoiser to handle phase constraints on the unit circle and uses a MoM approach to adapt long-term priors, enabling robust, low-complexity calibration with fast convergence. Compared to state-of-the-art NLS methods, the MMSE algorithm delivers substantial accuracy gains, particularly for large-scale arrays, while maintaining comparable online complexity; simulations show improved RMSE across SNRs and rapid convergence (typically ~4 iterations). The practical impact is a more reliable, scalable calibration solution for repeater-enabled MIMO systems, facilitating high-quality beamforming with reduced pilot overhead and calibration latency.
Abstract
This paper proposes a novel Bayesian reciprocity calibration method that consistently ensures uplink and downlink channel reciprocity in repeater-assisted multiple-input multiple-output (MIMO) systems. The proposed algorithm is formulated under the minimum mean-square error (MMSE) criterion. Its Bayesian framework incorporates complete statistical knowledge of the signal model, noise, and prior distributions, enabling a coherent design that achieves both low computational complexity and high calibration accuracy. To further enhance phase alignment accuracy, which is critical for calibration tasks, we develop a von Mises denoiser that exploits the fact that the target parameters lie on the circle in the complex plane. Simulation results demonstrate that the proposed MMSE algorithm achieves substantially improved estimation accuracy compared with conventional deterministic non-linear least-squares (NLS) methods, while maintaining comparable computational complexity. Furthermore, the proposed method exhibits remarkably fast convergence, making it well suited for practical implementation.
