An Efficient CRT Based Reverse Converter for {22n+1-1, 2n-1, 22n-1} Moduli Set
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 25, Issue 6
Abstract
This paper presents a reverse converter for the moduli set {22n+1-1, 2n-1, 22n-1} using a Chinese Remainder Theorem (CRT) algorithm and reverse method of data conversion. We compare our result with other converters found in literature that have the same Dynamic Range (DR) and our proposed algorithm has a better performance in terms of speed. Aims: The aim of this study is to design a reverse converter for the moduli set {22n+1-1, 2n-1, 22n-1}, determine the speed and compare it with other moduli set with the same DR in literature. Methodology: We applied Chinese Reminder Theorem algorithm for data conversion.
Authors and Affiliations
Hassan Kehinde Bello, Kazeem Alagbe Gbolagade
Keywords
Related Articles
- EP ID EP322513
- DOI 10.9734/JAMCS/2017/38517
- Views 96
- Downloads 0
Empirical Performance of Internal Sorting Algorithm
Internal Sorting Algorithms are used when the list of records is small enough to be maintained entirely in primary memory for the duration of the sort, while External Sorting Algorithms are used when the list of records...
Triple-Protocol – A New Direction of Elliptic-Curve Cryptography
The original triple-protocol is proposed, which is a modification of the well-known Massey - Omura protocol, but greatly improves it from the standpoint of efficiency and enables data to be validated for integrity and au...
Experimental Study on Class Imbalance Problem Using an Oil Spill Training Data Set
There is a paucity of research on one of the key issues in oil spill detection: the imbalanced training set learning problem. This paper performs experiments to show the influence of the imbalanced learning problem (ILP)...
Convergence of Differential Transform Method for Ordinary Differential Equations
Differential transform method (DTM) as a method for approximating solutions to differential equations have many theorems that are often used without recourse to their proofs. In this paper, attempts are made to compile t...
On a Discrete Time Semi-Markov Risk Model with Dividends and Stochastic Premiums
A discrete semi-Markov risk model with dividends and stochastic premiums is investigated. We derive recursive equations for the expected penalty function by using the technique of probability generating function. Finally...