检索结果-内蒙古大学图书馆

arithmetic coding INTO FIXED-LENGTH CODEWORDS

IEEE TRANSACTIONS ON INFORMATION THEORY 1994年第1期40卷 219-223页

作者： TEUHOLA, J RAITA, T Department of Computer Science University of Turku Finland

arithmetic coding is known to be optimal in compressing strings of independent symbols, the probabilities of which are given. However the method has some disadvantages that the present variant tries to overcome. The idea here is to apply arithmetic coding piecewise, by cutting the process regularly. The result consists of fixed-length sequences of bits, representing variable-length substrings of the source. For implementation reasons, the bit sequences are composed of machine words, allowing us to use basic arithmetic efficiently. The compression gain approaches the optimum when the sequence size is increased.

关键词： arithmetic coding DATA COMPRESSION VARIABLE TO FIXED-LENGTH ENcoding

来源：评论

学校读者我要写书评

暂无评论

arithmetic coding in parallel

引用

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2005年第6期16卷 1207-1217页

作者： Supol, J Melichar, B Czech Tech Univ Fac Elect Engn Dept Comp Sci & Engn Prague 12135 2 Czech Republic

We present an EREW PRAM cost optimal parallel algorithm for arithmetic coding computation. We solve the problem in 0(log n) time using n/log n processors. Each part of the algorithm as well as a well-known parallel pr... 详细信息

关键词： arithmetic coding NC algorithm EREW PRAM parallel prefix computation parallel text compression

来源：评论

学校读者我要写书评

暂无评论

arithmetic coding with forbidden symbol and optimized adaptive context tree modeling (GRASP algorithm) for H.264 video coders

Arithmetic coding with forbidden symbol and optimized adapti...

引用

International Conference on Signal Processing, Communications and Networks

作者： Logashanmugam, E. Sreejaa, B. S. Ramachandran, R. Sathyabama University Sri Venkateswara College of Engineering Chennai

ISBN: (纸本)9781424409969

In this paper we propose applying an adaptive context tree weighting method with a forbidden symbol in the H.264 coder. arithmetic codes with a forbidden symbol and a trellis search techniques are employed on an order to estimate the best transmitted codeword. Instead of using the context modeling defined in the H.264 standard, the arithmetic code with a forbidden symbol uses a CTW method. The CABAC algorithm is replaced by GRASP algorithm and the experimental results show that coding gains similar or superior to those obtained with the H.264/AVC CABAC algorithm and arithmetic coding.

关键词： advanced video coding arithmetic coding forbidden symbol GRASP algorithm CTW method and compression

来源：评论

学校读者我要写书评

暂无评论

arithmetic coding with Constrained Carry Operations 6

Arithmetic Coding with Constrained Carry Operations

引用

Conference on Visual Information Processing and Communication VI

作者： Malifoodh, Abo-Talib Said, Amir Yea, Sehoon Michigan State Univ E Lansing MI 48824 USA LG Elect Mobile Res San Jose CA 95112 USA

ISBN: (纸本)9781628415001

Buffer or counter-based techniques are adequate for dealing with carry propagation in software implementations of arithmetic coding, but create problems in hardware implementations due to the difficulty of handling worst-case scenarios, defined by very long propagations. We propose a new technique for constraining the carry propagation, similar to "bit-stuffing," but designed for encoders that generate data as bytes instead of individual bits, and is based on the fact that the encoder and decoder can maintain the same state, and both can identify the situations When it desired to limit carry propagation. The new technique adjusts the coding interval in a way that corresponds to coding an unused data symbol, but selected to minimize overhead. Our experimental results demonstrate that the loss in compression can be made very small using regular precision for arithmetic operations.

关键词： arithmetic coding carry propagation signal compression

来源：评论

学校读者我要写书评

暂无评论

arithmetic coding for Floating-Point Numbers

Arithmetic Coding for Floating-Point Numbers

引用

IEEE Conference on Dependable and Secure Computing (DSC)

作者： Fischer, Marc Riedel, Oliver Lechler, Armin Verl, Alexander Univ Stuttgart Inst Control Engn D-70174 Stuttgart Germany

ISBN: (纸本)9781728175348

To enable the usage of standard hardware in safety-critical applications for production systems, new approaches for hardware fault tolerance are required. These approaches must be implemented on software level. As shown in the literature, arithmetic coding is a promising approach, but only supports integer calculations. For complex safety functions, e.g. in robotics, fast floating-point calculations are needed. Therefore, this paper presents a method for direct arithmetic encoding of floating-point calculations with low-performance impact. Moreover, a detailed residual error estimation is given.

关键词： arithmetic coding floating-point safety fault tolerance information redundancy

来源：评论

学校读者我要写书评

暂无评论

arithmetic coding Based String Approximation 6

Arithmetic Coding Based String Approximation

引用

6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)

作者： Sharma, Mayank Amity Univ Amity Inst Informat Technol Noida Uttar Pradesh India

ISBN: (纸本)9781509030125

arithmetic coding gives lowest range of entropy for any string computed form joint probability value of sub-strings of keyword. It is very much permissible to use this technique for mapping a large set of keywords to real values with in the range of [0;1]. This will create a space of search containing tag value range for keywords and mapped all the keywords to this space. In this paper a new string approximation technique is proposed, which is based on the arithmetic coding used for mapping the misspelled keyword to the tag value interval in a limited search space containing the nearest possible keywords against the misspelled keyword. Using such technique time for searching all the nearest keywords is dramatically reduced due to reduction of search space.

关键词： arithmetic coding String Approximation Probability Lowest Entropy

来源：评论

学校读者我要写书评

暂无评论

