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

Application of arithmetic coding to compression of VLSI test data

IEEE TRANSACTIONS ON COMPUTERS 2005年第9期54卷 1166-1177页

作者： Hashempour, H Lombardi, F LTX Corp IC Dev & Appl Res San Jose CA 95134 USA Northeastern Univ Dept Elect & Comp Engn Boston MA 02115 USA

This paper proposes arithmetic coding for application to data compression for VLSI testing. The use of arithmetic codes results in a codeword whose length is close to the optimal value (as predicted by entropy in information theory), thus achieving a higher compression. Previous techniques (such as those based on Huffman or Golomb coding) result in optimal codes for data sets in which the probability model of the symbols satisfies specific requirements. This paper shows empirically and analytically that Huffman and Golomb codes can result in a large difference between the bound established by the entropy and the attained compression;therefore, the worst-case difference is studied using information theory. Compression results for arithmetic coding are presented using ISCAS benchmark circuits;a practical integer implementation of arithmetic coding/decoding and an analysis of its deviation from the entropy bound are pursued. A software implementation is proposed using embedded DSP cores. In the experimental evaluation, fully specified test vectors and test cubes from two different ATPG programs are utilized. The implications of arithmetic coding on manufacturing test using an ATE are also investigated.

关键词： test data compression Golomb coding Huffman coding arithmetic coding SoC ATE

来源：评论

学校读者我要写书评

暂无评论

High-performance arithmetic coding VLSI macro for the H264 video compression standard

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2005年第1期51卷 144-151页

作者： Núñez, JL Chouliaras, VA Univ Bristol Dept Elect & Elect Engn Bristol Avon England Univ Loughborough Dept Elect Engn Loughborough Leics England

this paper investigates the algorithmic complexity of arithmetic coding in the new H264 video coding standard and proposes a processor-coprocessor architecture to reduce it by more than an order of magnitude. The proposed coprocessor is based on an innovative algorithm known as the MZ-coder and maintains the original coding efficiency via a low-complexity, multiplication-free, non-stalling, fully pipelined architecture. The coprocessor achieves a constant throughput for both coding and decoding processes of 1 symbol per cycle and is designed to be attached to a controlling embedded RISC CPU whose instruction set has been extended with arithmetic coding instructions.

关键词： arithmetic coding H264 video coding Golomb codes renormalization embedded systems RISC CPU

来源：评论

学校读者我要写书评

暂无评论

VLSI implementation of SISO arithmetic decoders for joint source channel coding 08

VLSI implementation of SISO arithmetic decoders for joint so...

引用

2008 Design, Automation and Test in Europe (DATE 2008), vol.3

作者： Simone Zezza Guido Masera Politecnico di Torino Italy

ISBN: (纸本)9783981080131

In this paper we propose an efficient VLSI implementation of a Soft Input Soft Output (SISO) arithmetic code (AC) decoder for joint source channel coding. The addressed application shows a very high level of processing complexity, but, to the best of our knowledge, no papers have been published in the literature on the hardware implementation of the considered joint source channel scheme. First we introduce a simplified algorithm for the SISO AC, which is 1.3 times faster than the standard one. Then an efficient SISO AC architecture is proposed and synthesis results on a 0.13μm standard cells technology are reported for two different sets of parameters (M=128, M=256). The proposed core runs at 338.9MHz and can decode up to 124.987kbit/s.

关键词： Combined source-channel coding Channel coding decoders Very large scale integration Joints ALTERNATING CURRENT arithmetic arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

High-performance arithmetic coding VLSI macro for the H264 video compression standard

High-performance arithmetic coding VLSI macro for the H264 v...

引用

23rd Annual International Conference on Consumer Electronics (ICCE)

作者： Núñez, JL Chouliaras, VA Univ Bristol Dept Elect & Elect Engn Bristol BS8 1TH Avon England

ISBN: (纸本)0780388380

