Quasi-optimal grouping for broadcast systems with hierarchical modulation

TL;DR

This paper demonstrates that optimal receiver grouping for broadcast systems with hierarchical modulation can be formulated as an assignment problem, enabling the use of efficient algorithms like the Hungarian method to maximize spectrum efficiency.

Contribution

It introduces a novel formulation of the receiver grouping problem as an assignment problem and applies efficient algorithms to optimize spectrum efficiency in DVB-S2 systems.

Findings

Optimal grouping is solvable via assignment algorithms.

The Hungarian method effectively finds the best receiver pairing.

Performance improvements in spectrum efficiency are demonstrated.

Abstract

Recently, we proposed to combine time sharing with hierarchical modulation to increase the transmission rate of broadcast systems. Our proposal involves to group the receivers in pairs in order to transmit with hierarchical modulation. We introduced several grouping strategies but the optimal matching remained an open question. In this letter, we show that the optimal grouping is the solution of an assignment problem, for which efficient algorithms exist such as the Hungarian method. Based on this algorithm, we study the performance of the optimal grouping in terms of spectrum efficiency for a DVB-S2 system.