Abstract
A fully parallel implementation of the multi-alphabet arithmetic-coding algorithm, an integral part of many lossless data compression systems, had so far eluded the research community. Although schemes were in existence for performing the encoding operation in parallel, the data dependencies involved in the decoding phase prevented its parallel execution. This paper presents a scheme for the parallel-pipelined implementation of both the phases of the arithmetic-coding algorithm for multisymbol alphabets in high-speed programmable hardware. The compression performance of the proposed scheme has been evaluated and compared with an existing sequential implementation in terms of average compression ratio as well as the estimated execution time for the Canterbury Corpus test set of files. The proposed scheme facilitates hardware realization of both coder and decoder modules by reducing the storage capacity necessary for maintaining the modeling information. The design has been synthesized for Xilinx field-programmable gate arrays and the synthesis results obtained are encouraging, paving the way for further research in this direction.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Circuits and Systems I: Regular Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
