Fast and robust fixed-length packetization algorithm for set partitioning in hierarchical trees bit stream over packet erasure channels

Abstract

We consider the robust packetization scheme for set par- titioning in hierarchical trees (SPIHT) embedded bit stream over packet erasure channels and propose a fast and robust fixed-length packetization scheme using a two-step process. In the first step, a multiplexer is used to partition the embedded bit stream into multiple variable-length blocks with block sizes close to the fixed packet size. In the second step, a packetized error-resilient entropy code (PEREC) algorithm is proposed to reorganize these variable-length blocks into fixed-size packets to be transmitted over the physical network. Any lost packets have only minor effects on other received packets. Computer simulations show that the proposed method pro- vides both excellent compression performance with fast speed and graceful degradation under serve packet losses. © 2007 SPIE and