A fast trellis-based rate-allocation algorithm for robust transmission of progressively coded images over noisy channels

Summary form only given. The fast trellis-based rate-allocation algorithm, which is an improved version of a similar algorithm presented by B.A. Banister et al. (see IEEE Sig. Process. Lett., vol.9, no.4, p.117-19, 2002), is based on the application of the Viterbi algorithm to a search trellis. The proposed algorithm is applied to images progressively encoded by set partitioning in hierarchical trees (SPIHT) and JPEG-2000 for transmission over noisy binary symmetric channels. For different total bit budgets and channel parameters, speed-up factors of up to about three orders of magnitude are achieved.