We propose a distortion optimal rate allocation algorithm for robust transmission of embedded bitstreams over noisy channels. The algorithm is based on the backward application of a Viterbi-like algorithm to a search trellis, and can be applied to both scenarios of fixed and variable channel packet length problems, referred to as FPP and VPP, respectively. For the VPP, the complexity of the algorithm is comparable to the well-known dynamic programming approach of Chande and Farvardin. For the FPP, where no low-complexity algorithm is known, the complexity of the proposed algorithm is O(N2), where N is the number of transmitted packets.

, , , , , , , ,
doi.org/10.1109/TCOMM.2008.060593
IEEE Transactions on Communications
Department of Systems and Computer Engineering

Banihashemi, A, & Hatam, A. (Ahmad). (2008). A distortion optimal rate allocation algorithm for transmission of embedded bitstreams over noisy channels. IEEE Transactions on Communications, 56(10), 1581–1584. doi:10.1109/TCOMM.2008.060593