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

Jianming Wei; Ezzatollah Salari

doi:10.1117/1.2434988

Translator Disclaimer

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

Jianming Wei, Ezzatollah Salari

Author Affiliations +

J. of Electronic Imaging, 16(1), 013007 (2007). https://doi.org/10.1117/1.2434988

Abstract

We consider the robust packetization scheme for set partitioning 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 provides both excellent compression performance with fast speed and graceful degradation under serve packet losses.

©(2007) Society of Photo-Optical Instrumentation Engineers (SPIE)

Citation Download Citation

Jianming Wei and Ezzatollah Salari "Fast and robust fixed-length packetization algorithm for set partitioning in hierarchical trees bit stream over packet erasure channels," Journal of Electronic Imaging 16(1), 013007 (1 January 2007). https://doi.org/10.1117/1.2434988

Published: 1 January 2007

ACCESS THE FULL ARTICLE