ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Discrete Applied Mathematics
Volume 156, Issue 3, 1 February 2008, Pages 339-351
Combinatorial Optimization 2004, CO2004
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (622 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.dam.2007.03.027    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2007 Elsevier B.V. All rights reserved.

Time offset optimization in digital broadcastingstar, open

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Carlo Manninob, E-mail The Corresponding Author, Fabrizio Rossia, Corresponding Author Contact Information, E-mail The Corresponding Author, Antonio Sassanob, E-mail The Corresponding Author and Stefano Smriglioa, E-mail The Corresponding Author

aDipartimento di Informatica, Università di L’Aquila, Via Vetoio, I-67010 L’Aquila, Italy

bDipartimento di Informatica e Sistemistica, Università di Roma “Sapienza”, Via Ariosto, 25, I-00185 Roma, Italy


Received 30 June 2004; 
revised 8 June 2005; 
accepted 6 March 2007. 
Available online 18 May 2007.

Abstract

We investigate a planning problem arising in the forthcoming digital video broadcasting (DVB-T) system. Unlike current analog systems, the DVB-T standard allows a mitigation of the interference by means of a suitable synchronization of the received signals. The problem we describe in this paper is that of finding a time offset to impose to the signal emitted by each transmitter of the network, so as to maximize the network (territory) coverage (TOP, time offset problem). We show that, unlike related problems in which other transmitter parameters are taken as decision variables (e.g., emission powers or frequencies), TOP has a nice and algorithmically exploitable combinatorial structure. Namely, we introduce an exponentially sized set covering formulation of TOP, in which constraints are dynamically generated by a polynomial time oracle. We show the effectiveness of the approach through extensive experiments on the reference test bed of the Italian DVB-T Frequency Plan.

Keywords: Digital terrestrial broadcasting; Set covering; Shortest paths; Maximum feasible subsystem; Irreducible inconsistent system

Article Outline

1. Introduction
2. System description
2.1. Interference and coverage in DVB-T
3. Problem definition and complexity
3.1. Inconsistent TP sets
3.2. Complexity
4. Problem formulation
4.1. Minimal covers characterization
4.2. SC formulation, algorithm and implementation details
5. Computational experience
6. Conclusions
References




star, openPartly supported by the MIUR project no. 2003014039, Italy.


Corresponding Author Contact InformationCorresponding author. Tel.: +39 0862 433139; fax: +39 0862 433131.

Discrete Applied Mathematics
Volume 156, Issue 3, 1 February 2008, Pages 339-351
Combinatorial Optimization 2004, CO2004
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.