TY - GEN
T1 - VLSI design of a DWT/modified efficient SPIHT based image codec
AU - Huang, Win Bin
AU - Chang, Yuan Jui
AU - Su, Alvin W.Y.
AU - Kuo, Yau Hwang
N1 - Publisher Copyright:
© 2003 IEEE.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2003
Y1 - 2003
N2 - 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 than famous Embedded Block Coding with Optimized Truncation (EBCOT) adopted by JPEG2000, a codec standard for still images, SPIHT has a straightforward coding procedure and requires no tables. These make SPIHT a more appropriate algorithm for 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 for wavelet coefficients and a fixed memory allocation for the data lists instead of a dynamic allocation required in the original SPIHT. Though distortion is slightly increased, it enjoys an extremely fast throughput and easier hardware implementation. The gate counts of a 16-by-16 DWT/IDWT and a modified SPIHT/Inv-SPIHT are 12,458 and 5,758 respectively. A complete image codec is also provided.
AB - 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 than famous Embedded Block Coding with Optimized Truncation (EBCOT) adopted by JPEG2000, a codec standard for still images, SPIHT has a straightforward coding procedure and requires no tables. These make SPIHT a more appropriate algorithm for 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 for wavelet coefficients and a fixed memory allocation for the data lists instead of a dynamic allocation required in the original SPIHT. Though distortion is slightly increased, it enjoys an extremely fast throughput and easier hardware implementation. The gate counts of a 16-by-16 DWT/IDWT and a modified SPIHT/Inv-SPIHT are 12,458 and 5,758 respectively. A complete image codec is also provided.
UR - http://www.scopus.com/inward/record.url?scp=34547248715&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34547248715&partnerID=8YFLogxK
U2 - 10.1109/ICICS.2003.1292453
DO - 10.1109/ICICS.2003.1292453
M3 - Conference contribution
AN - SCOPUS:34547248715
T3 - ICICS-PCM 2003 - Proceedings of the 2003 Joint Conference of the 4th International Conference on Information, Communications and Signal Processing and 4th Pacific-Rim Conference on Multimedia
SP - 248
EP - 252
BT - ICICS-PCM 2003 - Proceedings of the 2003 Joint Conference of the 4th International Conference on Information, Communications and Signal Processing and 4th Pacific-Rim Conference on Multimedia
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - Joint Conference of the 4th International Conference on Information, Communications and Signal Processing and 4th Pacific-Rim Conference on Multimedia, ICICS-PCM 2003
Y2 - 15 December 2003 through 18 December 2003
ER -