
Quasi‐optimal grouping for broadcast systems with hierarchical modulation
Author(s) -
Méric H.,
Piquer J.M.,
Lacan J.
Publication year - 2014
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2014.2222
Subject(s) - computer science , broadcasting (networking) , modulation (music) , transmission (telecommunications) , matching (statistics) , algorithm , computer network , telecommunications , mathematics , philosophy , statistics , aesthetics
Recently, the present authors proposed to combine time sharing with hierarchical modulation to increase the transmission rate of broadcast systems. The proposal involves grouping the receivers in pairs in order to transmit with hierarchical modulation. Several grouping strategies were introduced but the optimal matching remained an open question. In this reported work, it is shown 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, the performance of the optimal grouping in terms of spectrum efficiency for a digital video broadcasting – satellite – second generation (DVB‐S2) system is studied.