This paper investigates the algorithmic complexity of arithmetic coding in the new H264 video coding standard and proposes a coprocessor to reduce it by more than an order of magnitude. The coprocessor is based on an innovative algorithm named as the MZ-coder and maintains the original coding efficiency with a multiplication-free, non-stalling, fully pipelined architecture with modest hardware requirements. The coprocessor delivers a constant throughput for both coding and decoding of 1 bit per cycle and can be attached to a controlling CPU whose ISA has been extended with arithmetic coding instructions.

关键词： arithmetic coding H264 video coding Golomb codes renormalization

来源：评论

学校读者我要写书评

暂无评论

On Entropy-Constrained Vector Quantization using Gaussian Mixture Models

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2008年第12期56卷 2094-2104页

作者： Zhao, David Y. Samuelsson, Jonas Nilsson, Mattias Royal Inst Technol Sch Elect Engn Stockholm Sweden Dolby Labs Stockholm Sweden

A flexible and low-complexity entropy-constrained vector quantizer (ECVQ) scheme based on Gaussian mixture models (GMMs), lattice quantization, and arithmetic coding is presented. The source is assumed to have a probability density function of a GMM. An input vector is first classified to one of the mixture components, and the Karhunen-Loeve transform of the selected mixture component is applied to the vector, followed by quantization using a lattice structured codebook. Finally, the scalar elements of the quantized vector are entropy coded sequentially using a specially designed arithmetic coder. The computational complexity of the proposed scheme is low, and independent of the coding rate in both the encoder and the decoder. Therefore, the proposed scheme serves as a lower complexity alternative to the GMM based ECVQ proposed by Gardner, Subramaniam and Rao [1]. The performance of the proposed scheme is analyzed under a high-rate assumption, and quantified for a given GMM. The practical performance of the scheme was evaluated through simulations on both synthetic and speech line spectral frequency (LSF) vectors. For LSF quantization, the proposed scheme has a comparable performance to [1] at rates relevant for speech coding (20-28 bits per vector) with lower computational complexity.

关键词： Entropy constrained vector quantization VQ lattice Gaussian mixture model GMM arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

PARALLEL CABAC FOR LOW POWER VIDEO coding

PARALLEL CABAC FOR LOW POWER VIDEO CODING

引用

15th IEEE International Conference on Image Processing (ICIP 2008)

作者： Sze, Vivienne Chandrakasan, Anantha P. Budagavi, Madhukar Zhou, Minhua MIT 77 Massachusetts Ave Cambridge MA 02139 USA Texas Instruments Inc Dallas TX USA

ISBN: (纸本)9781424417650

With the growing presence of high definition video content on battery-operated handheld devices such as camera phones, digital still cameras, digital camcorders, and personal media players, it is becoming ever more important that video compression be power efficient. A popular form of entropy coding called Context-Based Adaptive Binary arithmetic coding (CABAC) provides high coding efficiency but has limited throughput. This can lead to high operating frequencies resulting in high power dissipation. This paper presents a novel parallel CABAC scheme which enables a throughput increase of N-fold (depending on the degree parallelism), reducing the frequency requirement and expected power consumption of the coding engine. Experiments show that this new scheme (with N=2) can deliver similar to 2x throughput improvement at a cost of 0.76% average increase in bit-rate or equivalently a decrease in average PSNR of 0.025dB on five 720p resolution video clips when compared with H.264/AVC.

关键词： video coding arithmetic coding parallel processing CABAC

来源：评论

学校读者我要写书评

暂无评论

Lossless nibbled data embedding scheme based on difference expansion

引用

IMAGE AND VISION COMPUTING 2008年第5期26卷 632-638页

作者： Lu, Tzu-Chuen Chang, Chin-Chen Chaoyang Univ Technol Dept Informat Management Taichung 41349 Taiwan Feng Chia Univ Dept Comp Sci & Informat Engn Taichung 40724 Taiwan

