An overview ofAdaptiveBinary Range Coderwith low memory requirement

Main Article Content

ShardaB. Shelke,
Prof. Anjali .A. Yadav

Abstract

Thereare number of coders used in video or image compression techniques such as MQ-coder used in JPEG2000, Q-coder used in JPEG.In proposed system, the virtual sliding window is used for probability estimation, which does not uses lookup table.Forimprovingcompression performancea new adaptive window size selection algorithmis used. As compared tothe binary range coder with a single window, the proposed algorithm provides a faster probability estimation and adaptation at the initial encoding and decoding stage, and more precise probability estimation for very low entropy bina-ry sources. In proposed system uses virtual sliding window,thereforethe memory requirement is less as compared to pre-vious system. The power consumption of proposed system is measured byusingthe Xilinx Xpower analyzer. The power consumption is reduced in proposed Adaptive Binary Range Coder as compared to previous coders like M-coder and MQ-coder.

Downloads

Download data is not yet available.

Article Details

How to Cite
ShardaB. Shelke, & Prof. Anjali .A. Yadav. (2021). An overview ofAdaptiveBinary Range Coderwith low memory requirement. International Journal of Innovations in Engineering Research and Technology, 1-5. https://repo.ijiert.org/index.php/ijiert/article/view/1138
Section
Articles

How to Cite

ShardaB. Shelke, & Prof. Anjali .A. Yadav. (2021). An overview ofAdaptiveBinary Range Coderwith low memory requirement. International Journal of Innovations in Engineering Research and Technology, 1-5. https://repo.ijiert.org/index.php/ijiert/article/view/1138

Similar Articles

You may also start an advanced similarity search for this article.