Call for Paper - June 2019 Edition
IJCA solicits original research papers for the June 2019 Edition. Last date of manuscript submission is May 20, 2019. Read More

Data Compression using Simulated Circular Indexing Transform (SCIT)

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2018
Gebremichael Girmay, D. Lalitha Bhaskari

Gebremichael Girmay and Lalitha D Bhaskari. Data Compression using Simulated Circular Indexing Transform (SCIT). International Journal of Computer Applications 179(43):1-9, May 2018. BibTeX

	author = {Gebremichael Girmay and D. Lalitha Bhaskari},
	title = {Data Compression using Simulated Circular Indexing Transform (SCIT)},
	journal = {International Journal of Computer Applications},
	issue_date = {May 2018},
	volume = {179},
	number = {43},
	month = {May},
	year = {2018},
	issn = {0975-8887},
	pages = {1-9},
	numpages = {9},
	url = {},
	doi = {10.5120/ijca2018917126},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}


One of the critical issues in big data environment is the volume of the data generated and streamed in real time or archived for later use. If the data streamed in real-time is large enough then the time required to transmit that data may lead to unnecessary delay and latency problems. The other case with huge volumes of data when it is archived is the case of storage devices requirements. Compressing the data before or while transmitting is one useful solution to minimize the size of data and thus avoid or minimize the latency problem and storage shortages. In this research paper the focus will be to deal on some compression techniques, especially in data transforming techniques similar to BWT, MTF and RLE which are commonly used to transform the data prior to encoding the data into fewer bits using entropy encoding techniques such as Huffman, Arithmetic, Golomb, etc. All the data transforming techniques have their own positive and weak sides. Thus in this paper alternative method is proposed to fill some of the gaps that cannot be solved by the already existing data compression transforming techniques. The proposed algorithm can be combined with other data compression methods to optimize the compression efficiency. The performance of this proposed algorithm is measured as compared to other related compression algorithms, and it is found that in some special cases it can perform better than others.


  1. David Salmon, Data compression, The Complete Reference, 4th Edition.
  2. Stefan Buttcher, Information Retrieval: Implementing and Evaluating Search Engines.
  3. Debra A. Lelewer, Data Compression.
  4. Timothy C. Bell et al, 1990. Text Compression.
  5. Sebastian Deorowicz, Universal lossless data compression algorithms.
  6. David Salomon, Data Compression The Complete Reference 4th edition.
  7. Colt McAnlis & Aleks Haecky, Understanding Compression, Data Compression for Modern Developers.
  8. Dwi Suarjaya, 2012. A New Algorithm for Data Compression Optimization, JACSA Vol. 3, No.8.
  9. David Salmon et al, Hand Book of Data Compression, 5th Edition.
  10. Rakesh Mohanty, An Improved Move-To-Front (IMTF) Offline Algorithm for the List Accessing Problem.
  11. Khalid Sayood, Introduction to Data Compression, 3rd Edition.
  12. L. Hanzo, R. G. Maunder, 2010. Near-Capacity Variable Length Coding. [13] Arup Kumar Bhattacharjee,


Info-table, unique symbol, codeword, SCIT, frequency, gap, critical issue