redundant residue number system
Recently Published Documents


TOTAL DOCUMENTS

48
(FIVE YEARS 9)

H-INDEX

7
(FIVE YEARS 0)

Author(s):  
Arnold Mashud Abukari ◽  
Edem Kwedzo Bankas ◽  
Mohammed Muniru Iddrisu

In this research paper, a Redundant Residue Number System (n,k) code is introduced to enhance Cloud ERP Data storage. The research findings have been able to demonstrate the application  of Redundant Residue Number System (RRNS) in the concept of Cloud ERP Data storage. The scheme contributed in addressing data loss challenges during data transmission. The proposed scheme also addressed and improved the probability of failure to access data compared to other existing systems. The proposed scheme adopted the concept of Homomorphic encryption and secret sharing whiles applying Redundant Residue Number System to detect and correct errors.The moduli set used is {2m, 2m + 1, 2m+1 - 1, 2m+1 + 1, 2m+1 + k, 22m - k, 22m + 1} where k is the number of the information moduli set used. The information moduli set is {2m, 2m + 1, 2m+1 - 1} and the redundant moduli is {2m+1 + 1, 2m+1 + k, 22m - k, 22m + 1}. The proposed scheme per the simulation results using python reveals that it performs far better in terms of data loss and failure to access data related concerns. The proposed scheme performed better between 41.2% for data loss to about 99% for data access based on the combination of (2, 4) and (2, 5) data shares respectively in a (k, n) settings.


Author(s):  
Hsiao-Wen Fu ◽  
Ting-Yu Chen ◽  
Cheng-Di Tsai ◽  
Meng-Wei Shen ◽  
Tsung-Chu Huang

2020 ◽  
Vol 21 (2) ◽  
Author(s):  
Mikhail Selianinau

The Chinese Remainder Theorem (CRT) widely used in many modern computer applications. This paper presents an efficient approach to the calculation of the rank of a number, a principal positional characteristic used in the Residue Number System (RNS). The proposed method does not use large modulo addition operations compared to a straightforward implementation of the CRT algorithm. The rank of a number is equal to a sum of an inexact rank and a two-valued correction factor that only takes on the values 0 or 1. We propose a minimally redundant RNS, which provides low computational complexity of the rank calculation. The effectiveness of the novel method is analyzed concerning conventional non-redundant RNS. Owing to the extension of the residue code, by adding the extra residue modulo 2, the complexity of rank calculation goes down from \(O(k^2)\) to \(O(k)\), where \(k\) equals the number of residues in non-redundant RNS.


Author(s):  
Peter Awon-natemi Agbedemnab ◽  
Edward Yellakuor Baagyere ◽  
Mohammed Ibrahim Daabo

The possibility of errors being propagated during the encoding process of cryptographic and steganographic schemes is real due to the introduction of noise by ciphering the data from stage to stage. This real possibility therefore requires that an efficient scheme is proposed such that if after the decoding process the accurate information is not discovered, then it can be employed to detect and correct any errors in the system. The Residue Number System (RNS) by its nature is fault tolerant since an error in one digit position does not affect other digit positions; but the Redundant Residue Number System (RRNS) had been used over the years to effectively detect and correct errors. In this paper, we propose an efficient scheme that can detect and correct both single and multiple errors after and/or during computation and/or transmission provided the redundant moduli are sufficient enough. A theoretical analysis of the performance of the proposed scheme show it will be a better choice for detecting and correcting computational and transmission errors to existing similar state-of-the-art schemes.


2020 ◽  
Vol 30 (3) ◽  
pp. 177-192
Author(s):  
Muhammad Tahir Naseem ◽  
Ijaz Mansoor Qureshi ◽  
Atta-ur-Rahman ◽  
Muhammad Zeeshan Muzaffar

Author(s):  
M. I. Youssef ◽  
A. E. Emam ◽  
M. Abd Elghany

Telecommunication industry requires high capacity networks with high data rates which are achieved through utilization of Multiple-Input-Multiple-Output (MIMO) communication along with Orthogonal Frequency Division Multiplexing (OFDM) system. Still, the communication channel suffers from noise, interference or distortion due to hardware design limitations, and channel environment, and to combat these challenges, and achieve enhanced performance; various error control techniques are implemented to enable the receiver to detect any possible received errors and correct it and thus; for a certain transmitted signal power the system would have lower Bit Error Rate (BER). The provided research focuses on Redundant Residue Number System (RRNS) coding as a Forward Error Correction (FEC) scheme that improves the performance of MIMO-OFDM based wireless communications in comparison with current methods as Low-Density Parity Check (LDPC) coders at the transmitter side or equalizers at receiver side. The Bit Error Rate (BER) performance over the system was measured using MATLAB tool for different simulated channel conditions, including the effect of signal amplitude reduction and multipath delay spreading. Simulation results had shown that RRNS coding scheme provides an enhancement in system performance over conventional error detection and correction coding schemes by utilizing the distinct features of Residue Number System (RNS).


Sign in / Sign up

Export Citation Format

Share Document