Cart (Loading....) | Create Account
Close category search window
 

Protecting data compression: Arithmetic coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Redinbo, G.R. ; Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, 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

Published in:

Computers and Digital Techniques, IEE Proceedings -  (Volume:147 ,  Issue: 4 )

Date of Publication:

Jul 2000

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.