Abstract
The paper is about the planning of ensembles and block assignments for DAB (Digital Audio Broadcasting) networks. Besides offering superior audio quality and multimedia data services, DAB has the potential to use the available frequency resources much more efficiently than other (analog or digital) audio broadcast systems, since it has the capability to transmit an ensemble of radio programs and data services over large regions using just a single frequency. However, to fully exploit this feature new planning methods are needed. The paper discusses a possible solution approach which leads to a combined bin packing/graph coloring problem. It is shown how this problem can be solved using heuristics, how to obtain lower bounds to estimate the quality of computed solutions, and which generalizations of the problem statement arise in practical planning scenarios. The same methods also apply to other digital broadcast systems based on similar technology like, e.g., digital video broadcasting (DVB-T).
Similar content being viewed by others
References
D. Brélaz, New methods to color the vertices of a graph, Communications of the ACM 22(4) (1979) 251-256.
H. Breu, Algorithmic aspects of constrained unit disk graphs, Ph.D. thesis, Department of Computer Science, University of British Columbia (1996).
R. Carraghan and P.M. Pardalos, An exact algorithm for the maximum clique problem, Operations Research Letters 9 (1990) 375-382.
B.N. Clark, C.J. Colbourn and D.S. Johnson, Unit disk graphs, Discrete Mathematics 86 (1990) 165-177.
P. Crescenzi and V. Kann, A compendium of NP optimization problems (1999), http://www.nada.kth.se/theory/problemlist.html.
M.R. Garey and D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Computer Science and Applied Mathematics (Academic Press, New York, 1980).
A. Gräf, Coloring and recognizing special graph classes, Ph.D. thesis, Johannes Gutenberg-Universität Mainz, Germany (1995).
R.L. Graham, M. Grötschel and L. Lovász (eds), Handbook of Combinatorics North-Holland, Amsterdam, 1995).
W.K. Hale, Frequency assignment: Theory and applications, Proceedings of IEEE 68 (1980) 1497-1514.
T.R. Jensen and B. Toft, Graph Coloring Problems (Wiley, New York, 1995).
D.W. Matula and L.L. Beck, Smallest-last ordering and clustering and graph coloring algorithms, Journal of the Association of Computing Machinery 30(3) (1983) 417-427.
A. Quellmalz, Graphenorientierte Planung von Sendernetzen, Südwestfunk Schriftenreihe Rundfunktechnik 3 (Nomos Verlagsgesellschaft, Baden-Baden, 1993).
F.S. Roberts, T-colorings of graphs: Recent results and open problems, Discrete Mathematics 93 (1991) 229-245.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gräf, A. DAB Ensemble Planning – Problems and Techniques. Telecommunication Systems 18, 137–154 (2001). https://doi.org/10.1023/A:1016795620388
Issue Date:
DOI: https://doi.org/10.1023/A:1016795620388