Zhenyu Liu, Dongsheng Wang · 2011
Context-based Adaptive Binary Arithmetic Coder (CABAC) is the advanced entropy coding tool employed by main and higher profiles of H.264/AVC. As compared with Context-based Adaptive Variable Length Coding (CAVLC), under the same bit rate, CABAC achieves up to 0.5dB PSNR gain. On the other hand, the high complexity of CABAC severely hinders the whole encoder throughput. To over- come the throughput bottleneck of CABAC, the authors devise the one-round renormalization and the associated VLSI architecture to omit the multiple-iteration operation of one bin's encoding. The pro- posed full-context CABAC hardwired encoder garners the constant 2-bin/cycle throughput. Using TSMC one-poly nine-metal 90 nm CMOS technology, the prototyping is implemented with 33.9k logic gates and 1562-bit on-chip SRAM. In the worst operating conditions (0.9V, 125°C), the operating frequency is 238.1MHz, which can support HDTV720p real-time encoding at 329 fps frame rate with the quantization parameter (QP) not less than 18.
Cited by 15
張哲銘 · 2007
H.264/AVC is the latest video compression standard. It concentrates on video compression and robust transmission support over networks. H.264/AVC could achieve about 60% bit-rate saving over MPEG-2, and about 40% bit-rate saving over MPEG-4 at the same video quality. Because of its high compression efficiency, H.264 attracts high interest for many applications such as High Definition DVD, Digital TV, Digital Camcorders, Internet video streaming, and others. Context-based Adaptive Binary Arithmetic Coding (CABAC) is the entropy coding method used in H.264 main profile. Compare to the Context-based Adaptive Variable Length Coding (CAVLC), CABAC provides a reduction in bit rate about 30%.
In this thesis, we propose a fast architecture of the CABAC decoder for residual data. Because the binary arithmetic decoder is the critical part of the CABAC decoder. We perform twice reordering technique to reduce the critical path of the decoding process. The critical path has been successfully shorten from to . In the context modeling stage we propose the caching and pre-fetch methods so that the update and load of the context models can be performed at the same time. Furthermore, we propose an algorithm that makes sure the update of the context models in the pipelining at the correct time and decrease the accessing times. As a result, a fast and simple architecture of the CABAC decoder is proposed. Our design is implemented on Xilinx multimedia board that uses less logic elements and the maximum working frequency is 135 MHz. Because of the less device usage and higher working frequency, it is suitable to be an IP core.
Cited by 0
Max Bläser, Christian Rohlfing, Yingbo Gao et al. · 2018
Informed source separation (ISS) uses source separation for extracting audio objects out of their downmix given some pre-computed parameters. In recent years, non-negative tensor factorization (NTF) has proven to be a good choice for compressing audio objects at an encoding stage. At the decoding stage, these parameters are used to separate the downmix with Wiener-filtering. The quantized NTF parameters have to be encoded to a bit stream prior to transmission. In this paper, we propose to use context-based adaptive binary arithmetic coding (CABAC) for this task. CABAC is widely used in the video coding community and exploits local signal statistics. We adapt CABAC to the task of NTF-based ISS and show that our contribution outperforms reference coding methods.
Cited by 3
A. Tamhankar, K. R. Rao · 2015
Abstract: The video coding standards to date have not been able to address all the needs required by varying bit rates of dflerent applications and the at the same time meeting the quality requirements. An emerging video coding standard named H.264 or UPEG-4 part 10 aims at coding video sequences at approximately half the bit rate compared to UPEG-2 at the same quality. It also aims at having significant improvements in coding eficiency, error robustness and network@iendliness. It makes use of better prediction methods for Intra (I), Predictive (P) and Bi-predictive (B) frames. All these features along with others such as CABAC (Context Based Adaptive Binary Arithmetic Coding) have resulted in having a 2.1 coding gain over UPEG-2 at the cost of increased complexity. 1.
Cited by 0
Lingfeng Li, Yang Song, Takeshi Ikenaga et al. · 2007
This paper presents a hardware architecture for Context-Based Adaptive Binary Arithmetic Coding (CABAC) codec in H.264/AVC main profile. The similarities between encoding algorithm and decoding algorithm are explored to fulfill hardware reuse. Meanwhile, dynamic pipeline scheme is adopted to speedup the throughput. The characteristics of CABAC algorithm are utilized to reduce pipeline latency. Proposed codec design is implemented under TSMC 0.18 mum technology. Results show that the equivalent gate counts is 33.2 k when the maximum frequency is 230 MHz. It is estimated that the proposed CABAC codec can process the input binary symbol at 135 Mb/s for encoding and 90 Mb/s for decoding.
Cited by 8
Jianhua Chen, Wang Fu-yan, Yufeng Zhang et al. · Medical Engineering & Physics · 2007
A new wavelet-based method for the compression of electrocardiogram (ECG) data is presented. A discrete wavelet transform (DWT) is applied to the digitized ECG signal. The DWT coefficients are first quantized with a uniform scalar dead-zone quantizer, and then the quantized coefficients are decomposed into four symbol streams, representing a binary significance stream, the signs, the positions of the most significant bits, and the residual bits. An adaptive arithmetic coder with several different context models is employed for the entropy coding of these symbol streams. Simulation results on several records from the MIT-BIH arrhythmia database show that the proposed coding algorithm outperforms some recently developed ECG compression algorithms.
Cited by 51
Jianhua Chen, Yu‐Ying Lu, Yufeng Zhang et al. · 2006
A new wavelet-based method for the compression of electrocardiogram (ECG) data is presented. The discrete wavelet transform (DWT) is applied to the digitized ECG signal. The DWT coefficients are firstly quantized with a uniform scalar dead zone quantizer. Then the quantized coefficients are decomposed into four symbol streams: a binary significance symbol stream, a sign stream, a position of the most significant bit (PMSB) symbol stream and a residual bits stream. An adaptive arithmetic coder with different context models is employed for the entropy coding of these symbol streams. Experiments on several records from the MIT-BIH arrhythmia database showed that the proposed coding algorithm outperforms other well-known wavelet-based ECG compression algorithms.
Cited by 1
Chung-hyo Kim A, Tae-sik Kong B, Young-jun Lee C et al. · 2008
Abstract. H.264/AVC is adopted as a next generation moving picture compression standard. Context-based Adaptive Binary Arithmetic Coding (CABAC) is the major entropy coding algorithm employed in H.264/AVC. Although the performance gain of H.264/AVC is mostly resulted from CABAC, it is difficult to implement a high-throughput decoder due to its decoding complexity. Although CABAC excludes a multiplication, the algorithm is basically sequential and needs large computations to compute some important variables, which are range, offset and context variables. Therefore, it is difficult to achieve fast decoding performance. In this paper, a prediction scheme is proposed to decode maximally two bits at a time and thus to reduce overall decoding time. A CABAC decoder based on the proposed prediction scheme reduces total cycles by 24 % compared to conventional decoders.
Cited by 0
Min Zhu, Leibo Liu, Shouyi Yin et al. · International Journal of Electronics · 2013
CABAC (Context-based Adaptive Binary Arithmetic Coding) is an efficient entropy codec which adopt by H.264. It has a better compression rate than others, such like CAVLC, but harder to implement. This article gives out an implementation of high throughput one-cycle CABAC decoder. The critical paths are improved by table replacing, branch prediction, logic moving and inverter optimisation; the area is also reduced by registers redesigning. The decoder is typed out and test chip achieves a high decoding rate of 250 Mbin/s @1.03 mW, reducing 46% area consuming comparing with Zhang's implementation.
Cited by 0
R. D. Anitha Kumari, A. Narendranath Udupa · International Journal of Computational Vision and Robotics · 2020
The advancement in high-efficiency video coding (HEVC) is adapted for defining the subsequent generation compression model to offer efficient compression without affecting the image quality. The HEVC offers improved performance than the existing compression models. Accordingly, this work develops an approach for video compression by proposing weighted entropy coding and adaptive block search-based rate-distortion (R-D) trade-off, named Taylor R-D trade-off. The adaptive block search R-D trade-off, by integrating the hexagon-based tree search algorithm (HBTSA), along with the Taylor R-D trade-off for initiating the block search process of motion estimation in video coding, which selects the optimal block. Initially, the frames are extorted from the input video. Then, the video frames are divided into macroblocks to perform the adaptive block search. Further, the suitable blocks are selected and given to the encoding process by weighted context-adaptive binary arithmetic coding (CABAC) that employs a weighted entropy function to persist the video quality after the compression. The results analysis shows that the proposed HBTSA method has improved PSNR and SSIM values of 42.717dB, and 0.991, respectively, using football, coast guard, garden, and tennis videos.
Cited by 0Open access
Zhenghua-Shu, Guodong-Liu, Lixin-Gan et al. · 2010
In this paper, we proposes A type Image Coding which is an experimental still image compression system that combines intra frame block prediction algorithms from the H.264 standard and Wavelet-Based Contourlet Transform(WBCT) with SPIHT image compression technology, followed by context adaptive binary arithmetic coding (CABAC) as used in H.264. The image compression algorithm using Wavelet-Based Contourlet Transform(WBCT) with modified SPIHT can effectively code image with more discontinuities along curve lines. Predicted image is subtracted from original image to give residual image, residual image has lots of discontinuous curve lines, it is typically 2-dimensional and curve singularities image. The result of the image coding compression scheme perform is much better than JPEG and AIC and almost is the same with JPEG-2000.
Cited by 1
Marwa Tarchouli, Thomas Guionnet, Marc Rivière et al. · 2024
This paper proposes the integration of residual blocks into neural representation for videos (NeRV)-based architectures with the aim of enhancing the reconstruction of detailed patterns and high-level features. Additionally, a coding pipeline is introduced, placing the implicit neural decoder in a real-life video streaming framework. Indeed, DeepCABAC is employed for model compression, applying a quantization scheme followed by the context-adaptive binary arithmetic coding (CABAC) entropy coding algorithm, ultimately leading to bitstream generation. Our method outperforms NeRV, as well as x264 and x265, achieving BD-rate gains against NeRV: $-12.06 \%$ using PSNR and $-14.25 \%$ using MS-SSIM. Furthermore, it exhibits superior subjective quality compared to NeRV, attributed to enhanced high-level feature reconstruction. This observed behavior encourages the application of our method to other NeRV-based models, such as E-NeRV.
Cited by 6
Yuan-Teng Chang, Wen-Hao Chung · 2009
We present a high-performance entropy decoding system for H.264/AVC. This system includes a variable length coding (VLC) decoder, a context-based adaptive binary arithmetic coding (CABAC) decoder, and a run-level converter. Each syntax element above slice data is decoded by VLC decoder within a clock cycle. The CABAC decoder decodes the syntax elements at slice data and below through pipeline mechanism. A run-level converting method is designed and integrated into the system to improve the output efficiency of decoded quantized coefficients. This system can process 574,712 macroblock/s operating at 300 MHz, quite enough for real-time decoding for H.264/AVC HD level 4.1 video sequences.
Cited by 1
WonHee Son, In‐Cheol Park · 2008
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 predicts the subsequent syntax element type, leading to a significant reduction in cycles invoked by the syntax element switching overhead that degrades the decoding performance significantly. In addition, a new pipelined architecture combined with the proposed scheme is presented for hardware implementation. The simulation results show that the proposed scheme achieves a decoding performance of 1.2 cycles/bin, which releases the CABAC parsing from a bottleneck in decoding H.264 bitstream.
Cited by 12
Yongqiang Cheng, Min Hu, Keming Xie · 2008
In this paper, we propose an effective sequential lossless compression scheme which performs sequentially pixel by pixel in raster-scan order, also so called one-pass scheme as opposed to multiple-pass scheme. The proposed method has two major components: fuzzy neural network predictor and context based adaptive arithmetic coder. The proposed predictor which is based on T-S fuzzy neural network system effectively exploits structural redundancies between mosaic-like color components, and its residuals are well-modeled by a two-side geometry distribution centered at zero. An advantage of the proposed compression method is the clean separation between prediction and entropy coding of prediction errors. Any entropy coder, be it Huffman or arithmetic, static or adaptive, binary or m-ary, can be easily interfaced with our predictor. Consequently, we can encode mosaic images at low complexity level. Compared with existing methods of lossless compression for Bayer raw data, the performance of proposed method is apparently the best.
Cited by 0
Prajacta Naik, H. G. Virani, Nitesh Guinde · 2023
In real-time Ultra High Definition (UHD) applications, video compression (VC) is essential. The H.265/HEVC standard is the newest of various VC algorithms available. In contrast to the predecessor AVC (Advanced Video Codec) standard, it can handle the UHD image at 120 frames per second. H.265/HEVC employs modern approaches like the sample adaptive offset (SAO) filter, inter- and intra-prediction, and CABAC entropy coding (Context-based Adaptive Binary Arithmetic Coding). In H.265/HEVC, CABAC is the sole entropy code that is employed. The computational complexity of CABAC decoding poses a significant challenge to achieving fast and efficient video decoding. This paper addresses this challenge by developing a hardware IP core for the HEVC video-coding standard that accelerates the CABAC decoding process, allowing real-time decoding of higher-resolution video streams. The proposed method uses the Xilinx Vitis HLS tool to generate RTL code for the CABAC decoder from a C++ implementation.
Cited by 0
Nihel Neji, Maher Jridi, Ayman Alfalou et al. · 2016
New and modern video encoders employ the CABAC (Context-Based Adaptive Binary Arithmetic Coding) to allow a high compression and/or improved video quality. CABAC is composed of three main blocks which are binarizer, context modeler and binary arithmetic coder block. Since the binarizer block is used in the beginning of the encoder process, the whole performance of CABAC depends a lot on the design of the binarizer. In this paper, we propose an efficient implementation of this block. The novelty of the proposed design with respect to existing ones is that it takes advantages of new entropy coding's characteristics. The strength of the propose binarizer is that it allows the binarization with the seven methods indicated in the coding standard. Moreover, the proposed design can be integrated into CABAC module of the encoder to generate the bins of the Syntax Elements (SE). One uniquely interesting feature of the proposed design is that it could be configured for multi-standard (HEVC/H264) scenario. The proposed architecture is found to offer many advantages in terms of hardware complexity, regularity and modularity. Experimental results obtained from Xilinx Spartan 6 FPGA implementation show the advantage of the proposed method. More particularly, the proposed architecture consumes about 376 slices and able to process at 287 MHz.
Cited by 3
Zafar Shahid, Marc Chaumont, William Puech · HAL (Le Centre pour la Communication Scientifique Directe) · 2009
This paper presents a novel method for the protection of copyrighted multimedia content. The problem of selective encryption (SE) has been addressed along with compression for the state of the art video codec H.264/AVC. SE is performed in the context-based adaptive binary arithmetic coding (CABAC) module of video codec. For this purpose, CABAC is converted to an encryption cipher by scrambling of equal length binarized code words. In our scheme, CABAC engine serves the purpose of encryption cipher without affecting the coding efficiency of H.264/AVC by keeping the original bitrate, generating completely compliant bitstream and utilizing negligible computational cost. Nine different benchmark video sequences containing different combinations of motion, texture and objects have been subjected to experimental evaluation of the proposed algorithm.
Cited by 20Open access
Habermann, Philipp, Chi, Chi Ching, Álvarez-Mesa, Mauricio et al. · DepositOnce · 2015
Context-based Adaptive Binary Arithmetic Coding is the entropy coding module in the most recent JCT-VC video coding standard HEVC/H.265. As in the predecessor H.264/AVC, CABAC is a well-known throughput bottleneck due to its strong data dependencies. Beside other optimizations, the replacement of the context model memory by a smaller cache has been proposed, resulting in an improved clock frequency. However, the effect of potential cache misses has not been properly evaluated. Our work fills this gap and performs an extensive evaluation of different cache configurations. Furthermore, it is demonstrated that application-specific context model prefetching can effectively reduce the miss rate and make it negligible. Best overall performance results were achieved with caches of two and four lines, where each cache line consists of four context models. Four cache lines allow a speed-up of 10% to 12% for all video configurations while two cache lines improve the throughput by 9% to 15% for high bitrate videos and by 1% to 4% for low bitrate videos.
Cited by 0Open access
Menarsri Wahiba, Skoudarli Abdellah, Belhadj Aichouche · 2017
Ultra High Definition Television (UHDTV) imposes extremely high throughput requirement on video codec's based on High Efficiency Video Coding (H.265/HEVC). Context-based adaptive binary arithmetic coding (CABAC) is specified as the single operation mode for entropy coding in HEVC. Parallel and pipeline processing can be used to increase the throughput for higher performance and decrease the path delay. This paper proposes a pipeline and parallel CABAC decoder architecture adaptive to HEVC syntax elements, In order to reduce the critical path delay, we stored the RangeLps LUT and LZ LUT in the same memory and we exploit different techniques of optimization. The implementation can process 1,5 bins/cycle when operate at 133,31 MHz and improved high throughput of 200Mbin/s for parallel decoder and process 1.49 bins/cycle when operate at 134.2 MHz with throughput of 200Mbin/s for pipeline decoder. The critical path delay is optimized compared to the serial process and the architecture is coded using VHDL language, simulated and synthesized using Xilinx tools with virtex4 xc4vsx25-12ff668 card.
Cited by 2