VLSI Implementation of a Modified Efficient SPIHT Encoder

Authors:
Win-Bin Huang;Alvin W. Y. Su;Yau-Hwang Kuo
Affiliations:
The authors are with the Department of Computer Science and Information Engineering, National Cheng-Kung University, Tainan, Taiwan, R.O.C. E-mail: huangwb@cad.csie.ncku.edu.tw;The authors are with the Department of Computer Science and Information Engineering, National Cheng-Kung University, Tainan, Taiwan, R.O.C. E-mail: huangwb@cad.csie.ncku.edu.tw;The authors are with the Department of Computer Science and Information Engineering, National Cheng-Kung University, Tainan, Taiwan, R.O.C. E-mail: huangwb@cad.csie.ncku.edu.tw
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2006

Citing 0
Cited 3

Very low-memory wavelet compression architecture using strip-based processing for implementation in wireless sensor networks

EURASIP Journal on Embedded Systems - Special issue on design and architectures for signal and image processing
Low-memory video compression architecture using strip-based processing for implementation in wireless multimedia sensor networks

International Journal of Sensor Networks
VLSI architecture of arithmetic coder used in SPIHT

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Set Partitioning in Hierarchical Trees (SPIHT) is a highly efficient technique for compressing Discrete Wavelet Transform (DWT) decomposed images. Though its compression efficiency is a little less famous than Embedded Block Coding with Optimized Truncation (EBCOT) adopted by JPEG2000, SPIHT has a straight forward coding procedure and requires no tables. These make SPIHT a more appropriate algorithm for lower cost hardware implementation. In this paper, a modified SPIHT algorithm is presented. The modifications include a simplification of coefficient scanning process, a 1-D addressing method instead of the original 2-D arrangement of wavelet coefficients, and a fixed memory allocation for the data lists instead of a dynamic allocation approach required in the original SPIHT. Although the distortion is slightly increased, it facilitates an extremely fast throughput and easier hardware implementation. The VLSI implementation demonstrates that the proposed design can encode a CIF (352 × 288) 4:2:0 image sequence with at least 30 frames per second at 100-MHz working frequency.