Changyue Ma, Dong Liu, Xiulian Peng et al. · 2018
In the state-of-the-art video coding standard-High Efficiency Video Coding (HEVC), context-adaptive binary arithmetic coding (CABAC) is adopted as the entropy coding tool. In CABAC, the binarization processes are manually designed, and the context models are empirically crafted, both of which incur that the probability distribution of the syntax elements may not be estimated accurately, and restrict the coding efficiency. In this paper, we adopt a convolutional neural network-based arithmetic coding (CNNAC) strategy, and conduct studies on the coding of the DC coefficients for HEVC intra coding. Instead of manually designing binarization process and context model, we propose to directly estimate the probability distribution of the value of the DC coefficient using densely connected convolutional networks. The estimated probability together with the real DC coefficient are then input into a multi-level arithmetic codec to fulfill entropy coding. Simulation results show that our proposed CNNAC leads to on average 22.47% bits saving compared with CABAC for the bits of DC coefficients, which corresponds to 1.6% BD-rate reduction than the HEVC anchor.
Cited by 17
M.J.P. Berkhoff · Research Repository (Delft University of Technology) · 2010
In this thesis we present an FPGA software/hardware co-design for the CABAC decoder. CABAC is the Context-based Adaptive Binary Arithmetic Coding used in the H.264/AVC video standard. This standard gives better compression effciency, but with greater complexity and implementation cost. A large part of this cost comes from the CABAC entropy coding. The CABAC coding has a tight feedback loop between the binary arithmetic coding stage and the context modeler stage of the coding process. This means that the video stream has to be coded in a sequential way. We attempt acceleration of the CABAC decoding process in a fashionable way on dedicated programmable hardware. An FPGA implementation of the CABAC entropy decoding process is used in co-operation with the decoding software on a Xilinx Virtex 4 platform. Actual synthesis results show that our approach results in a fast and compact implementation, targeted at the state-of-the-art FPGA devices.
Cited by 2Open access
Jan Hahlbeck, Benno Stabernack · 2014
High Efficiency Video Coding (HEVC) is the newest video coding standard approved by the ISO/IEC and ITU-T in January 2013. By providing a video coding efficiency gain of up to 50% compared to its predecessor H.264/MPEG-4 AVC, the complexity of the used algorithms has raised significantly. Targeting video formats with higher spatial and temporal resolutions - e.g. 4Kp60 in broadcast applications - make implementing encoders and decoders a challenging task. A well known bottleneck in the decoder architecture is the Context-Based Adaptive Binary Arithmetic Coding (CABAC), specified as entropy coding method in the H.265/MPEG-HEVC standard. Reaching high throughput for real time applications is a demanding task in terms of context modeling and serial bin-to-bin dependencies in the binary arithmetic coding engine. Especially the context selection and the update of the context model in binary decision mode requires a complex underlying control flow for the decoding process of each syntax element. This paper presents a pure hardware implementation of a Main Profile H.265/MPEG-HEVC compliant entropy decoder. The design has been optimized to achieve real time performance up to 4k video resolutions. By using state-of-the-art FPGA technology, data rates of up to 104 MBit/s can be achieved.
Cited by 8
2018
A set of tools for efficient video coding, including directional intra prediction, variable block size inter prediction, context adaptive binary arithmetic coding, and the two corresponding decoding procedures, is defined in this standard. The target applications and services include, but are not limited to, UHDTV (ultra high definition TV), IP-based video surveillance, Internet video, IP-based video conference, IPTV, user-generated multimedia content, and other video/audio-enabled services and applications such as digital television broadcasting, digital storage media, and communication.
Cited by 0
P. Zhang · Electronics Letters · 2008
A novel high-performance decoding architecture for H.264 context-based adaptive binary arithmetic coding (CABAC) is presented, where several efficient techniques such as speculative decoding, table-based calculation, logic balancing, mathematic reordering and optimal retiming are adopted to reduce the critical timing path. Simulation and implementation results show that the architecture can achieve a fixed decoding rate of up to 247.5 Mbin/s, which is 67% faster than conventional architectures.
Cited by 13
Weidong Wang, Bin Guo, Shen Zhang et al. · 2009
H.264/AVC is the latest international video coding standard, which provides a superior coding efficiency, compared with MPEG-4 and other previous standards. Context Adaptive Binary Arithmetic Coding (CABAC) was adopted by H.264/AVC and plays a very important role in improving the video coding efficiency. However, the coding speed of CABAC is restricted by high computational complexity, which becomes a major bottleneck in many applications. According to the analysis of the CABAC coding flow and its computational complexity, an effective accelerating CABAC algorithm based on adaptive probability estimation update (APU-CABAC) to improve its coding speed is proposed. Instead of every binary symbol's coding, the probability estimation update part in APU-CABAC is done after every packet. In addition, the packet size is adaptively adjusted according to the comparison of the symbol changing frequency coefficient of the last and current packets. Experimental results show that APU-CABAC provides a substantial improvement in the coding speed of CABAC while coding efficiency declines only a little.
Cited by 1
Victor Sanchez, Student Member, Panos Nasiopoulos et al. · 2011
Abstract—We recently proposed a method for lossless compression of 4-D medical images based on the advanced video coding standard (H.264/AVC). In this paper, we present two major contributions that enhance our previous work for compression of functional MRI (fMRI) data: 1) a new multiframe motion compensation process that employs 4-D search, variable-size block matching, and bidirectional prediction; and 2) a new context-based adaptive binary arithmetic coder designed for lossless compression of the residual and motion vector data. We validate our method on real fMRI sequences of various resolutions and compare the performance to two state-of-the-art methods: 4D-JPEG2000 and H.264/AVC. Quantitative results demonstrate that our proposed technique significantly outperforms current state of the art with an average compression ratio improvement of 13%. Index Terms—Bidirectional prediction, context-adaptive binary arithmetic coder (CABAC), functional MRI (fMRI), lossless compression, multiframe motion compensation (MF-MC). I.
Cited by 0
Gabriel Silva Dias, Jiovana Sousa Gomes, Sérgio Bampi et al. · 2025
The striking video consumption nowadays has never been higher. Thus, this burdensome situation affects the limited bandwidth to transmit this kind of data. With that in mind, video codecs emerge as an effective tool to deal with this scenario, where Versatile Video Coding (VVC/H.266) is the state-of-the-art in terms of coding efficiency. In VVC, the Entropy Coding stage comprises an updated version of the Context-Adaptive Binary Arithmetic Coding (CABAC). Therefore, considering the decoding side of the codec, there is still room for architectural design and analysis focusing on VVC Entropy Decoding. This work offers some guidance on the hardware design landscape of the Binary Arithmetic Decoder (BAD), using different alternatives for processing multiple input data (more specifically the so-called bypass bins) and analyzing the pros and cons of each choice. At the end, insights are discussed based on the trade-off of throughput and area/power of each architecture presented.
Cited by 0
Mei, Liming · RMIT Research Repository (RMIT University Library) · 2010
The work in this thesis explore the DWT based video coding by the introduction of a novel DWT (Discrete Wavelet Transform) / MC (Motion Compensation) / DPCM (Differential Pulse Code Modulation) video coding framework, which adopts the EBCOT as the coding engine for both the intra- and the inter-frame coder. The adaptive switching mechanism between the frame/field coding modes is investigated for this coding framework. The Low-Band-Shift (LBS) is employed for the MC in the DWT domain. The LBS based MC is proven to provide consistent improvement on the Peak Signal-to-Noise Ratio (PSNR) of the coded video over the simple Wavelet Tree (WT) based MC. The Adaptive Arithmetic Coding (AAC) is adopted to code the motion information. The context set of the Adaptive Binary Arithmetic Coding (ABAC) for the inter-frame data is redesigned based on the statistical analysis. To further improve the perceived picture quality, a Perceptual Distortion Measure (PDM) based on human vision model is used for the EBCOT of the intra-frame coder. A visibility assessment of the quantization error of various subbands in the DWT domain is performed through subjective tests. In summary, all these findings have solved the issues originated from the proposed perceptual video coding framework. They include: a working DWT/MC/DPCM video coding framework with superior coding efficiency on sequences with translational or head-shoulder motion; an adaptive switching mechanism between frame and field coding mode; an effective LBS based MC scheme in the DWT domain; a methodology of the context design for entropy coding of the inter-frame data; a PDM which replaces the MSE inside the EBCOT coding engine for the intra-frame coder, which provides improvement on the perceived quality of intra-frames; a visibility assessment to the quantization errors in the DWT domain.
Cited by 0Open access
Thibaut Meyer, Dominik Mehlem, Christian Rohlfing · 2023
A point cloud’s attributes constitutes most of its information content. This is why their efficient compression is of great importance when designing a compression scheme. In this paper, the entropy coding stage of an existing compression method is replaced using Context-based Adaptive Binary Arithmetic Coding (CABAC), which is already largely used for video compression applications. Additionally, the DC transform coefficients are quantized with Differential Pulse Code Modulation (DPCM), yielding better performance at lower bit rates. By using predictive coding and coding techniques adapted to the signal’s characteristics, Bjøntegaard Delta rate savings of up to 31.38% are observable in comparison to previously used entropy coding methods.
Cited by 1
Wei‐Gang Chen, Xun Wang · SpringerPlus · 2016
High efficiency video coding (HEVC) seeks the best code tree configuration, the best prediction unit division and the prediction mode, by evaluating the rate-distortion functional in a recursive way and using a "try all and select the best" strategy. Further, HEVC only supports context adaptive binary arithmetic coding (CABAC), which has the disadvantage of being highly sequential and having strong data dependencies, as the entropy coder. So, the development of a fast rate estimation algorithm for CABAC-based coding has a great practical significance for mode decision in HEVC. There are three elementary steps in CABAC encoding process: binarization, context modeling, and binary arithmetic coding. Typical approaches to fast CABAC rate estimation simplify or eliminate the last two steps, but leave the binarization step unchanged. To maximize the reduction of computational complexity, we propose a fast entropy-based CABAC rate estimator in this paper. It eliminates not only the modeling and the coding steps, but also the binarization step. Experimental results demonstrate that the proposed estimator is able to reduce the computational complexity of the mode decision in HEVC by 9-23 % with negligible PSNR loss and BD-rate increment, and therefore exhibits applicability to practical HEVC encoder implementation.
Cited by 2Open access
Vivienne Sze, Anantha P. Chandrakasan · 2011
To address the increasing demand for higher resolution and frame rates, processing speed (i.e. performance) and area cost need to be considered in the development of next generation video coding. Accordingly, both algorithm and architecture should be taken into account during video codec design. This paper proposes joint optimization of both the algorithm and architecture to ensure that high coding efficiency can be achieved in conjunction with high processing speed and low area cost. Specifically, it presents two optimizations that can be performed on Context-based Adaptive Binary Arithmetic Coding (CABAC), a form of entropy coding in H.264/AVC. First, subinterval reordering is proposed for the arithmetic de coder to increase the processing speed by 14 to 22% with no cost to coding efficiency. Second, modification of the motion vector difference (mvd) context selection is proposed to reduce memory requirements (i.e. area cost) by 50% with negligible coding efficiency impact (≤0.02%). These joint algorithm and architecture optimizations are non-standard com pliant and thus are well suited to be used in High Efficiency Video Coding (HEVC), the successor to H.264/AVC.
Cited by 7
Dajiang Zhou, Jinjia Zhou, Fei Wei et al. · IEEE Transactions on Circuits and Systems for Video Technology · 2014
Ultra high definition television (UHDTV) imposes extremely high throughput requirement on video encoders based on High Efficiency Video Coding (H.265/HEVC) and Advanced Video Coding (H.264/AVC) standards. Context-adaptive binary arithmetic coding (CABAC) is the entropy coding component of these standards. In very-large-scale integration implementation, CABAC has known difficulties in being effectively pipelined and parallelized, due to the critical bin-to-bin data dependencies in its algorithm. This paper addresses the throughput requirement of CABAC encoding for UHDTV applications. The proposed optimizations including prenormalization, hybrid path coverage and lookahead rLPS to reduce the critical path delay of binary arithmetic encoding (BAE) by exploiting the incompleteness of data dependencies in rLPS updating. Meanwhile, the number of bins BAE delivers per clock cycle is increased by the proposed bypass bin splitting technique. The context modeling and binarization components are also optimized. As a result, our CABAC encoder delivers an average of 4.37 bins per clock cycle. Its maximum clock frequency reaches 420 MHz when synthesized in 90 nm. The corresponding overall throughput is 1836 Mbin/s that is 62.5% higher than the state-of-the-art architecture.
Cited by 59
Jin Heo, Yo-Sung Ho · 2011
The depth map represents three-dimensional (3D) data and is used for depth image-based rendering (DIBR) to synthesize virtual views. Since the quality of synthesized virtual views highly depends on the quality of the depth map, we encode the depth map by lossless coding mode. However, context-based adaptive binary arithmetic coding (CABAC) for the H.264/AVC standard does not guarantee the best coding performance for lossless depth map coding because CABAC was originally designed for lossy coding. In this paper, we propose an improved coding method of CABAC for lossless depth map coding considering the statistical properties of residual data from lossless depth map coding. Experimental results show that the proposed CABAC method provides approximately 4.3% bit saving, compared to the original CABAC in H.264/AVC.
Cited by 5
Ka‐Hou Chan, Sio‐Kei Im · ACM Transactions on Multimedia Computing Communications and Applications · 2022
This article introduces the key technologies involved in four hypothetical probability estimators for Context-based Adaptive Binary Arithmetic Coding (CABAC). The focus is on the selected adaptation rate performed in these estimators, which are selected based on coding efficiency and memory considerations, and also the relationship with the current size of the coding block. The proposed scheme can linearly realize the quantitative representation of probabilistic prediction and describes the scalability potential for higher accuracy. Besides a description of the design concept, this work also discusses motivation and implementation aspects, which are based on simple operations such as bitwise operations and single subsampling for subinterval updates. The experimental results verify the effectiveness of the proposed CABAC method specified in Versatile Video Coding (VVC).
Cited by 12
Yang Li, Hongkai Xiong, Li Song et al. · 2006
Various error control schemes have been addressed in wireless video stream transmission. By combining an adaptive binary arithmetic coding technique with context modeling, CABAC as a normative part of H.264/AVC has achieved a high degree of adaptation and redundancy reduction. However, error propagation still remains a problem because of the property of arithmetic coding. The presented scheme compares the various error detection methods, and proposes an efficient error detection technique based on CABAC semantics, which is achieved by inserting detective markers denoting by syntax elements. The misdetection probability versus stream size expansion can be easily handled. In addition, placements of markers can vary with regard to specific video content, thus efficiency within this scheme is enhanced. Comparison with other detection scheme is also presented
Cited by 4
Glen G. Langdon, C. Haidinyak · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1994
An algorithm class called CaTH (centering and tail handling) is described that is based on predictive coding followed by adaptive binary arithmetic coding. CaTH treats the prediction errors close to zero (i.e., near the center of the error distribution) in a more precise manner than the errors of the `tails' (i.e., errors far from zero). The context model uses error buckets (quantized ranges) of prediction errors. The probability model for the prediction errors uses a histogram for the center. A variety of ways to binarize the tails are studied. The results on the suite of JPEG test images are very encouraging.
Cited by 8
Jongmin Hahm, Chong-Min Kyung · IEEE Transactions on Circuits and Systems for Video Technology · 2009
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> In H.264/AVC coders, the optimal mode decision for each coding unit is achieved based on a calculation of the rate-distortion (R-D) cost for each candidate mode. In this letter, we propose a context-adaptive binary arithmetic coding (CABAC)-based rate estimation scheme that reduces the computational complexity of the R-D cost function evaluation. The complex and time-consuming calculation of the arithmetic coding is replaced by a table lookup based on the proposed CABAC rate model for fast rate estimation. The context modeling part of CABAC is also simplified to accelerate the rate estimation process. The experimental results show that the proposed estimator follows the actual rate with the coefficient of determination <formula formulatype="inline"><tex Notation="TeX">$R^2 = 0.9997$</tex></formula>. The proposed estimator yields about a 30% reduction in the computational complexity of the R-D optimized mode decision, thereby accelerating the entire encoder by about 17% to 25% with almost no degradation in the R-D performance. </para>
Cited by 26
Philipp Habermann, Chi Bun Ching, Mauricio Álvarez-Mesa et al. · 2019
Context-based Adaptive Binary Arithmetic Coding (CABAC) is one of the main throughput bottlenecks in video decoding due to its sequential nature and the lack of data-level parallelism. High-level parallelization techniques can be used in most state-of-the-art video codecs, but they usually require a full replication of the decoding hardware and decrease the coding efficiency. We present a Bin-based Bitstream Partitioning (B3P) scheme to enable additional thread-level parallelism in CABAC decoding. Binary symbols are distributed over eight bitstream partitions that can be decoded simultaneously. The implementation and evaluation are based on the High Efficiency Video Coding Standard (HEVC/H.265). Significant speedups up to 8.5× are achieved for CABAC decoding while only 9.2% extra cell area is required and the bitstream overhead remains below 1% for high bitrates. The B3P hardware decoder can process up to 3.94 Gbins/s. Compared to state-of-the-art related work, we achieve higher throughput with slightly lower hardware cost and similar coding efficiency.
Cited by 3
Quang-Linh Nguyen, Dinh-Lam Tran, Duy-Hieu Bui et al. · 2017
The increasing amount of digital video with supreme quality requires more efficient compression. As the complexity of video coding algorithm is rising, there are more demands for hardware accelerators and customized hardware. Context-based Adaptive Binary Arithmetic Coding (CABAC) is the only entropy coding method adopted in the latest video compression standard, High Efficiency Video Coding (HEVC). Binary Arithmetic Encoder (BAE) is an essential component in CABAC, where the compression process happens. Because of the high data dependency and sequential coding characteristic, it is challenging to parallelize BAE. In this work, we proposed a low-cost and high-throughput hardware architecture for one core of BAE in HEVC. Our 4-stage pipelined BAE architecture is capable of processing one regular bin and up to 4 bypass bins per clock cycle with 30% reduction in terms of area when compared with the designs for one-core CABAC architecture. The design can compress an average of 1.4 bins per cycle. It achieves a throughput of 1 Gbin/s at the maximum operating frequency of 810 MHz with the area of 2.2 kGEs and the power consumption of 2.0 mW in Nangate 45nm technology.
Cited by 5