An Efficient Parallel Reverse Conversion of Residue Code to Mixed-Radix Representation Based on the Chinese Remainder Theorem
In this paper, we deal with the critical problems in residue arithmetic. The reverse conversion from a Residue Number System (RNS) to positional notation is a main non-modular operation, and it constitutes a basis of other non-modular procedures used to implement various computational algorithms. We...
Main Authors: | Mikhail Selianinau, Yuriy Povstenko |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-02-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/24/2/242 |
Similar Items
-
An Efficient CRT-Base Power-of-Two Scaling in Minimally Redundant Residue Number System
by: Mikhail Selianinau, et al.
Published: (2022-12-01) -
Scaling function based on Chinese remainder theorem applied to a recursive filter design
by: Stamenković Negovan, et al.
Published: (2014-01-01) -
Performance Analysis of Hardware Implementations of Reverse Conversion from the Residue Number System
by: Viktor Kuchukov, et al.
Published: (2022-12-01) -
Secure Data Aggregation in Wireless Sensor Network using Chinese Remainder Theorem
by: Sanu Thomas, et al.
Published: (2022-06-01) -
Some Tauberian Remainder Theorems for Holder Summability
by: Umit Totur, et al.
Published: (2015-03-01)