Modifikasi Algoritme J-Bit Encoding untuk Meningkatkan Rasio Kompresi
Abstract
J-bit encoding is a lossless data compression algorithm that manipulates each bit of file data in order to minimize the size by dividing data into two outputs and combining data into two outputs. This research proposes a modification of the J-bit Encoding algorithm by eliminating zero and one symbols of the first output. As a result, the first output will contain the original data without zero and one symbols and the second output will contain the value of two bits that describe the position of zero, one, and byte besides zero and one. The two algorithms are compared by testing four scheme combination algorithms, which are (i) Burrows-Wheeler transformation, Move to Front, J-Bit Encoding, and arithmetic coding, (ii) Burrows-Wheeler transformation, Move to Front, modification of the J-bit Encoding, and arithmetic coding, (iii) Burrows-Wheeler transformation, Move One From Front, J-Bit encoding, and arithmetic coding, (iv) Burrows-Wheeler transformation, Move One From Front, modification of the J-bit Encoding, and arithmetic coding. By using the Calgary Corpus and Canterbury Corpus data sets, the test results show that the best compression ratio is obtained by using a second scheme on average. On the other hand, by using four image files, the test results show that the best compression ratio is obtained by using a fourth scheme on average.
References
B. Winduratna, A. Susanto dan R. Hidayat, “Penyandi Persepsi Isyarat Audio Berdasar pada Model,” Jurnal Nasional Teknik Elektro dan Teknologi Informasi, vol. V, no. 3, pp. 213-221, 2016.
C. Steinruecken, “Lossless Data Compression,” University of Cambridge, Cambridge, 2014.
P. Fenwick, “Burrows–Wheeler Compression: Principles and Reflections,” Theoretical Computer Science, vol. CCCLXXXIX, no. 3, pp. 200-219, 2007.
Y. Rathore, M. K. Ahirwar dan R. Pandey, “A Brief Study of Data Compression Algorithms,” International Journal of Computer Science and Information Security, vol. XI, no. 10, pp. 86-94, 2013.
H. Al-Bahadili dan S. M. Hussain, “An adaptive character wordlength algorithm for data compression,” Computers and Mathematics with Applications, vol. LV, no. 6, p. 1250–1256, 2008.
S. David , Data Compression The Complete Reference, 4th penyunt., London: Springer–Verlag, 2006.
I. M. A. D. Suarjaya, “A New Algorithm for Data Compression Optimization,” International Journal of Advanced Computer Science and Applications, vol. III, no. 8, pp. 14-17, 2012.
S. Ambadekar, K. Gandhi, J. Nagaria dan R. Shah, “Advanced Data Compression Using J-bit Algorithm,” International Journal of Science and Research, vol. IV, no. 3, pp. 1366-1368, 2015.
N. Sharma, J. Kaur dan N. Kaur, “A Review on various Lossless Text Data Compression Techniques,” Research Cell: An International Journal of Engineering Sciences, vol. XII, no. 2, pp. 58-63, 2014.
A. T. Sadiq, M. G. Duaimi dan R. S. Ali, “Large Dataset Compression Approach Using Intelligent Technique,” Journal of Advanced Computer Science and Technology Research, vol. III, no. 1, pp. 1-20, 2013.
T. Singla dan R. Kumar, “ECG Signal Monitored Under Various Compression Techniques and Transmission Environments - A Survey Approach,” International Journal of Applied Research in Computing, vol. II, no. 4, pp. 69-74, 2014.
S. E. Adewumi, “Character Analysis Scheme for Compressing Text Files,” International Journal of Computer Theory and Engineering, vol. VII, no. 5, pp. 362-365, 2015.
J. Abel, “Post BWT Stages of The Burrows-Wheeler Compression Algorithm,” Software Practice and Experience, vol. XL, no. 9, p. 751–777, 2010.
M. Burrows dan D. J. Wheeler, “A Block-sorting Lossless Data Compression Algorithm,” Digital Systems Research Center Report, Palo Alto, California, 1994.
S. Chatterjee, “Block Based Data Compression Using Burrows-Wheeler Transform,” Department Of Information Technology Jadavpur University, Kolkata-India, 2013.
S. Mantaci, A. Restivo, G. Rosone dan M. Sciortino, “An extension of the Burrows–Wheeler Transform,” Theoretical Computer Science, vol. CCCLXXXIX, no. 3, p. 298–312, November 2007.
B. Balkenhol , S. Kurtz dan Y. M. Shtarkov, “Data Compression Conference, 1999. Proceedings. DCC '99,” Modifications of the Burrows and Wheeler data compression algorithm, pp. 188-197, March 1999.
E. Syahrul, J. Dubois dan V. Vajnovszki, “Combinatorial Transforms : Application in Lossless Image Compression,” Journal of Discrete Mathematical Sciences and Cryptography, vol. XIV, no. 2, pp. 129-147, 2011.
S. Shanmugasundaram dan R. Lourdusamy, “A Comparative Study Of Text Compression Algorithms,” International Journal of Wisdom Based Computing, vol. I, no. 3, pp. 68-76, 2011.
L. Sasilal dan V. K. Govindan, “Arithmetic Coding-A Reliable Implementation,” International Journal of Computer Applications, vol. LXXIII, no. 7, pp. 1-5, 2013.
R. Dorrigiv, . A. López-Ortiz dan J. I. Munro, “An Application of Self-Organizing Data Structures to Data Compression,” dalam International Symposium on Experimental Algorithms, Berlin Heidelberg, 2009.
J. Chen, J. Zhou dan K.-W. Wong, “A Modified Chaos-Based Joint Compression and Encryption Scheme,” IEEE Transactions on Circuits and Systems II: Express Briefs, vol. LVIII, no. 2, pp. 110 - 114, 2011.
S. Shanmugasundaram dan R. Lourdusamy, “IIDBE: A Lossless Text Transform for Better Compression,” International Journal of Wisdom Based Computing, vol. I, no. 2, pp. 1-6, 2011.
© Jurnal Nasional Teknik Elektro dan Teknologi Informasi, under the terms of the Creative Commons Attribution-ShareAlike 4.0 International License.
1.png)
