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

Using arithmetic code to improve performance of Lempel-Ziv encoders

ELECTRONICS LETTERS 2000年第18期36卷 1563-1565页

作者： Pinho, MS Finamore, WA Pontificia Univ Catolica Rio de Janeiro Ctr Estudos Telecomunicac BR-22453900 Rio De Janeiro Brazil Univ Fed Rio de Janeiro EE DEL COPPEPEE BR-21945970 Rio De Janeiro Brazil

Recently it was shown that the Lempel-Ziv'78, an encoder which has motivated many practical data compressors, does not have optimal redundancy for many classes of sources. The authors present work which shows that this redundancy can be significantly improved by use of an arithmetic code. Practical benefits obtained from this technique are also presented.

关键词： data compressors data compression arithmetic codes encoding redundancy redundancy improvement codes arithmetic code Information theory Lempel-Ziv encoders

来源：评论

学校读者我要写书评

暂无评论

A low complexity pixel Domain Video Coding based on Turbo code and arithmetic code

A low complexity pixel Domain Video Coding based on Turbo co...

引用

International Conference on Wireless Communications in Unusual and Confined Areas (ICWCUCA)

作者： Lahsini, Cyrine Pyndiah, Ramesh Zaibi, Sonia Bouallegue, Ammar Telecom Bretagne Signal & Commun Dept Brest France Natl Engn Sch Tunis Syscoms Lab Tunis Tunisia

ISBN: (纸本)9781467312899

In recent years, with emerging applications such as multimedia sensors networks, wireless low-power surveillance and mobile camera phones, the traditional video coding architecture in being challenged. In fact, these applications have different requirements than those of the broadcast video delivery systems : a low power consumption at the encoder side is essential. In this context, we propose a pixel-domain video coding scheme which fits well in these senarios. In this system, both the arithmetic and turbo codes are used to encode the video sequence's frames. Simulations results show significant gains over Pixel-domain Wyner-Ziv video coding.

关键词： Turbo code arithmetic code distributed video coding

来源：评论

学校读者我要写书评

暂无评论

Efficient connected-index finite-length arithmetic codes

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2001年第5期11卷 581-593页

作者： Chan, DY Yang, JF Chen, SY I Shou Univ Dept Informat Engn Kaohsiung Taiwan Natl Cheng Kung Univ Dept Elect Engn Tainan 70101 Taiwan

In this paper, we propose a connected-index approach to construct efficient finite-length arithmetic codes by splitting the information of the last nonfitting symbol into the current and subsequent codewords. The proposed arithmetic codes, which limit the error propagation in about one block, require neither a post-appended end of-block symbol, nor pre-affixed side-information, to characterize the number of encoded symbols. Hence, the proposed finite-length arithmetic codes can nearly achieve the coding efficiency attained by infinite-length arithmetic codes. With high coding efficiency, limited error-propagation, and the regular process, the proposed coding approach is suitable for information exchange with small packets in modern high-speed network systems.

关键词： arithmetic code connected-index approach finite-length code

来源：评论

学校读者我要写书评

暂无评论

AN ALGEBRAIC MODEL OF arithmetic codeS

引用

IEEE TRANSACTIONS ON COMPUTERS 1982年第4期31卷 318-321页

作者： CHEN, CH Research Department Sperry Univac Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions

arithmetic codes use a structured redundancy technique for binary number representation such that errors in an arithmetic operation of a digital computer can be detected or corrected. This correspondence studies the code structures by treating the set of redundant coded binary representations as a finite Abelian group. An algebraic model of arithmetic codes is developed, which shows that an arithmetic code is a pair of cyclic group isomorphisms. Two theorems are derived which describe the necessary and sufficient conditions for the existence of an arithmetic code. It is also shown that the group of redundant coded binary numbers is isomorphic to a cyclic group, or the direct sum of two cyclic groups. For a given code generator A and the information cardinality m, the two theorems may be applied to find all existing arithmetic codes up to an isomorphism. The algebraic structures of all codes published to date are covered by the mathematical model described in this correspondence.

关键词： Algebraic model algebraic structure arithmetic code cyclic group isomorphism decoding function encoding function finite Abelian group isomorphic pair

来源：评论

学校读者我要写书评

暂无评论

DISTRIBUTED SOURCE CODING BASED ON PUNCTURED CONDITIONAL arithmetic codeS

DISTRIBUTED SOURCE CODING BASED ON PUNCTURED CONDITIONAL ARI...

引用

IEEE International Conference on Image Processing

作者： Chen, Xi Taubman, David S. Univ New S Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia

ISBN: (纸本)9781424479948

In this paper, we describe properties of punctured conditional arithmetic code for distributed source coding. A novel scheme using hierarchical interleaving has been developed to overcome non-stationarity in side channel statistics. The simulation results show that this proposed approach has excellent sphere-packing properties and outperforms the one without interleaving.

关键词： DSC arithmetic code

来源：评论

学校读者我要写书评

暂无评论

Design of the coarse-grained reconfigurable architecture DART with on-line error detection

引用

MICROPROCESSORS AND MICROSYSTEMS 2014年第2期38卷 124-136页

作者： Jafri, S. M. A. H. Piestrak, S. J. Sentieys, O. Pillement, S. Royal Inst Technol KTH Elect Syst Lab SE-10044 Stockholm Sweden Univ Lorraine UMR CNRS 7198 Inst Jean Lamour F-54506 Vandoeuvre Les Nancy France Univ Rennes 1 CAIRN Res Team IRISA INRIA F-22300 Lannion France Univ Nantes Ecole Polytech Dept Elect & Technol Numer F-44306 Nantes France

