سال انتشار: ۱۳۸۹

محل انتشار: ششمین کنفرانس ماشین بینایی و پردازش تصویر

تعداد صفحات: ۷

نویسنده(ها):

Aref Jafari – University of Guilan, CE Department, Rasht, Iran
Mahbube Rezvan –
Asadollah Shahbahrami –

چکیده:

Arithmetic and Huffman coding are two important algorithms which are used in multimedia compression. In this paper, we compare these two algorithms from performance, compression ratio, and implementation point of views for different text files with different capacities. Experimental results show that the compression ratio of the arithmetic coding is better than Huffman coding, while the performance of the Huffman coding is better than the arithmetic coding. In addition, from implementation point of view, implementation of Huffman coding is easier than the arithmetic coding.