DocumentCode :
1459162
Title :
VLSI Architecture of Arithmetic Coder Used in SPIHT
Author :
Liu, Kai ; Belyaev, Evgeniy ; Guo, Jie
Author_Institution :
Comput. Sch., Xidian Univ., Xi´´an, China
Volume :
20
Issue :
4
fYear :
2012
fDate :
4/1/2012 12:00:00 AM
Firstpage :
697
Lastpage :
710
Abstract :
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 t- e 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).
Keywords :
VLSI; adders; arithmetic codes; data compression; field programmable gate arrays; image coding; trees (mathematics); wavelet transforms; CBD circuit; CLA; FPGA; SPIHT; VLSI architecture; arithmetic coder; coding zerotree; common bit detection; field-programmable gate arrays; image compression; look-ahead adder; set partitioning in hierarchical trees; wavelet transform; Computer architecture; Context; Context modeling; Encoding; Image coding; Pixel; Wavelet transforms; Arithmetic coding; VLSI arithmetic coder architecture; common bit detection (CBD) circuit; context model; out-of-order execution; set partitioning in hierarchical trees (SPIHT);
fLanguage :
English
Journal_Title :
Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
1063-8210
Type :
jour
DOI :
10.1109/TVLSI.2011.2109068
Filename :
5720281
Link To Document :
بازگشت