loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Compression Conference (DCC'06)
Distortion Control for Queues with Deadlines
Snowbird, Utah
March 28-March 30
ISBN: 0-7695-2545-8
Azadeh Faridi, University of Maryland
Anthony Ephremides, University of Maryland
We investigate the optimum transmission strategy that minimizes the overall distortion for delaysensitive but distortion-tolerant data. We consider a set of source symbols residing at the transmitter that are encoded into a set of packets using multiresolution source coding. Each packet has a given deadline after which its transmission will be useless. Since multiresolution source codes are being used, the packet lengths can be adjusted by dropping less significant bits in order to allow for the more significant bits of a larger number of packets to be transmitted before the deadline. We find the optimum number of bits that must be transmitted of every packet to minimize the overall distortion when transmissions are error-free. We show that for strictly convex distortion functions the solution is unique and independent of the form of the function, and extend this result to the case where transmitted bits can be affected by noise and find the optimum strategy that leads to the minimum expected distortion. Finally we look at the case where packets arrive according to a given deterministic arrival schedule and present an algorithm that finds the optimum transmission strategy.
Citation:
Azadeh Faridi, Anthony Ephremides, "Distortion Control for Queues with Deadlines," dcc, pp.312-321, Data Compression Conference (DCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.