Data Compression Conference (2002)
Snao Bird, Utah
Apr. 2, 2002 to Apr. 4, 2002
Zhe Wang , University of Western Ontario
Sorina Dumitrescu , University of Western Ontario
Xiaolin Wu , University of Western Ontario
In this extended abstract we present a family of new algorithms for rate-fidelity optimal packetization of scalable source bit stream with uneven error protection. In the most general setting where no assumption is made on the probability function of pack et loss or on the rate-fidelity function of the scalable code stream, one of our algorithms can find the globally optimal solution to the problem in time, compared to a previously claimed complexity, whereN is the number of packets and L is the packet payload size. The time complexity can be reduced to if the rate-fidelity function of the input is convex and under the reasonable assumption that the probability function of packet loss is monotonically decreasing.In the convex case the algorithm of Mohr et al.  has complexity . Furthermore,our algorithm for the convex case can be modified to find an approximation solution for the general case that is better than the results of other algorithms in the prior literature. All of our algorithms do away with the expediency of fractional redundancy allocation, a limitation of some existing algorithms. To our best knowledge this work offers for the first time globally optimal solutions to the important problem of optimal UEP packetization.
Zhe Wang, Sorina Dumitrescu, Xiaolin Wu, "Globally Optimal Uneven Error-Protected Packetization of Scalable Code Streams", Data Compression Conference, vol. 00, no. , pp. 0073, 2002, doi:10.1109/DCC.2002.999945