Search arXivSearch

arXiv · 2609.21441

Interference-Driven Clustered Optimisation for FM Spectrum Coordination

Abstract

Cross-border FM spectrum coordination involves protecting foreign broadcasting services while preserving domestic coverage, amid increasingly large radio-planning datasets containing thousands of transmitters and millions of transmitter-pixel relationships. In such scenarios, conventional optimisation approaches become computationally demanding due to the high dimensionality of the associated power-control problem. This paper proposes an interference-driven clustered optimisation framework for large-scale FM spectrum coordination. The proposed method exploits the observation that violations of foreign-service protection are typically dominated by a limited subset of transmitters. Protected services are therefore analysed to identify dominant interferers and quantify their impact on interference. These relationships are represented through an interference graph from which optimisation-oriented transmitter clusters are extracted. The clusters decompose the global power-control problem into smaller optimisation tasks solved with clustered simulated annealing, followed by a global refinement that captures residual inter-cluster interactions. Coverage and interference are evaluated using frequency-dependent protection criteria and a dynamic strongest-service assignment model. To enable operational-scale planning, the framework uses sparse matrices and GPU-accelerated computations. Tests on realistic cross-border FM coordination scenarios show that the clustering strategy greatly reduces optimisation complexity and runtime while maintaining foreign-service protection and domestic coverage. The method also yields an interpretable ranking of transmitters that contribute most to harmful interference, supporting optimisation and spectrum planning.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Federica Mangiatordi, Emiliano Pallotti. 2026-09-18. Interference-Driven Clustered Optimisation for FM Spectrum Coordination. https://arxiv.org/abs/2609.21441

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

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT