Bounded probability based textual data compression for fiber-optic communication

  • Authors

    • Bosco Paul Alapatt Department of Computer Science, Bharathiar University, Coimbatore, India
    • A Kavitha Department of Computer Science, Gongunadu Arts and Science College, Coimbatore, India
    2019-04-21
    https://doi.org/10.14419/ijet.v7i4.14873
  • Fiber Optic Communication, Dictionary Based Coding, Data Compression, Textual Dataset.

  • Fiber optic communication becomes very popular due to its nature of high data rate. Though fiber optic communication offers faster data transmission, it suffers from the drawback of massive amount of data being generated, stored or transmitted. Data compression techniques are introduced to minimize the size of data which eventually reduces the bandwidth utilization, storage space and data transmission at a faster rate. This paper presents a new dictionary based encoding technique called Bounded probability based textual data compression algorithm called BPT algorithm. The BPT algorithm generates a codeword based on the dictionary, which contains the binary code based on the probability of occurrence of characters in the input data. For decompression, there is a need to transmit the coding table along with the compressed data. The proposed BPT algorithm is tested using a set of benchmark textual dataset from The Calgary Corpus and The Canterbury Corpus. The experimental results verified the superiority of the BPT algorithm over the state of art methods in terms of different measures namely compression ratio (CR), compression factor (CF), bits per character (bpc) and space savings.

     

     

  • References

    1. [1] Medard, Muriel, Douglas Marquis, A. Richard Barry, and G. Steven Finn. "Security issues in all-optical networks." IEEE network 11, no. 3(1997): 42-48. https://doi.org/10.1109/65.587049.

      [2] Skorin-Kapov, Nina, MarijaFurdek, Szilard Zsigmond, and Lena Wosinska. "Physical-layer security in evolving optical networks." IEEE Communications Magazine, Vol. 54, No. 8, (2016) :110-117. https://doi.org/10.1109/MCOM.2016.7537185.

      [3] Shaneman, Keith, and Stuart Gray. "Optical network security: technical analysis of fiber tapping mechanisms and methods for detection & prevention." In Military Communications Conference, MILCOM 2004. 2004 IEEE, Vol. 2, pp. 711-716, 2004.

      [4] Alfalou, Ayman, C. Brosseau, Nadine Abdallah, and Maher Jridi, "Simultaneous fusion, compression, and encryption of multiple images." Optics express, Vol. 19, No. 24, pp. 24023-24029, 2011. https://doi.org/10.1364/OE.19.024023.

      [5] Alfalou, Ayman, Christian Brosseau, N. Abdallah, and M. Jridi. "Assessing the performance of a method of simultaneous compression and encryption of multiple images and its resistance against various attacks." Optics express, Vol. 21, No. 7, (2013) pp. 8025-8043. https://doi.org/10.1364/OE.21.008025.

      [6] J. Capon, “A probabilistic model for run-length coding of picturesâ€. IRE Transactions on Information Theory, Vol. 100, 157–163. https://doi.org/10.1109/TIT.1959.1057512.

      [7] D. A. Huffman, A Method for the Construction of Minimum-Redundancu Codes, (1952): 1098–1102. https://doi.org/10.1109/JRPROC.1952.273898.

      [8] G. G. Langdon, “An Introduction to Arithmetic Coding. IBM Journal of Research and Developmentâ€, Vol. 2, No.2, pp. 135–149, 1984. https://doi.org/10.1147/rd.282.0135.

      [9] J.Ziv, and A.Lempel, 1978. lz78.pdf. IEEE.

      [10] J.Ziv and A.Lempel. “A Universal Algorithm for Data Compression†IEEE Transactions on Information Theory, Vol. 23, No.3, (1977): 337–343. https://doi.org/10.1109/TIT.1977.1055714.

      [11] T. A. Welch, “A technique for high-Performance Data Compressionâ€, IEEE, (1984): 8–19. https://doi.org/10.1109/MC.1984.1659158.

      [12] M. Burrows and D. Wheeler, “A block-sorting lossless data compression algorithmâ€. Algorithm, Data Compression, No. 124, (1994)18. https://doi.org/10.1.1.37.6774

      [13] J. Schmidhuber and S. Heil, “Sequentail Neural Text Compression. IEEE Transactions on Neural Networksâ€, Vol.7, No.1, (1996):142–146. https://doi.org/10.1109/72.478398.

      [14] A. Moffat, J. Zobel and N.Sharman, “Text compression for dynamic document databasesâ€. IEEE Transactions on Knowledge and Data Engineering, Vol. 9, No.2, (1997) 302–313. https://doi.org/10.1109/69.591454.

      [15] M. Crochemore, F. Mignosi, A.Restivo and S. Salemi, “Data compression using antidictionaries.†In Proceedings of the IEEE, pp. 1756–1768, 2000. https://doi.org/10.1109/5.892711.

      [16] J. Abel and W. Teahan, “Universal text preprocessing for data compressionâ€. IEEE Transactions on Computers, Vol. 54, No.5, (2005):497–507. https://doi.org/10.1109/TC.2005.85.

      [17] J. NoPlatoÅ¡, V. Snášel and E. El-Qawasmeh, “Compression of small text filesâ€. Advanced Engineering Informatics, Vol. 22, No. 3, (2008), pp. 410–417. https://doi.org/10.1016/j.aei.2008.05.001.

      [18] K. Kalajdzic, S. H. Ali and A. Patel, “Rapid lossless compression of short text messagesâ€. Computer Standards & Interfaces, Vol. 37, (2015):53–59. https://doi.org/10.1016/j.csi.2014.05.005.

      [19] L. Robert and R. Nadarajan, “Simple lossless preprocessing algorithms for text compressionâ€. IET Software, Vol. 3, No.1, 2009, pp. 37–45. https://doi.org/10.1049/iet-sen:20070106.

      [20] S. De Agostino, “The greedy approach to dictionary-based static text compression on a distributed systemâ€, Journal of Discrete Algorithms, Vol. 34, (2015): 54–61. https://doi.org/10.1016/j.jda.2015.05.001.

      [21] W. Che, Y. Zhao, H. Guo, Z. Su and T. Liu, “Sentence compression for aspect-based sentiment analysisâ€. IEEE/ACM Transactions on Audio, Speech, and Language Processing, Vol. 23, No.12, (2015), 2111–2124. https://doi.org/10.1109/TASLP.2015.2443982.

      [22] C. Oswald, A. I. Ghosh and B. Sivaselvan, “Knowledge engineering perspective of text compressionâ€. In India Conference (INDICON), pp. 1–6, 2015. https://doi.org/10.1109/INDICON.2015.7443683.

      [23] C. Oswald, I. A. K., J. Avinash and B. Sivaselvan, “A Graph-Based Frequent Sequence Mining Approach to Text Compressionâ€. In International Conference on Mining Intelligence and Knowledge Exploration, pp. 371–380. https://doi.org/10.1007/978-3-319-71928-3_35.

      [24] C. Oswald and B. Sivaselvan, “An optimal text compression algorithm based on frequent pattern miningâ€. J Ambient Intell Human Comput, 1–20.

      [25] Mohamed Elhoseny, K. Shankar, S. K. Lakshmanaprabu, Andino Maseleno, N. Arunkumar. Hybrid optimization with cryptography encryption for medical image security in Internet of Things. Neural Computing and Applications. 2018. https://doi.org/10.1007/s00521-018-3801-x.

      [26] K. Shankar, Mohamed Elhoseny, E. Dhiravida chelvi, SK. Lakshmanaprabu, Wanqing Wu. An Efficient Optimal Key Based Chaos Function for Medical Image Security. IEEE Access. 2018. https://doi.org/10.1109/ACCESS.2018.2874026.

      [27] T. Avudaiappan, R. Balasubramanian, S. Sundara Pandiyan, M. Saravanan, S. K. Lakshmanaprabu, K. Shankar, “Medical Image Security Using Dual Encryption with Oppositional Based Optimization Algorithmâ€, Journal of Medical Systems, 42.11 (2018) 1-11. https://doi.org/10.1007/s10916-018-1053-z.

      [28] K.Shankar and P.Eswaran. “RGB Based Multiple Share Creation in Visual Cryptography with Aid of Elliptic Curve Cryptographyâ€, China Communications, 14. 2 (2017): 118-130. https://doi.org/10.1109/CC.2017.7868160.

      [29] K.Shankar and P.Eswaran. “RGB Based Secure Share Creation in Visual Cryptography Using Optimal Elliptic Curve Cryptography Techniqueâ€, Journal of Circuits, Systems, and Computers, 25.11 (2016) : 1650138-1 to 23. https://doi.org/10.1142/S0218126616501383.

      [30] Nur Aminudin, Andino Maseleno, K. Shankar, S. Hemalatha, K. Sathesh kumar, Fauzi, Rita Irviani, Muhamad Muslihudin, “Nur Algorithm on Data Encryption and Decryptionâ€, International Journal of Engineering & Technology, 7. 2.26 (2018): 109-118. https://doi.org/10.14419/ijet.v7i2.27.11574.

      [31] K. Shankar, Lakshmanaprabu S. K, “Optimal key based homomorphic encryption for color image security aid of ant lion optimization algorithmâ€, International Journal of Engineering & Technology, 7. 9 (2018) : 22-27. https://doi.org/10.14419/ijet.v7i1.9.9729.

      [32] K. Sathesh Kumar, K. Shankar, M. Ilayaraja, M. Rajesh, “Sensitive Data Security in Cloud Computing Aid of Different Encryption Techniquesâ€, Journal of Advanced Research in Dynamical and Control Systems, 9. 18 (2017): 2888-2899.

      [33] K. Shankar and P.Eswaran. “An Efficient Image Encryption Technique Based on Optimized Key Generation in ECC Using Genetic Algorithmâ€, Advances in Intelligent Systems and Computing, Springer, 394 (2016): 705-714. https://doi.org/10.1007/978-81-322-2656-7_64.

      [34] K. Shankar and P.Eswaran. “A Secure Visual Secret Share (VSS) Creation Scheme in Visual Cryptography using Elliptic Curve Cryptography with Optimization Techniqueâ€. Australian Journal of Basic and Applied Sciences. 9. 36 (2015): 150-163.

      [35] K. Shankar and P.Eswaran. “ECC Based Image Encryption Scheme with aid of Optimization Technique using Differential Evolution Algorithmâ€, International Journal of Applied Engineering Research, 10. 5 (2015): 1841–184.

  • Downloads

  • How to Cite

    Paul Alapatt, B., & Kavitha, A. (2019). Bounded probability based textual data compression for fiber-optic communication. International Journal of Engineering & Technology, 7(4), 5844-5850. https://doi.org/10.14419/ijet.v7i4.14873