This paper presents the implementation of the coarse-grained reconfigurable architecture (CGRA) DART with on-line error detection intended for increasing fault-tolerance. Most parts of the data paths and of the local memory of DART are protected using residue code modulo 3, whereas only the logic unit is protected using duplication with comparison. These low-cost hardware techniques would allow to tolerate temporary faults (including so called soft errors caused by radiation), provided that some technique based on re-execution of the last operation is used. Synthesis results obtained for a 90 nm CMOS technology have confirmed significant hardware and power consumption savings of the proposed approach over commonly used duplication with comparison. Introducing one extra pipeline stage in the self-checking version of the basic arithmetic blocks has allowed to significantly reduce the delay overhead compared to our previous design. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Coarse-grained reconfigurable architecture (CGRA) Fault-tolerant system Reconfigurable system On-line error detection Self-checking circuit Residue code arithmetic code Temporary faults

来源：评论

学校读者我要写书评

暂无评论

Bidirectional adaptive compression

引用

DISCRETE APPLIED MATHEMATICS 2023年第1期330卷 40-50页

作者： Fruchtman, Aharon Gross, Yoav Klein, Shmuel T. Shapira, Dana Ariel Univ Comp Sci Dept Ariel Israel Bar Ilan Univ Dept Comp Sci Ramat Gan Israel

A new dynamic Huffman encoding has been proposed recently (Shmuel et al., 2021), which instead of basing itself on the information gathered from the already processed portion of the file, as traditional adaptive codings do, uses rather the information that is still to come. The current work extends this idea to bidirectional adaptive compression, taking both past and future into account, and not only performs at least as good as static Huffman, but also provably improves on the future-only based variant. We extend the technique to arithmetic coding and give both theoretical and empirical results that support the enhancement of the new compression algorithm.(c) 2023 Published by Elsevier B.V.

关键词： Huffman code arithmetic code Adaptive compression

来源：评论

学校读者我要写书评

暂无评论

Comparison of different methods of classification in subband coding of images

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 1997年第11期6卷 1473-1486页

作者： Joshi, RL Jafarkhani, H Kasner, JH Fischer, TR Farvardin, N Marcellin, MW Bamberger, RH WASHINGTON STATE UNIV SCH ELECT ENGN & COMP SCI PULLMAN WA 99164 USA UNIV MARYLAND SYST RES INST COLLEGE PK MD 20742 USA UNIV MARYLAND DEPT ELECT ENGN COLLEGE PK MD 20742 USA UNIV ARIZONA DEPT ELECT & COMP ENGN TUCSON AZ 85721 USA

This paper investigates various classification techniques, applied to subband coding of images, as a way of exploiting the nonstationary nature of image subbands, The advantages of subband classification are characterized in a rate-distortion framework in terms of ''classification gain'' and overall ''subband classification gain.'' Two algorithms, maximum classification gain and equal mean-normalized standard deviation classification, which allow unequal number of blocks in each class, are presented, The dependence between the classification maps from different subbands is exploited either directly while encoding the classification maps or indirectly by constraining the classification maps, The trade-off between the classification gain and the amount of side information is explored, Coding results for a subband image coder based on classification are presented, The simulation results demonstrate the value of classification in subband coding.

关键词： arithmetic code classification image coding subband trellis-coded quantization wavelet

来源：评论

学校读者我要写书评

暂无评论

Large-Alphabet Semi-Static Entropy Coding Via Asymmetric Numeral Systems

引用

ACM TRANSACTIONS ON INFORMATION SYSTEMS 2020年第4期38卷 1-33页

作者： Moffat, Alistair Petri, Matthias Univ Melbourne Sch Comp & Informat Syst Melbourne Vic 3010 Australia

An entropy coder takes as input a sequence of symbol identifiers over some specified alphabet and represents that sequence as a bitstring using as few bits as possible, typically assuming that the elements of the sequence are independent of each other. Previous entropy coding methods include the well-known Huffman and arithmetic approaches. Here we examine the newer asymmetric numeral systems (ANS) technique for entropy coding and develop mechanisms that allow it to be efficiently used when the size of the source alphabet is large-thousands or millions of symbols. In particular, we examine different ways in which probability distributions over large alphabets can be approximated and in doing so infer techniques that allow the ANS mechanism to be extended to support large-alphabet entropy coding. As well as providing a full description of ANS, we also present detailed experiments using several different types of input, including data streams arising as typical output from the modeling stages of text compression software, and compare the proposed ANS variants with Huffman and arithmetic coding baselines, measuring both compression effectiveness and also encoding and decoding throughput. We demonstrate that in applications in which semi-static compression is appropriate, ANS-based coders can provide an excellent balance between compression effectiveness and speed, even when the alphabet is large.

关键词： Asymmetric numeral systems compression Burrows-Wheeler transform entropy coder Huffman code arithmetic code

来源：评论

学校读者我要写书评

暂无评论

Selective dynamic compression

引用

DISCRETE APPLIED MATHEMATICS 2024年 358卷 13-22页

作者： Klein, Shmuel T. Opalinsky, Elina Shapira, Dana Bar Ilan Univ Dept Comp Sci Ramat Gan Israel Anel Univ Comp Sci Dept Ariel Israel

Dynamic compression methods continuously update the model of the underlying text file to be compressed according to the already processed part, assuming that such models accurately predict the distribution in the remaining part. Since this premise is not necessarily true, we suggest to update the model only selectively. We give empirical evidence that this hardly affects the compression efficiency, while it obviously may save processing time and facilitate the use of the compression scheme for cryptographic applications. (c) 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.

关键词： Huffman code arithmetic code Adaptive compression LZW

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：