On the public citation graph

Residue Number Systems

0 signed · 257 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781119206804.ch1openalex-snapshot
Basic Arithmetic Circuits
inferred← citeshttps://doi.org/10.1002/9781119206804.ch6openalex-snapshot
RNS‐Based Arithmetic Circuits and Applications
inferred← citeshttps://doi.org/10.1002/9781119206804.ch8openalex-snapshot
Redundant Number System‐Based Arithmetic Circuits
inferred← citeshttps://doi.org/10.1007/978-1-4614-6859-2_19openalex-snapshot
Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-030-03314-9_26openalex-snapshot
Secure Generators of q-Valued Pseudo-random Sequences on Arithmetic Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-030-05807-4_53openalex-snapshot
Residue Logarithmic Coprocessor for Mass Arithmetic Computations
inferred← citeshttps://doi.org/10.1007/978-3-030-20323-8_11openalex-snapshot
Efficient Hardware Operations for the Residue Number System by Boolean Minimization
inferred← citeshttps://doi.org/10.1007/978-3-030-25636-4_14openalex-snapshot
Multiple-Precision Scaled Vector Addition on Graphics Processing Unit
inferred← citeshttps://doi.org/10.1007/978-3-030-34142-8_2openalex-snapshot
Mathematical Fundamentals I: Number Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-36592-9_2openalex-snapshot
Data-Parallel High-Precision Multiplication on Graphics Processing Units
inferred← citeshttps://doi.org/10.1007/978-3-030-51974-2_38openalex-snapshot
Application of Correcting Polynomial Modular Codes in Infotelecommunication Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-63270-0_43openalex-snapshot
Theoretical Bases for Reducing the Time Complexity of the Rabin Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-030-64616-5_4openalex-snapshot
Multiple-Precision BLAS Library for Graphics Processing Units
inferred← citeshttps://doi.org/10.1007/978-3-030-66288-2_8openalex-snapshot
Improved Cloud-Based N-Primes Model for Symmetric-Based Fully Homomorphic Encryption Using Residue Number System
inferred← citeshttps://doi.org/10.1007/978-3-030-70783-5_5openalex-snapshot
Examples of Using Models and Measures on the Circle
inferred← citeshttps://doi.org/10.1007/978-3-030-71119-1_64openalex-snapshot
Using Redundant Modular Codes of the Residual Number System for Error Detection and Correction
inferred← citeshttps://doi.org/10.1007/978-3-030-78759-2_28openalex-snapshot
Computing the Sparse Matrix-Vector Product in High-Precision Arithmetic for GPU Architectures
inferred← citeshttps://doi.org/10.1007/978-3-030-81523-3_24openalex-snapshot
Some Principles of Building Steganographic Communication Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-92864-3_12openalex-snapshot
JAD-Based SpMV Kernels Using Multiple-Precision Libraries for GPUs
inferred← citeshttps://doi.org/10.1007/978-3-031-28916-3_8openalex-snapshot
Two-Operand Modular Multiplication to Small Bit Ranges
inferred← citeshttps://doi.org/10.1007/978-3-031-34127-4_33openalex-snapshot
Modulo 2k + 1 Truncated Multiply-Accumulate Unit
inferred← citeshttps://doi.org/10.1007/978-3-031-34127-4_4openalex-snapshot
RNS Reverse Conversion Algorithm and Parity Detection for the Wide Arbitrary Moduli Set
inferred← citeshttps://doi.org/10.1007/978-3-031-94280-8_6openalex-snapshot
Enhanced RNS Performance Through Strategic Use of Conjugate Moduli Sets
inferred← citeshttps://doi.org/10.1007/978-3-032-01831-1_12openalex-snapshot
Residue Number System Division Based on Inverse Conversion and Akushsky Core Function
inferred← citeshttps://doi.org/10.1007/978-3-319-08302-5_14openalex-snapshot
Practical Analysis of RSA Countermeasures Against Side-Channel Electromagnetic Attacks
inferred← citeshttps://doi.org/10.1007/978-3-319-15147-2_24openalex-snapshot
Secure Pseudo-Random Linear Binary Sequences Generators Based on Arithmetic Polynoms
inferred← citeshttps://doi.org/10.1007/978-3-319-21909-7_5openalex-snapshot
A Modular-Positional Computation Technique for Multiple-Precision Floating-Point Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-319-33816-3_1openalex-snapshot
The Data Transfer Development in MANET Networks on the Base of Chinese Remainder Theorem
inferred← citeshttps://doi.org/10.1007/978-3-319-41385-3_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-319-49742-6_1openalex-snapshot
Introduction to Residue Number System: Structure and Teaching Methodology
inferred← citeshttps://doi.org/10.1007/978-3-319-65636-6_30openalex-snapshot
Evaluation of Pseudorandom Number Generators Based on Residue Arithmetic in Differential Evolution
inferred← citeshttps://doi.org/10.1007/978-3-319-65636-6_5openalex-snapshot
Space-Filling Curves based on Residue Number System
inferred← citeshttps://doi.org/10.1007/978-3-319-66604-4_4openalex-snapshot
Implementation of a Gate Neural Network Based on Combinatorial Logic Elements
inferred← citeshttps://doi.org/10.1007/978-3-319-91734-4_11openalex-snapshot
Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-642-31600-5_63openalex-snapshot
A Scheme for Improving Bit Efficiency for Residue Number System
inferred← citeshttps://doi.org/10.1007/978-981-15-8289-9_58openalex-snapshot
Implementation of Arithmetic Unit for RNS Using 2n + 3 as Base
inferred← citeshttps://doi.org/10.1007/978-981-19-4960-9_2openalex-snapshot
Efficient RNS Realization of High-Speed Arithmetic Multiplier with Respect to Cryptographic Computation
inferred← citeshttps://doi.org/10.1007/s00034-014-9798-1openalex-snapshot
Efficient Reverse Converters for 4-Moduli Sets {2 $$^{2n-1}-1$$ 2 n - 1 - 1 , 2 $$^{n}$$ n , 2 $$^{n}+1$$ n + 1 , 2 $$^{n}-1$$ n - 1 } and {2 $$^{2n-1}$$ 2 n - 1 , 2 $$^{2n-1}-1$$ 2 n - 1 - 1 , 2 $$^{n}+1$$ n + 1 , 2 $$^{n}-1$$ n - 1 } Based on CRTs Algorithm
inferred← citeshttps://doi.org/10.1007/s00034-015-0090-9openalex-snapshot
RNS to Binary Conversion Using Diagonal Function and Pirlo and Impedovo Monotonic Function
inferred← citeshttps://doi.org/10.1007/s00034-015-0193-3openalex-snapshot
Co-prime Sensing-Based Frequency Estimation Using Reduced Single-Tone Snapshots
inferred← citeshttps://doi.org/10.1007/s00034-016-0440-2openalex-snapshot
Reverse Conversion Using Core Function, CRT and Mixed Radix Conversion
inferred← citeshttps://doi.org/10.1007/s00034-017-0725-0openalex-snapshot
Reverse Converters for the Moduli Set { $$2^{n}, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}(n\,\hbox {Even})$$ 2 n , 2 n - 1 - 1 , 2 n - 1 , 2 n + 1 - 1 } ( n Even )
inferred← citeshttps://doi.org/10.1007/s00034-021-01743-4openalex-snapshot
A New High-Speed, Low-Area Residue-to-Binary Converter For the Moduli Set $$\{ 2^{4n} ,2^{2n} + 1,2^{n} + 1,2^{n} - 1\}$$ Based on CRT-1
inferred← citeshttps://doi.org/10.1007/s00200-015-0268-1openalex-snapshot
Modular multiplication using the core function in the residue number system
inferred← citeshttps://doi.org/10.1007/s00224-021-10035-yopenalex-snapshot
Computationally Efficient Approach to Implementation of the Chinese Remainder Theorem Algorithm in Minimally Redundant Residue Number System
inferred← citeshttps://doi.org/10.1007/s10470-020-01749-zopenalex-snapshot
Efficient two-level reverse converters for the four-moduli set {2n−1, 2n–1, 2n−1–1, 2n+1–1}
inferred← citeshttps://doi.org/10.1007/s10559-014-9689-2openalex-snapshot
An Approximate Method for Comparing Modular Numbers and its Application to the Division of Numbers in Residue Number Systems*
inferred← citeshttps://doi.org/10.1007/s10559-026-00860-9openalex-snapshot
Method and Algorithm for Interbase Conversion of Rademacher Binary Codes into Christensen Residue Codes
inferred← citeshttps://doi.org/10.1007/s11227-026-08330-xopenalex-snapshot
Efficient neural network acceleration using redundant residue number systems
inferred← citeshttps://doi.org/10.1007/s11227-026-08842-6openalex-snapshot
A novel FPGA-based mixed garbled circuit hardware accelerator (MixGCAcc)
inferred← citeshttps://doi.org/10.1007/s11265-010-0552-zopenalex-snapshot
CSD-RNS-based Single Constant Multipliers
inferred← citeshttps://doi.org/10.1007/s11265-017-1238-6openalex-snapshot
Design of RNS Reverse Converters with Constant Shifting to Residue Datapath Channels
inferred← citeshttps://doi.org/10.1007/s11760-021-02097-9openalex-snapshot
Efficient variable-coefficient RNS-FIR filters with no restriction on the moduli set
inferred← citeshttps://doi.org/10.1007/s12046-019-1078-0openalex-snapshot
Novel RNS-to-binary converters for the three-moduli set {2m − 1, 2m, 2m + 1}
inferred← citeshttps://doi.org/10.1007/s12046-023-02118-yopenalex-snapshot
Residue to binary converter for the extended four moduli set {2k, 2n−1, 2n+1, 2n+1+1} for n odd
inferred← citeshttps://doi.org/10.1007/s42452-020-2040-9openalex-snapshot
Fast and energy-efficient FPGA realization of RNS reverse converter for the ternary 3-moduli set {3n–2, 3n–1, 3n}
inferred← citeshttps://doi.org/10.1007/s42979-023-02297-9openalex-snapshot
Efficient Neuroimaging Data Security and Encryption Using Pixel-Based Homomorphic Residue Number System
inferred← citeshttps://doi.org/10.1016/j.vlsi.2015.12.006openalex-snapshot
Power-performance enhancement of two-dimensional RNS-based DWT image processor using static voltage scaling
inferred← citeshttps://doi.org/10.1021/acsphotonics.3c01704openalex-snapshot
Photonics Multiply-Accumulation Computations System Based on Residue Arithmetic
inferred← citeshttps://doi.org/10.1049/cdt2.12001openalex-snapshot
A radix‐8 modulo 2 n multiplier using area and power‐optimized hard multiple generator
inferred← citeshttps://doi.org/10.1049/el:20092067openalex-snapshot
Shifter circuits for {2 n +1, 2 n , 2 n −1} RNS
inferred← citeshttps://doi.org/10.1049/iet-cds.2009.0129openalex-snapshot
Reduced complexity analogue-to-residue conversion employing folding number system
inferred← citeshttps://doi.org/10.1049/iet-cds:20070235openalex-snapshot
Double-least-significant-bits 2's-complement number representation scheme with bitwise complementation and symmetric range
inferred← citeshttps://doi.org/10.1049/iet-cdt.2012.0148openalex-snapshot
A ROM‐less reverse RNS converter for moduli set {2 q ± 1, 2 q ± 3}
inferred← citeshttps://doi.org/10.1049/iet-cdt.2015.0050openalex-snapshot
Fast sign‐detection algorithm for residue number system moduli set {2 n − 1, 2 n , 2 n +1 − 1}
inferred← citeshttps://doi.org/10.1051/itmconf/20171004004openalex-snapshot
Organization of Secured Data Transfer in Computers Using Sign-Value Notation
inferred← citeshttps://doi.org/10.1063/5.0125067openalex-snapshot
Application of modular turbo codes in authentication systems
inferred← citeshttps://doi.org/10.1080/00207160.2016.1247439openalex-snapshot
Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem
inferred← citeshttps://doi.org/10.1080/00207217.2015.1020528openalex-snapshot
Efficient architectures for modulo 2n − 2 arithmetic units
inferred← citeshttps://doi.org/10.1080/00207217.2016.1253781openalex-snapshot
CNTFET-based design of multi-bit adder circuits
inferred← citeshttps://doi.org/10.1080/03772063.2024.2352147openalex-snapshot
Adder-Only Reverse Converters for 5-Moduli Set {2 q , 2 q − 1, 2 q +1 ± 1, 2 q +2 − 1}
inferred← citeshttps://doi.org/10.1080/09747338.2015.1115378openalex-snapshot
Reverse Converters for the Moduli Set {2n+1−3, 2n−1, 2n−1−1}
inferred← citeshttps://doi.org/10.1080/09747338.2017.1317040openalex-snapshot
RNS-to-Binary Converters for a Three-Moduli Set {2n−1 − 1, 2n − 1, 2n+k}
inferred← citeshttps://doi.org/10.1109/access.2016.2599269openalex-snapshot
New Residue Arithmetic Based Barrett Algorithms: Modular Integer Computations
inferred← citeshttps://doi.org/10.1109/access.2020.2982365openalex-snapshot
Using Floating-Point Intervals for Non-Modular Computations in Residue Number System
inferred← citeshttps://doi.org/10.1109/acit69831.2026.11699962openalex-snapshot
A Multilevel Encryption Method in a Polynomial Residual Number System
inferred← citeshttps://doi.org/10.1109/acssc.2009.5470206openalex-snapshot
Digital/analog arithmetic with continuous-valued residues
inferred← citeshttps://doi.org/10.1109/acssc.2010.5757827openalex-snapshot
On equivalences and fair comparisons among residue number systems with special moduli
inferred← citeshttps://doi.org/10.1109/acssc.2011.6189975openalex-snapshot
On building general modular adders from standard binary arithmetic components
inferred← citeshttps://doi.org/10.1109/acssc.2012.6489265openalex-snapshot
Residue codes for error correction in a combined decimal/binary redundant floating point adder
inferred← citeshttps://doi.org/10.1109/arith.2009.14openalex-snapshot
Unified Approach to the Design of Modulo-(2^n +/- 1) Adders Based on Signed-LSB Representation of Residues
inferred← citeshttps://doi.org/10.1109/asap.2013.6567565openalex-snapshot
A compact and scalable RNS architecture
inferred← citeshttps://doi.org/10.1109/asap.2013.6567567openalex-snapshot
An effective New CRT based reverse converter for a novel moduli set {22n+1 − 1, 22n+1, 22n − 1}
inferred← citeshttps://doi.org/10.1109/ccoms.2018.8463305openalex-snapshot
Alternative Redundant Residue Number System Construction with Redundant Residue Representations
inferred← citeshttps://doi.org/10.1109/ccube53681.2021.9702727openalex-snapshot
Design of multipliers for moduli$({2^{4k}} + {2^{2k + 1}} - {2^{3k + 1}} - {2^k} + 1)$ and $({2^{4k}} - {2^{3k + 1}} + {2^k} - 1)$
inferred← citeshttps://doi.org/10.1109/cesys.2016.7889984openalex-snapshot
Image encryption and decryption in RNS domain based on {2n, 22n+1-1, 2n+1, 2n-1} moduli set
inferred← citeshttps://doi.org/10.1109/cicc.2014.6946004openalex-snapshot
A 9-bit 215-MS/s folding-flash time-to-digital converter based on redundant remainder number system
inferred← citeshttps://doi.org/10.1109/cise.2010.5676912openalex-snapshot
Optimizing the Improved Barrett Modular Multipliers for Public-Key Cryptography
inferred← citeshttps://doi.org/10.1109/cises58720.2023.10183474openalex-snapshot
A Fast RNS Processor for Moduli Set {2n+1, 2n, 2n-1}
inferred← citeshttps://doi.org/10.1109/csit56902.2022.10000513openalex-snapshot
Recovering From a Failure and Improving the Checkability of Iterative Array Dividers
inferred← citeshttps://doi.org/10.1109/dasip.2010.5706242openalex-snapshot
A new single-error correction scheme based on self-diagnosis residue number arithmetic
inferred← citeshttps://doi.org/10.1109/dcabes.2012.100openalex-snapshot
Residue Signed-Digit Arithmetic and the Conversions between Residue and Binary Numbers for a Four-Moduli Set
inferred← citeshttps://doi.org/10.1109/dipdmwc.2016.7529375openalex-snapshot
High-speed smoothing filter in the Residue Number System
inferred← citeshttps://doi.org/10.1109/dsd.2008.25openalex-snapshot
On the Complexity of Error Detection Functions for Redundant Residue Number Systems
inferred← citeshttps://doi.org/10.1109/dsd.2009.175openalex-snapshot
Combined SD-RNS Constant Multiplication
inferred← citeshttps://doi.org/10.1109/dsd.2010.25openalex-snapshot
Area-Efficient Multi-moduli Squarers for RNS
inferred← citeshttps://doi.org/10.1109/dsd.2010.77openalex-snapshot
Arithmetic Units for RNS Moduli {2n-3} and {2n+3} Operations
inferred← citeshttps://doi.org/10.1109/dsd.2011.64openalex-snapshot
On the Design of Modulo 2^n+1 Multipliers
inferred← citeshttps://doi.org/10.1109/dsd.2011.65openalex-snapshot
Binary-to-RNS Conversion Units for moduli {2^n ± 3}
inferred← citeshttps://doi.org/10.1109/dsd.2011.66openalex-snapshot
Modulo 2^n+1 Arithmetic Units with Embedded Diminished-to-Normal Conversion
inferred← citeshttps://doi.org/10.1109/dsd.2012.114openalex-snapshot
RNS Arithmetic Units for Modulo {2^n+-k}
inferred← citeshttps://doi.org/10.1109/dsd.2012.121openalex-snapshot
SUT-RNS Residue-to-Binary Converters Design
inferred← citeshttps://doi.org/10.1109/dsd.2012.138openalex-snapshot
VLSI Reverse Converter for RNS Based on the Moduli Set
inferred← citeshttps://doi.org/10.1109/dsd.2012.92openalex-snapshot
On the Design of Configurable Modulo 2n±1 Residue Generators
inferred← citeshttps://doi.org/10.1109/dsd.2013.44openalex-snapshot
Electromagnetic Analysis on RSA Algorithm Based on RNS
inferred← citeshttps://doi.org/10.1109/dtis.2011.5941427openalex-snapshot
On the diminished-1 modulo 2N+1 fused multiply-add units
inferred← citeshttps://doi.org/10.1109/dtis.2014.6850645openalex-snapshot
On the design of efficient modulo 2n+1 multiply-add-add units
inferred← citeshttps://doi.org/10.1109/dtis.2016.7483875openalex-snapshot
Fused modulo 2n + 1 add-multiply unit for weighted operands
inferred← citeshttps://doi.org/10.1109/ent.2016.025openalex-snapshot
RNS-Based Data Representation for Handling Multiple-Precision Integers on Parallel Architectures
inferred← citeshttps://doi.org/10.1109/ent50437.2020.9431249openalex-snapshot
Hardware Implementation of the Reverse Conversion RNS-WNS on FPGA
inferred← citeshttps://doi.org/10.1109/eurocon.2013.6625221openalex-snapshot
Reverse converters for RNSs with diminished-one encoded channels
inferred← citeshttps://doi.org/10.1109/eurocon.2013.6625222openalex-snapshot
Modulo 2n−2 arithmetic units
inferred← citeshttps://doi.org/10.1109/ewdts.2010.5742068openalex-snapshot
A novel high speed residue to binary converter design based on the three-moduli set {2n, 2n+1+1, 2n+1−1}
inferred← citeshttps://doi.org/10.1109/ewdts.2014.7027043openalex-snapshot
Efficient calculation of cyclic convolution by means of fast Fourier transform in a finite field
inferred← citeshttps://doi.org/10.1109/fpl.2015.7293933openalex-snapshot
A deep convolutional neural network based on nested residue number system
inferred← citeshttps://doi.org/10.1109/gcce.2013.6664781openalex-snapshot
Efficient reverse converters designs for RNS based digital signal processing systems
inferred← citeshttps://doi.org/10.1109/hpcs48598.2019.9188057openalex-snapshot
Weighted Two-Levels Secret Sharing Scheme for Multi-Clouds Data Storage with Increased Reliability
inferred← citeshttps://doi.org/10.1109/iadcc.2015.7154726openalex-snapshot
A novel Reverse Converter design for new Five moduli set RNS
inferred← citeshttps://doi.org/10.1109/icacce.2015.93openalex-snapshot
A Pure Combinational Logic Gate Based Forward Converter for New Five Moduli Set RNS
inferred← citeshttps://doi.org/10.1109/icastech.2018.8506912openalex-snapshot
RNS Smith-Waterman Accelerator based on the moduli set 2 n , 2 n-1 , 2 n-1 -1
inferred← citeshttps://doi.org/10.1109/icastech.2018.8507081openalex-snapshot
A Novel Approach for the Detection and Correction of Single Bit Error in RRNS Architecture
inferred← citeshttps://doi.org/10.1109/icce.2014.6775947openalex-snapshot
A high performance hardware based RNS-to-binary converter
inferred← citeshttps://doi.org/10.1109/iccee.2009.197openalex-snapshot
A New Approach to Overflow Detection in Moduli Set {2n-3, 2n-1, 2n+1, 2n+3}
inferred← citeshttps://doi.org/10.1109/iccit.2010.5711144openalex-snapshot
Pipelined Residue Logarithmic Numbers System for general modules set {2
inferred← citeshttps://doi.org/10.1109/iccke.2013.6682865openalex-snapshot
Efficient design of Elliptic Curve Point Multiplication based on fast Montgomery modular multiplication
inferred← citeshttps://doi.org/10.1109/iccps.2013.6893506openalex-snapshot
MIMO-OFDM PAPR reduction by residue number system
inferred← citeshttps://doi.org/10.1109/iccse.2012.6295382openalex-snapshot
Research challenges in next-generation residue number system architectures
inferred← citeshttps://doi.org/10.1109/iccsii.2012.6454344openalex-snapshot
A comparative study on different moduli sets in residue number system
inferred← citeshttps://doi.org/10.1109/iccsn.2011.6014044openalex-snapshot
Using Residue Number System for Edge Detection in Digital Images processing
inferred← citeshttps://doi.org/10.1109/iccsp.2015.7322773openalex-snapshot
A parallel architecture for efficient reverse converter using Chinese remainder theorem
inferred← citeshttps://doi.org/10.1109/icdsp.2009.5201052openalex-snapshot
Novel modulo 2n+1 subtractors
inferred← citeshttps://doi.org/10.1109/icdsp.2009.5201088openalex-snapshot
Efficient architectures for modulo 2n−1 squares
inferred← citeshttps://doi.org/10.1109/icdsp.2011.6004929openalex-snapshot
On the use of double-LSB and signed-LSB encodings for RNS
inferred← citeshttps://doi.org/10.1109/icdsp.2013.6622821openalex-snapshot
RNS assisted image filtering and edge detection
inferred← citeshttps://doi.org/10.1109/icece.2010.1292openalex-snapshot
Methods of Restoring a Weather Degradation Image Based on Physical Model and Their Application
inferred← citeshttps://doi.org/10.1109/icece.2010.208openalex-snapshot
Development of a Multi-motor Transmission and Control System of Latest-Twisting Machine Based on PCI Bus
inferred← citeshttps://doi.org/10.1109/icecs.2010.5724439openalex-snapshot
Efficient modulo 2N+1 subtractors for weighted operands
inferred← citeshttps://doi.org/10.1109/icecs.2010.5724605openalex-snapshot
Direct residue-to-analog conversion scheme based on Chinese Remainder Theorem
inferred← citeshttps://doi.org/10.1109/icecs.2014.7049916openalex-snapshot
Fused modulo 2n − 1 add-multiply unit
inferred← citeshttps://doi.org/10.1109/icecs.2014.7050083openalex-snapshot
An ASIC linear congruence solver synthesized with three cell libraries
inferred← citeshttps://doi.org/10.1109/icecs.2015.7440319openalex-snapshot
Fast signed-digit arithmetic circuits for residue number systems
inferred← citeshttps://doi.org/10.1109/icent.2017.36openalex-snapshot
Fast Power-of-Two RNS Scaling Algorithm for Large Dynamic Ranges
inferred← citeshttps://doi.org/10.1109/icetcct.2017.8280309openalex-snapshot
Performance evaluation of digital and RNS based filter for fast DSP processors
inferred← citeshttps://doi.org/10.1109/iciecs.2009.5362740openalex-snapshot
Channel Operations in the Residue Number System with Special Modulus on Hardware
inferred← citeshttps://doi.org/10.1109/icrc.2018.8638592openalex-snapshot
RNSnet: In-Memory Neural Network Acceleration Using Residue Number System
inferred← citeshttps://doi.org/10.1109/icroit.2014.6798385openalex-snapshot
Implementation of floating point MAC using Residue Number System
inferred← citeshttps://doi.org/10.1109/icsp.2018.8652487openalex-snapshot
An Exploration of FPGA based Multilayer Perceptron using Residue Number System for Space Applications
inferred← citeshttps://doi.org/10.1109/ictck.2015.7582668openalex-snapshot
Parallel implementations of somewhat homomorphic encryption based on Open-MP and CUDA
inferred← citeshttps://doi.org/10.1109/idaacs.2019.8924372openalex-snapshot
Compression and Transfer of Images in Wireless Sensor Networks Using the Transformation of Residue Number System
inferred← citeshttps://doi.org/10.1109/idt.2014.7038614openalex-snapshot
Modulo 2n+1 addition and multiplication for redundant operands
inferred← citeshttps://doi.org/10.1109/iemcon.2017.8117238openalex-snapshot
FPGA based effecient architecture for conversion of binay to residue number system
inferred← citeshttps://doi.org/10.1109/iemcon.2018.8614848openalex-snapshot
A Case for Table-Based Approximate Computing
inferred← citeshttps://doi.org/10.1109/indicon.2017.8487570openalex-snapshot
Parallel-prefix modulo adders: A Review
inferred← citeshttps://doi.org/10.1109/ipdps.2011.159openalex-snapshot
Fast Hardware Computation of x Mod z
inferred← citeshttps://doi.org/10.1109/iraniancee.2014.6999673openalex-snapshot
RNS division algorithm for 2n-1 and 2n dividers
inferred← citeshttps://doi.org/10.1109/iscaie.2014.7010225openalex-snapshot
A new approach for high performance RNS-FIR filter using the moduli set {2k − 1, 2k, 2k−1 − 1}
inferred← citeshttps://doi.org/10.1109/iscas.2010.5537592openalex-snapshot
A new four-modulus RNS to binary converter
inferred← citeshttps://doi.org/10.1109/iscas.2010.5537626openalex-snapshot
Design of cost-efficient multipliers modulo 2a−1
inferred← citeshttps://doi.org/10.1109/iscas.2011.5937843openalex-snapshot
Design of multi-residue generators using shared logic
inferred← citeshttps://doi.org/10.1109/iscas.2012.6272005openalex-snapshot
A novel analog-to-residue conversion scheme based on clock overlapping technique
inferred← citeshttps://doi.org/10.1109/iscas.2018.8351066openalex-snapshot
Historical Patterns of Emerging Residue Number System Technologies During the Evolution of Computer Engineering and Digital Signal Processing
inferred← citeshttps://doi.org/10.1109/isce.2013.6570139openalex-snapshot
Design of LUT based RNS reverse converters
inferred← citeshttps://doi.org/10.1109/isicir.2014.7029511openalex-snapshot
Conversions between RNS and mixed-radix numbers using signed-digit arithmetic
inferred← citeshttps://doi.org/10.1109/isicir.2014.7029521openalex-snapshot
ROM-less RNS-to-binary converter moduli {22n − 1, 22n + 1, 2n − 3, 2n + 3}
inferred← citeshttps://doi.org/10.1109/isicir.2014.7029561openalex-snapshot
Rethinking reverse converter design: From algorithms to hardware components
inferred← citeshttps://doi.org/10.1109/isicir.2014.7029566openalex-snapshot
A low-cost architecture for DWT filter banks in RNS applications
inferred← citeshttps://doi.org/10.1109/isise.2008.83openalex-snapshot
An Efficient RNS Scaler for Moduli Set
inferred← citeshttps://doi.org/10.1109/isit.2018.8437612openalex-snapshot
A Multi-layer Recursive Residue Number System
inferred← citeshttps://doi.org/10.1109/islped.2011.5993671openalex-snapshot
Fast and energy-efficient constant-coefficient FIR filters using residue number system
inferred← citeshttps://doi.org/10.1109/ismvl.2011.48openalex-snapshot
A Realization Method of Forward Converters from Multiple-Precision Binary Numbers to Residue Numbers with Arbitrary Mutable Modulus
inferred← citeshttps://doi.org/10.1109/isocc.2012.6407118openalex-snapshot
A novel analog-to-residue converter for biomedical DSP application
inferred← citeshttps://doi.org/10.1109/ispacs.2014.7024441openalex-snapshot
Sum of products: Computation using modular thermometer codes
inferred← citeshttps://doi.org/10.1109/issoc.2014.6972445openalex-snapshot
System on chip design of a linear system solver
inferred← citeshttps://doi.org/10.1109/issse.2010.5607149openalex-snapshot
A high-speed Residue Number comparator For the 3-Moduli Set {2n−1, 2 n+1, 2 n+3}
inferred← citeshttps://doi.org/10.1109/isvlsi.2010.105openalex-snapshot
A Reverse Converter for the Enhanced Moduli Set {2n-1, 2n+1, 22n, 22n+1-1} Using CRT and MRC
inferred← citeshttps://doi.org/10.1109/isvlsi.2010.23openalex-snapshot
SUT-RNS Forward and Reverse Converters
inferred← citeshttps://doi.org/10.1109/isvlsi.2015.12openalex-snapshot
Modulo 2n ± 1 Fused Add-Multiply Units
inferred← citeshttps://doi.org/10.1109/itqmis56172.2022.9976871openalex-snapshot
Efficient Two-level RNS Reverse Conversion Algorithm for Big Number of Modules
inferred← citeshttps://doi.org/10.1109/lascas.2016.7451032openalex-snapshot
Design of a low-power RNS-enhanced arithmetic unit
inferred← citeshttps://doi.org/10.1109/lascas.2016.7451050openalex-snapshot
Area-delay-power-aware adder placement method for RNS reverse converter design
inferred← citeshttps://doi.org/10.1109/meco49872.2020.9134123openalex-snapshot
High-Performance Hardware 3D Medical Imaging using Wavelets in the Residue Number System
inferred← citeshttps://doi.org/10.1109/meco52532.2021.9460255openalex-snapshot
A New Method of Sign Detection in RNS Based on Modified Chinese Remainder Theorem
inferred← citeshttps://doi.org/10.1109/newcas.2012.6328943openalex-snapshot
Residue-weighted number conversion for moduli set {22n − 1, 22n+1 − 1, 2n} using signed-digit number
inferred← citeshttps://doi.org/10.1109/pacet48583.2019.8956249openalex-snapshot
Residue-to-Binary Converter for the New RNS Moduli Set $\{2^{2n}-2, \ 2^{n}-1, \ 2^{n}+1\}$
inferred← citeshttps://doi.org/10.1109/primeasia.2013.6731203openalex-snapshot
An efficient RNS-FIR filter implementation using the moduli set {2k − 1, 2k, 2k−1 − 1}
inferred← citeshttps://doi.org/10.1109/primeasia47521.2019.8950699openalex-snapshot
RNS-To-Binary converters for New Three-moduli sets {2k, 2k-1, 2k(2k-1)+ 1} and {2k, 2k-1, 2k(2k-1)-1}
inferred← citeshttps://doi.org/10.1109/primeasia47521.2019.8950721openalex-snapshot
Residue-to-Binary converters for the seven moduli set {2n-5-1, 2n-3-1, 2n-2+1, 2n-1-1, 2n-1+1, 2n, 2n+1} for n even
inferred← citeshttps://doi.org/10.1109/rusautocon58002.2023.10272872openalex-snapshot
Mathematical Modeling of Signal Processing Using Discrete Wavelet Transform and Non-Positional Modular Code
inferred← citeshttps://doi.org/10.1109/sase-case.2014.6914463openalex-snapshot
An improved hardware implementation of the one hot Residue Number System
inferred← citeshttps://doi.org/10.1109/scet.2012.6342081openalex-snapshot
Thermometer Code Based Modular Arithmetic
inferred← citeshttps://doi.org/10.1109/scm.2016.7519731openalex-snapshot
Parallel-pipeline implementation of digital signal processing techniques based on modular codes
inferred← citeshttps://doi.org/10.1109/sibcon.2015.7147268openalex-snapshot
Effect of RNS moduli set selection on digital filter performance for satellite communications
inferred← citeshttps://doi.org/10.1109/tc.2010.261openalex-snapshot
On Modulo 2^n+1 Adder Design
inferred← citeshttps://doi.org/10.1109/tcomm.2011.022811.100092openalex-snapshot
Error Detection and Correction in Communication Channels Using Inverse Gray RSNS Codes
inferred← citeshttps://doi.org/10.1109/tcsi.2012.2189055openalex-snapshot
An All-Digital PLL Frequency Synthesizer With an Improved Phase Digitization Approach and an Optimized Frequency Calibration Technique
inferred← citeshttps://doi.org/10.1109/tcsi.2012.2206491openalex-snapshot
A VLSI Efficient Programmable Power-of-Two Scaler for $\{2^{n}-1,2^{n},2^{n}+1\}$ RNS
inferred← citeshttps://doi.org/10.1109/tcsi.2012.2220460openalex-snapshot
RNS Reverse Converters for Moduli Sets With Dynamic Ranges up to $(8n+1)$-bit
inferred← citeshttps://doi.org/10.1109/tcsi.2013.2239164openalex-snapshot
A New RNS based DA Approach for Inner Product Computation
inferred← citeshttps://doi.org/10.1109/tcsi.2013.2290843openalex-snapshot
Design of Reverse Converters for General RNS Moduli Sets $\{ 2^{k}, 2^{n}-1, 2^{n}+1, 2^{n+1}-1 \}$ and $\{ 2^{k}, 2^{n}-1, 2^{n}+1, 2^{n-1}-1 \}$ ( $n$ even)
inferred← citeshttps://doi.org/10.1109/tcsi.2014.2337237openalex-snapshot
Design of Reverse Converters for the New RNS Moduli Set $\{2^{n}+1,2^{n}-1,2^{n},2^{n-1}+1\}$ ( $n$ odd)
showing the first 200 of 257 · page through all 257
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.