Quasi-optimal grouping for broadcast systems with hierarchical modulation
Networking and Internet Architecture
2014-06-18 v1 Information Theory
math.IT
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.
Keywords
Cite
@article{arxiv.1406.4491,
title = {Quasi-optimal grouping for broadcast systems with hierarchical modulation},
author = {Hugo Meric and José Piquer and Jérôme Lacan},
journal= {arXiv preprint arXiv:1406.4491},
year = {2014}
}
Comments
Submitted