arithmetic coding with adaptive context-tree weighting for the H.264 video coders

Arithmetic coding with adaptive context-tree weighting for t...

引用

Conference on Visual Communications and Image Processing 2004

作者： Hong, D van der Schaar, M Pesquet-Popescu, B Columbia Univ Dept Elect Engn New York NY 10027 USA

ISBN: (纸本)0819452114

We propose applying an adaptive context-tree weighting (CTW) method in the H.264 video coders. We first investigate two different ways to incorporating the CTW method into an H.264 coder and compare the coding effectiveness of using the method with that of using the context models specified in the H.264 standard. We then describe a novel approach for automatically adapting the CTW method based on the syntactic element to be coded and the encoding parameters. We show that our CTW-based arithmetic coding method yields similar or better compression results compared with the context-based adaptive arithmetic coding method used in H.264, without having to specify so many context models.

关键词： context-tree weighting H.264 arithmetic coding context modeling universal coding

来源：评论

学校读者我要写书评

暂无评论

arithmetic coding Based Multi-Composition Codes for Bit-Level Distribution Matching

Arithmetic Coding Based Multi-Composition Codes for Bit-Leve...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Pikus, Marcin Xu, Wen Huawei Technol European Res Ctr Riesstr 25 D-80992 Munich Germany Tech Univ Munich Inst Commun Engn Arcisstr 21 D-80290 Munich Germany

ISBN: (纸本)9781538676462

A distribution matcher (DM) encodes a binary input data sequence into a sequence of symbols (codeword) with desired target probability distribution. The set of the output codewords constitutes a codebook (or code) of a DM. Constant-composition DM (CCDM) uses arithmetic coding to efficiently encode data into codewords from a constant-composition (CC) codebook. The CC constraint limits the size of the codebook, and hence the coding rate of the CCDM. The performance of CCDM degrades with decreasing output length. To improve the performance for short transmission blocks we present a class of multi-composition (MC) codes and an efficient arithmetic coding scheme for encoding and decoding. The resulting multi-composition DM (MCDM) is able to encode more data into distribution matched codewords than the CCDM and achieves lower KL divergence, especially for short block messages.

关键词： distribution matching arithmetic coding multi-composition probabilistic shaping

来源：评论

学校读者我要写书评

暂无评论

Protecting data compression: arithmetic coding

引用

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES 2000年第4期147卷 221-228页

作者： Redinbo, GR Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA

Data-compression implementations are particularly sensitive to internal faults because most inherent redundancy in the input data is minimised by the source-coding process. Fault-tolerance techniques are presented for protecting a lossless compression algorithm, arithmetic coding, that is vulnerable to temporary hardware failures. The fundamental arithmetic operations are protected by low-cost residue codes, employing new fault-tolerance methods for multiplications and additions, as recently reported. However, additional fault-tolerant design techniques are developed to protect critical steps such as normalisation and rounding, bit stuffing and index selection. These approaches integrate well with residue codes. Normalisation and rounding after multiplication are protected by efficiently modifying the multiplier to produce residue segments. The decoding step that selects the next symbol is checked by comparing local values with estimates already calculated in other parts of the decoding structure, whereas bit stuffing, a procedure for limiting very long carry propagations, is checked by modified residue values. Overhead complexity issues are discussed as rough estimates.

关键词： index selection fault tolerance techniques lossless compression algorithm residue codes source-coding process Computational complexity computational complexity normalisation data compression encoding bit stuffing Codes Cryptography theory Data handling techniques rounding arithmetic coding decoding

来源：评论

学校读者我要写书评

暂无评论

Convolutional Neural Network-Based arithmetic coding for HEVC Intra-Predicted Residues

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2020年第7期30卷 1901-1916页

作者： Ma, Changyue Liu, Dong Peng, Xiulian Li, Li Wu, Feng Univ Sci & Technol China CAS Key Lab Technol Geospatial Informat Proc & Ap Hefei 230027 Peoples R China Microsoft Res Asia Beijing 100080 Peoples R China Univ Missouri Kansas City MO 64111 USA

Entropy coding is a fundamental technology in video coding that removes statistical redundancy among syntax elements. In high efficiency video coding (HEVC), context-adaptive binary arithmetic coding (CABAC) is adopted as the primary entropy coding method. The CABAC consists of three steps: binarization, context modeling, and binary arithmetic coding. As the binarization processes and context models are both manually designed in CABAC, the probability of the syntax elements may not be estimated accurately, which restricts the coding efficiency of CABAC. To address the problem, we propose a convolutional neural network-based arithmetic coding (CNNAC) method and apply it to compress the syntax elements of the intra-predicted residues in HEVC. Instead of manually designing the binarization processes and context models, we propose directly estimating the probability distribution of the syntax elements with a convolutional neural network (CNN), as CNNs can adaptively build complex relationships between inputs and outputs by training with a lot of data. Then, the values of the syntax elements, together with their estimated probability distributions, are fed into a multi-level arithmetic codec to perform entropy coding. In this paper, we have utilized the CNNAC to code the syntax elements of the DC coefficient;the lowest frequency AC coefficient;the second, third, fourth, and fifth lowest frequency AC coefficients;and the position of the last non-zero coefficient in the HEVC intra-predicted residues. The experimental results show that our proposed method achieves up to 6.7% BD-rate reduction and an average of 4.7% BD-rate reduction compared to the HEVC anchor under all intra (AI) configuration.

关键词： Syntactics Context modeling Video coding Entropy coding Estimation Convolutional neural networks arithmetic coding context-adaptive binary arithmetic coding (CABAC) convolutional neural network-based arithmetic coding (CNNAC) entropy coding high efficiency video coding (HEVC) intra-predicted residues

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：