.png){kind=icon}
.png){kind=icon}
Return
An Efficient Adaptive Binary Arithmetic Coder Based on Logarithmic Domain
.png){kind=icon}
PRE
AI
DOI：10.1109/TIP.2015.2462089.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes an efficient adaptive binary arithmetic coder based on a logarithmic domain (LBAC) and a probability estimation based on the LBAC (P-LBAC). Both the LBAC and the P-LBAC achieve a high data-compression ratio with low complexity and a hardware-efficient structure. They introduce a mapping mechanism between the logarithmic domain and the original domain for both the coding process and the probability estimation. The proposed schemes have high accuracy and constitute an efficient BAC. The proposed LBAC and P-LBAC do not use either multiplication and division operations or lookup tables, and only addition and shifting operations are required. The proposed LBAC is designed to favor the coding of multiple symbols and has high throughput. The proposed P-LBAC achieves a good tradeoff between accuracy and speed in probability estimation through a single parameter. When the proposed algorithms are implemented on H.265/HEVC platforms, and they achieve a compression efficiency equivalent to that of CABAC.
Keywords:
Arithmetic coding
AEC
AVS
CABAC
H.265/HEVC
LBAC
M-Coder
logarithmic arithmetic coding
probability estimation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W