Regular Articles

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

[+] Author Affiliations
Jianming Wei

University of Toledo, Department of Electrical Engineering and Computer Science, Toledo, Ohio 43606

Ezzatollah Salari

University of Toledo, Department of Electrical Engineering and Computer Science, Toledo, Ohio 43606

J. Electron. Imaging. 16(1), 013007 (January 26, 2007). doi:10.1117/1.2434988
History: Received March 23, 2006; Revised October 25, 2006; Accepted November 09, 2006; Published January 26, 2007
Text Size: A A A

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.

Figures in this Article
© 2007 SPIE and IS&T

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", J. Electron. Imaging. 16(1), 013007 (January 26, 2007). ; http://dx.doi.org/10.1117/1.2434988


Access This Article
Sign in or Create a personal account to Buy this article ($20 for members, $25 for non-members).

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging & repositioning the boxes below.

Related Book Chapters

Topic Collections

Advertisement
  • Don't have an account?
  • Subscribe to the SPIE Digital Library
  • Create a FREE account to sign up for Digital Library content alerts and gain access to institutional subscriptions remotely.
Access This Article
Sign in or Create a personal account to Buy this article ($20 for members, $25 for non-members).
Access This Proceeding
Sign in or Create a personal account to Buy this article ($15 for members, $18 for non-members).
Access This Chapter

Access to SPIE eBooks is limited to subscribing institutions and is not available as part of a personal subscription. Print or electronic versions of individual SPIE books may be purchased via SPIE.org.