Share Email Print

Journal of Electronic Imaging

Fast and robust fixed-length packetization algorithm for set partitioning in hierarchical trees bit stream over packet erasure channels
Author(s): Jianming Wei; Ezzatollah Salari
Format Member Price Non-Member Price
PDF $20.00 $25.00

Paper 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.

Paper Details

Date Published: 1 January 2007
PDF: 11 pages
J. Electron. Imaging. 16(1) 013007 doi: 10.1117/1.2434988
Published in: Journal of Electronic Imaging Volume 16, Issue 1
Show Author Affiliations
Jianming Wei, Univ. of Toledo (United States)
Ezzatollah Salari, Univ. of Toledo (United States)

© SPIE. Terms of Use
Back to Top