In this paper, we propose a high speed CAVLC (Context-based Adaptive Variable Length coding) decoder for H.264/AVC. The previous hardware architectures perform five steps in series to obtain the syntax elements to res...
详细信息
In this paper, we propose a high speed CAVLC (Context-based Adaptive Variable Length coding) decoder for H.264/AVC. The previous hardware architectures perform five steps in series to obtain the syntax elements to restore the residual and the codeword length to get next input bitstream (we call it 'valid bits'). Since several cycles are required for the process of getting the valid bits and it has to be iterated several times during CAVLC process, the decoding time is increased. This paper proposes two techniques to reduce the computational cycles for valid bits. One is an improved reduced decoding step from five to four by combining total_coeff step and trailing_ones step into one step. The other is to get the valid bits directly by shifting additional shifter register instead of using controller and accumulator. By adopting these two techniques, the required processing time was reduced by 26% compared with previous architectures. It was designed in a hardware description language and total logic gate count was 14.2k using 0.18um standard cell library.
Arithmetic coding is usually implemented in fixed precision. Such an implementation cannot efficiently code sources, such as image coding algorithms, that locally produce a small fraction of a large alphabet of symbol...
详细信息
Arithmetic coding is usually implemented in fixed precision. Such an implementation cannot efficiently code sources, such as image coding algorithms, that locally produce a small fraction of a large alphabet of symbols. In this paper, we propose a novel approach to overcome this inefficiency. The proposed algorithm uses dual symbol sets: a primary symbol set that contains the symbols that have occurred in the recent past and a secondary symbol set that contains all other symbols. Both sets are dynamically adapted to the local statistics. We summarize an analysis of the proposed approach and describe the results that we have obtained by applying it to images.
Classical matching criteria for motion estimation determine the match quality by operating in the spatial domain. The resulting displaced frame difference signal is, however, compressed by means of frequency transform...
详细信息
Classical matching criteria for motion estimation determine the match quality by operating in the spatial domain. The resulting displaced frame difference signal is, however, compressed by means of frequency transformations, and any optimal matching criteria should estimate the cost of coding the composite bit stream. Such criteria are presented in this paper and shown to offer some improvement in the PSNR of the reconstructed sequence.
In this paper, a reordering vector quantization algorithm based on conditional probabilities of a codebook transition matrix is implemented. The dynamic reordering of the codebook dramatically decreases the entropy fo...
详细信息
ISBN:
(纸本)9781479903573
In this paper, a reordering vector quantization algorithm based on conditional probabilities of a codebook transition matrix is implemented. The dynamic reordering of the codebook dramatically decreases the entropy for temporally structured sources, enabling a second stage of entropy coding to further improve the efficiency of VQ. Results from synthetic, Markov sources and speech sources are shown to outperform other baseline vector quantization algorithms.
In this paper an algorithm is proposed which performs near-lossless image compression. For each pixel in a row of the image a group of value-states are considered, which have values close to that of the pixel. A trell...
详细信息
In this paper an algorithm is proposed which performs near-lossless image compression. For each pixel in a row of the image a group of value-states are considered, which have values close to that of the pixel. A trellis is constructed for every row of the image where the nodes of the trellis are the states of the pixels of that row. The goal of the algorithm is to find a path on this trellis that creates a sequence which can be efficiently coded using run length encoding (RLE). For sections of the pixels of the row that suitable RLE cannot be achieved then minimization of the entropy is employed to complete a path on the trellis. The application of the algorithm to a wide range of standard images shows that the scheme, while having low computational complexity, is competitive with other near-lossless image compression methods.
Two methods to overcome the problems with large vector quantization (VQ) codebooks are lattice VQ (LVQ) and product codes. The approach described in this paper takes advantage of both methods by applying residual VQ w...
详细信息
Two methods to overcome the problems with large vector quantization (VQ) codebooks are lattice VQ (LVQ) and product codes. The approach described in this paper takes advantage of both methods by applying residual VQ with LVQ at all stages. Using LVQ in conjunction with entropy coding is strongly motivated by the fact that entropy constrained but structurally unconstrained VQ design leads to more equally sized VQ cells. The entropy code of the first LVQ stage should aim at exploiting the statistical properties of the source. The refinement LVQ stages quantize the residuals. Simulations show that there exist certain scales of the refinement lattices yielding extraordinary performance. We focus on the search of these scales.
Context-based adaptive variable length coding (CAVLC) of H.264/AVC was originally designed for quantized transform coefficients in lossy video coding, and as such does not yield adequate performance in lossless video ...
详细信息
Context-based adaptive variable length coding (CAVLC) of H.264/AVC was originally designed for quantized transform coefficients in lossy video coding, and as such does not yield adequate performance in lossless video coding. In this paper, we propose an improved CAVLC for lossless intra coding. Considering statistical differences of residual data in lossy and lossless coding, we design a new CAVLC encoding algorithm. Experimental results show that the proposed method provides approximately 7.6% bit savings, compared to the current H.264/AVC FRExt high profile.
Almost all triangle mesh compression algorithms to date are driven by the mesh connectivity code. The geometry code usually employs a straightforward prediction method applied to the vertex sequence as dictated by the...
详细信息
Almost all triangle mesh compression algorithms to date are driven by the mesh connectivity code. The geometry code usually employs a straightforward prediction method applied to the vertex sequence as dictated by the connectivity code. This generates a suboptimal geometry code, which results in significant loss in code efficiency, since the geometry dominates the mesh information content. The paper proposes a manifold mesh code which optimizes the geometric component, at the slight expense of the connectivity code. This mesh geometry code is shown to be up to 50% more compact than the state-of-the-art geometry code of Touma and Gotsman (1998), especially for models with non-smooth geometry, such as CAD models.
Channel-optimized quantizer index assignment and maximum a posteriori (MAP) decoding have been extensively studied for error-resilient communications. An interesting and largely untreated problem is how to optimize th...
详细信息
Channel-optimized quantizer index assignment and maximum a posteriori (MAP) decoding have been extensively studied for error-resilient communications. An interesting and largely untreated problem is how to optimize the index assignment with respect to joint source-channel MAP decoding. In this paper we formulate the above problem as one of quadratic programming, and discuss its solutions from very general to some special cases. Experimental results are presented to demonstrate the performance improvement of the index assignments optimized for MAP decoding over those designed for hard-decision decoding.
Variable length code (VLC) is widely used in various compression applications. The latest under development video coding standard, H.26L, uses a unique pattern VLC code called UVLC in the test model document. In this ...
详细信息
ISBN:
(纸本)0780374487
Variable length code (VLC) is widely used in various compression applications. The latest under development video coding standard, H.26L, uses a unique pattern VLC code called UVLC in the test model document. In this paper, an UVLC encoder architecture is proposed to meet the requirements of TML8. This architecture is composed of a code splitter, a first 1 detector, a shifter, a length accumulator, and a code mux/output. A modified code number technique and auto self alignment technique are used to simplify the architecture. By using these techniques, the size of this architecture is much smaller when compared to traditional VLC encoders. It has been synthesized in a 0.35 /spl mu/m cell library. The size of this architecture is 980 gates while critical path is less than 6 ns.
暂无评论