Sciweavers

314 search results - page 15 / 63
» Arithmetic Coding Revisited
Sort
View
LCPC
2005
Springer
15 years 3 months ago
Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
Keith D. Cooper, Anshuman Dasgupta, Jason Eckhardt
ICIP
2008
IEEE
15 years 11 months ago
Complexity modeling of H.264 entropy decoding
This paper models the complexity consumption of entropy decoding in a H.264 decoder, which includes many modes such as fix-length code (FLC), variable-length code (ExpGolomb code ...
Zhan Ma, Zhongbo Zhang, Yao Wang
ICIP
2006
IEEE
15 years 11 months ago
Lossy-to-Lossless Compression of Images Based on Binary Tree Decomposition
A new lossy-to-lossless quality-progressive method for image coding is presented. This method is based on binary tree decomposition and context-based arithmetic coding. Experiment...
António J. R. Neves, Armando J. Pinho
ISCAS
2008
IEEE
103views Hardware» more  ISCAS 2008»
15 years 4 months ago
Prediction-based real-time CABAC decoder for high definition H.264/AVC
— This paper proposes a prediction scheme to decode in real-time H.264/AVC bitstream coded in Context-based Adaptive Binary Arithmetic Coding (CABAC). The proposed scheme predict...
WonHee Son, In-Cheol Park
ICMCS
2006
IEEE
148views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Controlled Complexity Map Decoding of CABAC Encoded Data
In this paper, we present a joint source-channel decoding technique based on exact MAP estimation for data encoded by CABAC (Context-based Adaptive Binary Arithmetic Coding) in st...
Salma Ben Jamaa, Michel Kieffer, Pierre Duhamel