CFP last date
20 June 2024
Reseach Article

FPGA Implementation of Multi-alphabet Arithmetic Coding Using Rotating Intervals

Published on December 2011 by Rajesh Adluri, G. Surender Babu, Philemon Daniel
International Conference on Electronics, Information and Communication Engineering
Foundation of Computer Science USA
ICEICE - Number 2
December 2011
Authors: Rajesh Adluri, G. Surender Babu, Philemon Daniel
4bdd9ed8-001a-45de-a690-f37fc0bafd89

Rajesh Adluri, G. Surender Babu, Philemon Daniel . FPGA Implementation of Multi-alphabet Arithmetic Coding Using Rotating Intervals. International Conference on Electronics, Information and Communication Engineering. ICEICE, 2 (December 2011), 10-14.

@article{
author = { Rajesh Adluri, G. Surender Babu, Philemon Daniel },
title = { FPGA Implementation of Multi-alphabet Arithmetic Coding Using Rotating Intervals },
journal = { International Conference on Electronics, Information and Communication Engineering },
issue_date = { December 2011 },
volume = { ICEICE },
number = { 2 },
month = { December },
year = { 2011 },
issn = 0975-8887,
pages = { 10-14 },
numpages = 5,
url = { /specialissues/iceice/number2/4258-iceice012/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Special Issue Article
%1 International Conference on Electronics, Information and Communication Engineering
%A Rajesh Adluri
%A G. Surender Babu
%A Philemon Daniel
%T FPGA Implementation of Multi-alphabet Arithmetic Coding Using Rotating Intervals
%J International Conference on Electronics, Information and Communication Engineering
%@ 0975-8887
%V ICEICE
%N 2
%P 10-14
%D 2011
%I International Journal of Computer Applications
Abstract

We present a modified AC scheme for multi-alphabet that offers both encryption and compression. The system utilises an arithmetic coder in which the overall length within the range [0, 1] allocated to each symbol is upheld, but the conventional assumption that the orientation of the symbols remains unchanged throughout the process is removed. The encryption and compression can be carried out simultaneously, by rotating intervals that are invoked by a rotation key without affecting the efficiency. The proposed methodology also facilitates a direction key to make the rotations in either direction.

References
  1. G. Langdon and J. Rissanen, “Compression of Black-White Images with Arithmetic Coding,” IEEE Trans. Commun., vol. 29, pp. 858–867, 1981.
  2. J. Cleary, S. Irvine, and I. Rinsma-Melchert, “On the insecurity of arithmetic coding,” Computers and Security, vol. 14, pp. 167–180, 1995.
  3. Bergen and J. Hogan, “A chosen plaintext attack on an adaptive arithmetic coding algorithm,” Computers and Security, vol. 12, pp. 157–167, 1993
  4. 4 Liu and L. Karem, “Mutual Information-Based Analysis of JPEG2000 Contexts,” IEEE Trans. Image Process, vol. 14, no. 4, pp. 411–422, 2005.
  5. M. Grangetto, A. Grosso, and E. Magli, “Selective encryption of JPEG2000 images by means of randomized arithmetic coding,” in Proc. IEEE 6th Workshop on Multimedia Signal Processing. Siena, Italy, pp. 347–350, Sept.2004.
  6. Hyngjin Kim,Jiangtao Wen and John D villasenor,”Security arithmeticcoding” IEEE Tans.Signal processing,vol55,No.5,pp.2263-2272,2007.
  7. H.Hashempour and F.Lombardi,”Compression of vlsi test data”, In Proc.IEEE 19th International symposium on DFT,04.
  8. T. Cover and J. Thomas, Elements of Information Theory. John Wiley & Sons, 1991.
  9. Liu and L. Karem, “Mutual Information-Based Analysis of JPEG2000 Contexts,” IEEE Trans. Image Process., vol. 14, no. 4, pp. 411–422, 2005.
Index Terms

Computer Science
Information Sciences

Keywords

Arithmetic coding cryptography data compression rotation