This paper proposes a lossless data embedding scheme of great payload capacity and good image quality, which is based on difference expansion. In this scheme, every pixel in a host image is divided into two nibbles and each nibble pair between two adjacent pixels can be used to hide a secret message. In order to completely recover the host image, the arithmetic coding is adopted based on prediction by partial matching (PPM) model to compress the restored information. This proposed scheme has been successfully applied to different images. According to the experimental results, embedded information can be extracted correctly and quickly from the embedded image. In addition, the proposed scheme can not only hide a large amount of information in a host image without making noticeable distortion, but can also completely restore the host image from the embedded image. (C) 2007 Elsevier B.V. All rights reserved.

关键词： lossless data embedding difference expansion nibble arithmetic coding prediction by partial matching

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of some multimedia encryption schemes

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2008年第3期10卷 330-338页

作者： Jakimoski, Goce Subbalakshmi, K. P. Stevens Inst Technol Dept Elect & Comp Engn Hoboken NJ 07030 USA

Encryption is one of the fundamental technologies that is used in digital rights management. Unlike ordinary computer applications, multimedia applications generate large amounts of data that has to be processed in real time. So, a number of encryption schemes for multimedia applications have been proposed in recent years. We analyze the following proposed methods for multimedia encryption: key-based multiple Huffman tables (MHT), arithmetic coding with key-based interval splitting (KSAC), and randomized arithmetic coding (RAC). Our analysis shows that MHT and KSAC are vulnerable to low complexity known- and/or chosen-plaintext attacks. Although we do not provide any attacks on RAC, we point out some disadvantages of RAC over the classical compress-then-encrypt approach.

关键词： arithmetic coding cryptanalysis key-based interval splitting multimedia encryption multiple Huffman tables randomized arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

Wavelet Based Medical Image Compression through Prediction

Wavelet Based Medical Image Compression through Prediction

引用

12th IEEE International Multitopic Conference

作者： Javed, Muhammad Younus Khan, Muhammad Habib Natl Univ Sci & Technol Dept Comp Engn Coll Elect & Mech Engn Rawalpindi Pakistan

ISBN: (纸本)9781424428236

This paper offers a simple and lossless compression method for compression of medical images. Method is based on wavelet decomposition of the medical images followed by the correlation analysis of coefficients. The correlation analyses are the basis of prediction equation for each sub band. Predictor variable selection is performed through coefficient graphic method to avoid multicollinearity problem and to achieve high prediction accuracy and compression rate. The method is applied on MRI and CT images. Results show that the proposed approach gives a high compression rate for MRI and CT images comparing with state of the art methods.

关键词： Correlation coefficient Selection of predictor variable DPCM arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

A Time-Effective Lossless Coder Based on Hierarchical Contexts and Adaptive Predictors

A Time-Effective Lossless Coder Based on Hierarchical Contex...

引用

IEEE Mediterranean Electrotechnical Conference

作者： Ulacha, Grzegorz Ski, Ryszard Stasi Tech Univ Szczecin Dept Comp Sci Szczecin Poland Poznan Univ Tech Fac Elect & Telecommun Poznan Poland

ISBN: (纸本)9781424416325

In the paper an efficient and time-effective lossless coding technique is presented. The method is context-based, three principal contexts are defined, for neighborhoods with special properties three auxiliary contexts are used. A simple predictor adaptation technique, being extension of ALCM algorithm, is implemented, hence, it is proposed to denote the new method as ALCM(+). A sophisticated formula for correcting the cumulated predictor error combining 8 bias estimators is calculated. Performance of the new algorithm has been tested on the set of 9 widely used benchmark images. It has been shown that indeed, the new technique has been time-effective while it has outperformed the well known methods having reasonable time complexity, like CALIC or JPEG-LS, and has been inferior only to those that are extremely computationally complex.

关键词： image coding lossless coding data modeling context coding linear predictor cumulated predictor error arithmetic coding adaptive predictor

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：