RNS Based on Shannon Fano Coding for Data Encoding and Decoding Using {2n-1, 2n, 2n+1} Moduli Sets
Volume 6, Issue 1, March 2018, Pages: 25-29
Received: Jan. 23, 2018; Accepted: Feb. 1, 2018; Published: Mar. 16, 2018
Views 1545      Downloads 185
Idris Abiodun Aremu, Computer Science Department, Lagos State Polytechnics, Lagos, Nigeria
Kazeem Alagbe Gbolagade, Department of Computer Science, Kwara State University, Kwara, Nigeria
Article Tools
Follow on us
The main objective of any communication system is to transmit data with minimum error rate in data communication. This paper presents information encryption and decryption in data communication with Shannon fano compression techniques using Residue Number System (RNS). The current network communication system involves exchange of information with highly secured data and reduction in both the space requirement and speed for data storage and transmission. For this purpose error detection and correction techniques are used, Our proposed scheme uses the Chinese Remainder Theorem (CRT) which are smaller and needs to be performed in parallel, therefore from the first decoding we can easily identify if error is in a channel. The algorithm applies CRT to detect, locate and correct error by eliminating look up table, therefore the scheme provides a memory less based scheme. It uses a pipelining approach to breakdown the problem with a level of complexity O(n) after decoding and performing consistent checks on all the residue, therefore the overall delay will be lesser and efficient.
Shannon Fano, Residue Number System, Forward Conversion, Information Encryption and Decryption, Mixed Radix Conversion
To cite this article
Idris Abiodun Aremu, Kazeem Alagbe Gbolagade, RNS Based on Shannon Fano Coding for Data Encoding and Decoding Using {2n-1, 2n, 2n+1} Moduli Sets, Communications. Vol. 6, No. 1, 2018, pp. 25-29. doi: 10.11648/j.com.20180601.15
Copyright © 2018 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Diffie, W., & Hellman, M. (1976). New directions in cryptography. IEEE transactions on Information Theory, 22(6), 644-654.
Stallings, W. (2006). Cryptography and network security: principles and practices. Pearson Education India.
Alvarez, G., & Li, S. (2006). Some basic cryptographic requirements for chaos-based cryptosystems. International Journal of Bifurcation and Chaos, 16(08), 2129-215.
Zissis, D., &Lekkas, D. (2012). Addressing cloud computing security issues. Future Generation computer systems, 28(3), 583-592.
Reghbati, H. K. (1981). Special feature an overview of data compression techniques. Computer, 14(4), 71-75.
Lelewer, D. A., & Hirschberg, D. S. (1987). Data compression. ACM Computing Surveys (CSUR), 19(3), 261-296.
Parhami, B. (1999). Computer arithmetic (Vol. 20, No. 00). Oxford university press.
Gbolagade, K. A., Chaves, R., Sousa, L., & Cotofana, S. D. (2010, May). An improved RNS reverse converter for the {2 2n+1−1, 2n, 2n−1} moduli set. In Circuits and Systems (ISCAS), Proceedings of 2010 IEEE International Symposium on (pp. 2103-2106). IEEE.
Alhassan, A., Saeed, I., & Agbedemnab, P. A. (2015). The Huffman’s Method of Secured Data Encoding and Error Correction using Residue Number System (RNS). Communication on Applied Electronics (CAE) Journal, Foundation of Computer Science (FCS), New York, USA.
Shannon, C. E. (2001). A mathematical theory of communication. ACM SIGMOBILE Mobile Computing and Communications Review, 5(1), 3-55.8.
Chanhemo, W., Mgombelo, H. R., Hamad, O. F., &Marwala, T. (2011). Design of Encoding Calculator Software for Huffman and Shannon-Fano Algorithms. World Academy of Science, Engineering and Technology, International Journal of Computer, Electrical, Automation, Control and Information Engineering, 5(3), 267-273.
Omondi, A. R., & Premkumar, B. (2007). Residue number systems: theory and implementation (Vol. 2). World Scientific. Huffman, D. A., 1952. A method for the Construction of Minimum-redundancy Code. Proceedings of the Institute of Radio Engineers, 40(9): 1098-1101.
Science Publishing Group
1 Rockefeller Plaza,
10th and 11th Floors,
New York, NY 10020
Tel: (001)347-983-5186