A Novel VLSI Architecture of SPIHT Using Breadth First Search for Real-Time Applications | Journal of Signal Processing Systems Skip to main content
Springer Nature Link
Log in

A Novel VLSI Architecture of SPIHT Using Breadth First Search for Real-Time Applications

  • Published:
Journal of Signal Processing Systems Aims and scope Submit manuscript

Abstract

A bit-plane parallel architecture for a modified set partitioning in hierarchical trees (SPIHT) without lists algorithm, which uses breadth first search scheme, is proposed. The breadth first search scheme is suitable for very large scale integration (VLSI) implementation based on the analysis of SPIHT algorithm. The architecture has advantages of high parallelism, no intermediate buffer as a single tree is scanned. After field programmable gate arrays (FPGAs) synthesis and simulation, the throughput of the proposed architecture can reach 60 MSample/Sec. As the breadth first search scheme is very similar to that of SPIHT with lists, the quality of reconstructed images is almost the same with that of SPIHT with lists.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11

Similar content being viewed by others

References

  1. Information Technology (2000). JPEG2000 Image Coding System, Part 1: Core Coding System (in ISO/IEC), ISO/IEC 15444–1:2000, September.

  2. Shapiro, J. M. (1993). Embedded Image Coding Using Zerotrees of Wavelet Coefficients. IEEE Trans. on Signal Processing, 41(12), 3445–3462.

    Article  MATH  Google Scholar 

  3. Said, A., & Pearlman, W. A. (1996). A new, fast, and efficient image codec based on set partitioning in hierarchical trees. IEEE Trans. on Circuits and System for Video Technology, 6(3), 243–249.

    Article  Google Scholar 

  4. Analog Devices, INC, (2005, October 11). ADV202 Video Processor User’s Guide [Online].Available: http://www.analog.com/

  5. CAST, INC, (2006, December). JPEG2000 Enocder Core [Online].Available: http://www.xilinx.com/cast_jpeg2k_e-x.pdf

  6. Adams, Michael D., & Faouzi, Kossentini. (2000). Reversible Integer to Integer Wavelet Transform for Image Compression: Performance Evaluation and Analysis. IEEE Trans. on Image Processing, 9(6), 1010–1024.

    Article  MATH  Google Scholar 

  7. Taubman, D. (2000). High performance scalable image compression with EBCOT. IEEE Trans. Image Processing, 9(7), 1158–1170.

    Article  Google Scholar 

  8. Fry, Thomas W., & Hauck, Scott A. (2005). SPIHT Image Compression on FPGAs. IEEE Trans. on Circuits and System for Video Technology, 15(9), 1138–1147.

    Article  Google Scholar 

  9. Herrn, J. R. (2002). “Wavelet based image compression using FPGAs.” Ph.D dissertation, Martin-Luther-University Halle-Wittenberg, Germany.

  10. Bac, J., & Prasanna, V. K. (1995). A fast and area-efficient VLSI architecture for embedded image coding. Proceedings International Conference on Image Processing, 3, 452–455.

    Article  Google Scholar 

  11. Singh, J., Antoniou, A., & Shpak D. J. (1998). “Hardware implementation of a wavelet based image compression coder,” Proceedings 1998 IEEE Symposium on Advances in Digital Filtering and Signal Processing, pp. 169–173, Jun.

  12. Ang, L., Cheung, H. N., & Eshraghian, K. (2000). “A dataflow-oriented VLSI architecture for a modified SPIHT algorithm using depth-first search bit stream processing,” IEEE International Symposium on Circuits and Systems, pp. I-291-I-294. May 28–31.

  13. Guo, J., Mitra, S., Nutter, B., & Karp, T. (2006). “A Fast and Low Complexity Image Codec Based on Backward Coding of Wavelet Trees,” Data Compression Conference (DCC), pp. 292–301, Snowbird, UT, USA, March.

  14. Guo, J., Mitra, S., Nutter, B., & Karp, T. (2006). Backward Coding of Wavelet Trees with Fine-grained Bitrate Control. Academy Publisher Journal on Computers, 1(4), 1–7.

    Google Scholar 

  15. Chrysafis, C., & Ortega, A. (2000). Line Based, Reduced Memory, Wavelet Image Compression. IEEE Trans. on Image Processing, 9(3), 378–389.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This material is based upon work supported by the National Natural Science Foundation of China under Grant No. 60802076, the Fundamental Research Funds for the Central Universities under Grant No. JY10000903003, the Open Research Funds of State Key Lab. for novel software technology under Grant No.KFKT2010B28.The authors would like to thank the reviewers for their helpful comments and revisions.

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Xidian University, State key lab. for novel software technology, Nanjing University, Xi’an, 710071, China

    Kai Liu, Jie Lei & YunSong Li

Authors
  1. Kai Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jie Lei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. YunSong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kai Liu.

Additional information

This material is based upon work supported by the National Natural Science Foundation of China under Grant No. 60802076, the Fundamental Research Funds for the Central Universities under Grant No. JY10000903003, the Open Research Funds of State Key Lab. for novel software technology under Grant No.KFKT2010B28.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, K., Lei, J. & Li, Y. A Novel VLSI Architecture of SPIHT Using Breadth First Search for Real-Time Applications. J Sign Process Syst 68, 113–125 (2012). https://doi.org/10.1007/s11265-011-0581-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-011-0581-2

Keywords

Search

Navigation