VLSI Architecture of Arithmetic Coder Used in SPIHT

被引:10
作者
Liu, Kai [1 ]
Belyaev, Evgeniy [2 ]
Guo, Jie [3 ]
机构
[1] Xidian Univ, Comp Sch, Xian 710071, Shaanxi, Peoples R China
[2] Russian Acad Sci, St Petersburg Inst Informat & Automat, St Petersburg 199178, Russia
[3] Xidian Univ, Commun Sch, Xian 710071, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Arithmetic coding; common bit detection (CBD) circuit; context model; out-of-order execution; set partitioning in hierarchical trees (SPIHT); VLSI arithmetic coder architecture; IMAGE COMPRESSION; FPGA IMPLEMENTATION; ALGORITHM; MEMORY;
D O I
10.1109/TVLSI.2011.2109068
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A high-throughput memory-efficient arithmetic coder architecture for the set partitioning in hierarchical trees (SPIHT) image compression is proposed based on a simple context model in this paper. The architecture benefits from various optimizations performed at different levels of arithmetic coding from higher algorithm abstraction to lower circuits' implementations. First, the complex context model used by software is mitigated by designing a simple context model, which just uses the brother nodes' states in the coding zerotree of SPIHT to form context symbols for the arithmetic coding. The simple context model results in a regular access pattern during reading the wavelet transform coefficients, which is convenient to the hardware implementation, but at a cost of slight performance loss. Second, in order to avoid rescanning the wavelet transform coefficients, a breadth first search SPIHT without lists algorithm is used instead of SPIHT with lists algorithm. Especially, the coding bit-planes of each zero tree are processed in parallel. Third, an out-of-order execution mechanism for different types of context is proposed that can allocate the context symbol to the idle arithmetic coding core with a different order that of the input. For the balance of the input rate of the wavelet coefficients, eight arithmetic coders are replicated in the compression system. And in one arithmetic coder, there exists four cores to process different contexts. Fourth, several dedicated circuits are designed to further improve the throughput of the architecture. The common bit detection (CBD) circuit is used for unrolling the renormalization stage of the arithmetic coding. The carry look-ahead adder (CLA) and fast multiplier-divider are also employed to shorten the critical path in the architecture. Moreover, an adaptive clock switch mechanism can stop some invalid bit-planes' clock for the power saving purpose according to the input images. Experimental results demonstrate that the proposed architecture attains a throughput of 902.464 Mb/s at its maximum and achieves savings of 20.08% in power consumption over full bit-planes coding scheme based on field-programmable gate arrays (FPGAs).
引用
收藏
页码:697 / 710
页数:14
相关论文
共 34 条
[1]   A modified-set partitioning in hierarchical trees algorithm for real-time image compression [J].
Akter, M. ;
Reaz, M. B. I. ;
Mohd-Yasin, F. ;
Choong, F. .
JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS, 2008, 53 (06) :642-650
[2]  
Andra K, 2000, IEEE IMAGE PROC, P928, DOI 10.1109/ICIP.2000.901112
[3]  
[Anonymous], 2000, N1890 ISOIEC JTC1SC2
[4]  
[Anonymous], 1993, 109181 ISOIEC
[5]   Context based medical image compression for ultrasound images with contextual set partitioning in hierarchical trees algorithm [J].
Ansari, M. A. ;
Anand, R. S. .
ADVANCES IN ENGINEERING SOFTWARE, 2009, 40 (07) :487-496
[6]  
Cao Bin, 2004, Journal of Xidian University, V31, P714
[7]   Very Low-Memory Wavelet Compression Architecture Using Strip-Based Processing for Implementation in Wireless Sensor Networks [J].
Chew, Li Wern ;
Chia, Wai Chong ;
Ang, Li-minn ;
Seng, Kah Phooi .
EURASIP JOURNAL ON EMBEDDED SYSTEMS, 2009, (01)
[8]   Line-based, reduced memory, wavelet image compression [J].
Chrysafis, C ;
Ortega, A .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2000, 9 (03) :378-389
[9]   Microprocessor-based FPGA implementation of SPIHT image compression subsystems [J].
Corsonello, P ;
Perri, S ;
Zicari, P ;
Cocorullo, G .
MICROPROCESSORS AND MICROSYSTEMS, 2005, 29 (06) :299-305
[10]   Concurrency techniques for arithmetic coding in JPEG2000 [J].
Dyer, Michael ;
Taubman, David ;
Nooshabadi, Saeid ;
Gupta, Amit Kumar .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2006, 53 (06) :1203-1213