MODIFIED MODULUS PROJECTION ALGORITHM FOR ERROR CONTROL IN REDUNDANT RESIDUE NUMBER SYSTEM CODE

2017 ◽  
Vol 15 (1) ◽  
pp. 130-142
Author(s):  
K A AMUSA ◽  
O O NUGA
Keyword(s):  
Error Control ◽  
Recovery Process ◽  
Number System ◽  
Residue Number System ◽  
Block Codes ◽  
Projection Algorithm ◽  
Speed Up ◽  
Redundant Residue Number System ◽  
Error Detecting ◽  
Maximum Minimum

This paper presents a modified modulus projection algorithm for decoding Redundant Residue Num-ber System (RRNS) codes. RRNS code is maximum-minimum distance block codes. RRNS has found wider applications in the field of signal processing especially for error control. The essence of this modification is to reduce the required computation overhead and speed up operation. The proposed method involves conversion of received residues into mixed radix form. Based on the error detecting capability of RRNS code under study, moduli projection is carried out iteratively to determine the corre-sponding integers. The proposed algorithm considerably reduces the number of required iterations involved in the recovery process, therefore improving the speed of decoding operation.

Perspective and Opportunities of Modulo 2n−1 Multipliers in Residue Number System: A Review

2020 ◽  
Vol 29 (11) ◽  
pp. 2030008
Author(s):  
Raj Kumar ◽  
Ritesh Kumar Jaiswal ◽  
Ram Awadh Mishra
Keyword(s):  
Word Length ◽  
Dynamic Range ◽  
High Dynamic Range ◽  
Number System ◽  
Residue Number System ◽  
System A ◽  
Essential Components ◽  
Residue Number ◽  
Speed Up ◽  
Computational Circuits

Modulo multiplier has been attracting considerable attention as one of the essential components of residue number system (RNS)-based computational circuits. This paper contributes a comprehensive review in the design of modulo [Formula: see text] multipliers for the first time. The modulo multipliers can be implemented using ROM (look-up-table) as well as VLSI components (memoryless); however, the former is preferable for lower word-length and later for larger word-length. The modular and parallelism properties of RNS are used to improve the performance of memoryless multipliers. Moreover, a Booth-encoding algorithm is used to speed-up the multipliers. Also, an advanced modulo [Formula: see text] multiplier based on redundant RNS (RRNS) could be further chosen for very high dynamic range. These perspectives of modulo [Formula: see text] multipliers have been extensively studied for recent state-of-the-art and analyzed using Synopsis design compiler tool.

Sign in / Sign up

Export Citation Format

Share Document