Approximately optimal assignment for unequal loss protection

A. E. Mohr, R. E. Ladner, E. A. Riskin

Research output: Contribution to conferencePaperpeer-review

74 Scopus citations

Abstract

This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1]. It first finds the optimal assignment under convex hull and fractional bit allocation assumptions. It then relaxes those constraints to find an assignment that approximates the global optimum. The algorithm has a running time of O(hNlogN) where h is the number of points on the convex hull of the source's utility-cost curve and N is the number of packets transmitted.

Original languageEnglish
Pages367-370
Number of pages4
StatePublished - 2000
EventInternational Conference on Image Processing (ICIP 2000) - Vancouver, BC, Canada
Duration: 10 Sep 200013 Sep 2000

Conference

ConferenceInternational Conference on Image Processing (ICIP 2000)
Country/TerritoryCanada
CityVancouver, BC
Period10/09/0013/09/00

Fingerprint

Dive into the research topics of 'Approximately optimal assignment for unequal loss protection'. Together they form a unique fingerprint.

Cite this