Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

Performance Analysis of Mobile Memory Optimization Techniques

Print
PDF
IJCA Proceedings on National Conference on Innovative Paradigms in Engineering & Technology 2013
© 2013 by IJCA Journal
NCIPET2013 - Number 1
Year of Publication: 2013
Authors:
Deepali D. Kayande
Jignyasa Sanghvi

Deepali D Kayande and Jignyasa Sanghvi. Article: Performance Analysis of Mobile Memory Optimization Techniques. IJCA Proceedings on National Conference on Innovative Paradigms in Engineering & Technology 2013 NCIPET 2013(1):16-21, December 2013. Full text available. BibTeX

@article{key:article,
	author = {Deepali D. Kayande and Jignyasa Sanghvi},
	title = {Article: Performance Analysis of Mobile Memory Optimization Techniques},
	journal = {IJCA Proceedings on National Conference on Innovative Paradigms in Engineering & Technology 2013},
	year = {2013},
	volume = {NCIPET 2013},
	number = {1},
	pages = {16-21},
	month = {December},
	note = {Full text available}
}

Abstract

SMSLingo, a hybrid compression technique is a conjunction of RLE with static dictionary encoders based on lossless reversible transformation. This will be used for text file compression to offer better compression ratio and allow better utilization of internal memory on Android platform. The idea behind the technique is of converting the normal English text into short-form words using static dictionary and then applying Run Length Encoding (RLE) technique on this converted short-form text. Experimental results are evaluated and comparison is made between 3 text compression techniques, Huffman Coding, RLE and SMS Lingo. Promising rise is seen in the achieved results using the SMS Lingo compression algorithm in comparison with other available methods. Also this application is reasonably smaller in size as compared to the size of default SMS application present on Android platforms and with the other SMS compressor applications present for the platform. The RAM and cache memory consumption is around 3 MB for this application where the default Messaging application requires around 8 MB. Thus the proposed hybrid technique is reasonable with respect to RAM as well as cache memory consumption.

References

  • Deepali Kayande, Urmila Shrawankar, "SMS Lingo: A hybrid text compression technique for mobile storage utilization", International Conference on Advances in Modeling, Optimization and Computing 2011
  • Ningde Xie, et al. , "Using Lossless Data Compression in Data Storage Systems", IEEE Transactions on Computers, Vol. 60, No. 3, March 2011.
  • Mo yuanbin, et al. , "A data compression algorithm based on adaptive Huffman code for Wireless Sensor Networks", Fourth International Conference on Intelligent Computation Technology and Automation 2011.
  • Ahmad Affandi, et al. , "The Application of Text Compression to Short Message Service Using Huffman Table", Jurnal Generic Indonesia 2011.
  • Stefan Böttcher, et al. , 2011 , Search and Modification in Compressed Texts, Data Compression Conference,
  • S. R. Kodituwakku and U. S. Amarasinghe, 2010, Comparison of Lossless Data Compression Algorithms for Text Data, Indian Journal of Computer Science and Engineering, Vol 1 No 4.
  • Rui Yang, Hong Cai, 2009, Research and Design of Short Message Service System Based on ARM and GPRS, Second International Symposium on Computational Intelligence and Design.
  • Liu Pu, 2009, Performance Analysis of Short Message Service, International Symposium on Intelligent Ubiquitous Computing and Education.
  • L. Robert and R. Nadarajan, 2009, Simple lossless preprocessing algorithms for text compression, IET Softw. , Vol. 3, Iss. 1, pp. 37–45.
  • Xibo Wang, Yanting Yang, 2009, Method and Implementation of Sending and Receiving Mobile Phone Messages, International Forum on Computer Science-Technology and Applications.
  • Mauro Teófilo, et al. , 2009, Ulmo: A system to Enable Mobile Applications Personalization by Binary SMS, Fourth International Multi- Conference on Computing in the Global Information Technology.
  • Stephan Rein et al. , 2006, Low-Complexity Compression of Short Messages, Data Compression Conference (DCC).
  • Jan L´ansk´y, Michal ?Zemli?cka, 2009, Compression of Small Text Files using Syllables, Data Compression Conference (DCC).
  • Ming-Bo Lin, et al. , 2006, A Lossless Data Compression and Decompression Algorithm and Its Hardware Architecture, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 14, No. 9, September.
  • B. S. Shajeemohan, Dr. V. K. Govindan, 2005, Compression Scheme for Faster and Secure Data Transmission over Networks, International Conference on Mobile Business (ICMB).
  • Timm Euler, 2006, Tailoring Text Using Topic Words: Selection and Compression, 13th International Workshop on Database and Expert Systems Applications (DEXA).
  • Michelle Effros, et al. , 2002, Universal Lossless Source Coding With the Burrows Wheeler Transform, IEEE Transactions on Information Theory, Vol. 48, No. 5.
  • S. Kwong and Y. F. Ho, 2001, A Statistical Lempel-Ziv Compression Algorithm for Personal Digital Assistant (PDA), IEEE Transactions on Consumer Electronics, Vol. 47, No. 1.
  • David Salomon, Data Compression- The Complete Reference, Third Edition.
  • The Oxford English Dictionary, http://www. indiana. edu/~letrs/help- services/QuickGuides/oed-abbr. html
  • Standard Word Abbreviations, http://www. acs. utah. edu/acs/qa_standards/psstd02a. htm
  • Business English, http://www. learn-english-today. com/business-english/abbreviations. html