Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quasi-optimal grouping for broadcast systems with hierarchical modulation (1406.4491v1)

Published 17 Jun 2014 in cs.NI, cs.IT, and 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.

Citations (3)

Summary

We haven't generated a summary for this paper yet.