Abstract
In this paper we present an RNS algorithm and architecture implementation of gene sequence applications based on an existing RNS arithmetic algorithm. Investigation was made on RNS application and its inherent arithmetic advantages; data conversion algorithm from Decimal/Binary to RNS; the forward conversion; Conversion from RNS to Binary/Decimal; the reverse conversion using the Chinese remainder theorem CRT, conversion from RNS to mixed radix form with capability for effective computation performance, and analysis of Smith Waterman Algorithm based on DNA sequence computing. Its limitations and open issues for future research were highlighted.
Keywords:
Residue number system, SWA, DNA, Bioinformatics, CRT, MRC, Moduli set
References
• C. N. Zhang, B. Shirazi, and D. Y. Y. Yun, [1993] “An efficient algorithm and parallel implementations for binary and residue number systems,” Journal of Symbolic Computation 15(4), pp. 451–462.
• Bin Cao, Chip-Hong Chang, S.Thambipillai. [1994] "Design of residue generators and multi operand modulo adders using carry-save Adders,"IEEE Trans. Comp., vol. 43, pp.68-77.
• A.B.Premkumar, [2013] "Improved memory less RNS forward converter based on periodicity of residues” IEEE Trans. Circuits and Systems-II, express Briefs, vol. 53, no.2,5 .
• Hassan Kehinde Bello and Kazeem Alagbe Gbolagade. [2017] “A Survey of Human Deoxyribonucleic Acid” British Journal of Applied Science & Technology. 21(5): 1-10.
• K.A Gbolagade, R. Chares, L. Sousa, S.D Cotofana. [2009] “Residue –to- binary converters for the {22n+1-1, 22n, 2n-1} moduli set. 2nd IEEE international conference in adaptive science & technology. Pp 26 – 33.
• R. Conway and J. Nelson, [2003] “New CRT-based RNS converter using restricted moduli set,” IEEE Transactions on Computers 52(5), pp. 572–578.
• C. Y. Hung and B. Parhami, [1994] “An approximate sign detection method for residue numbers and its application to RNS division,” Computers and Mathematics with Applications 27, pp. 23–35.
• Mansoureh and Mohammed [2012]. Non iterative RNS division Algorithm, IMECS Vol. I. ISSN;2078-0966 online
• K.A. Gbolagade [2009c]. “A shorter algorithm for efficient residue to decimal conversion”. Advances in computer Science and Engineering, 3(2), pp. 147-156.
• K.A. Gbolagade [2011]. New adder-base RNS-to-binary converters for the {2n-1+1,2n-1-1,2n}modoli set. ISRN Signal Processing. Journal, 7, 1-7.
• K.A. Gbolagade [2013] An efficient MRC base RNS-to-binary converters for the {22n-1,2n, 22n+1-1 }modoli set. International Journal of Advance Research in Computer Engineering and Technology.2 (10) pp,2661-2664.
• A.S. Madhu kumar,., and F. Chin, [2002], “Performance of a Residue Number system based CDMA system over wireless personal communication”, Springer. Netherlands, Vol. 22, No. 1, pp. 89 – 102.
• F. J. Taylor, [1990],“An RNS Discrete Fourier Transform implementation,”IEEE Trans. Acoust. Speech, Signal Process, Vol. 38, No. 8. Pp. 1386 – 1394.
• B. Parhami and H.F. Lai [1993] “Alternate Memory Compression Schemes for modular Multiplication “IEEE Trans. Signal Processing Vol. 41, pp.1378-1385.
• Dan Gasified, [1997]. Algorithms on Strings. Trees and Sequences: Computer Science and Computational Biology Cambridge University Press.
Downloads
Download data is not yet available.
