On the public citation graph
A high-speed residue-to-binary converter for three-moduli (2/sup k/, 2/sup k/-1, 2/sup k-1/-1) RNS and a scheme for its VLSI implementation
0 signed · 89 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1109/12.250610openalex-snapshot
Design of residue generators and multioperand modular adders using carry-save adders
inferredcites →https://doi.org/10.1109/12.628400openalex-snapshot
A signed-digit architecture for residue to binary transformation
inferredcites →https://doi.org/10.1109/31.14470openalex-snapshot
A new efficient memoryless residue to binary converter
inferredcites →https://doi.org/10.1109/81.678485openalex-snapshot
RNS-to-binary conversion for efficient VLSI implementation
inferredcites →https://doi.org/10.1109/82.136572openalex-snapshot
Fast and flexible architectures for RNS arithmetic decoding
inferredcites →https://doi.org/10.1109/82.160172openalex-snapshot
An RNS to binary converter in 2n+1, 2n, 2n-1 moduli set
inferredcites →https://doi.org/10.1109/82.298378openalex-snapshot
Area-time efficient modulo 2/sup n/-1 adder design
inferredcites →https://doi.org/10.1109/82.378047openalex-snapshot
An RNS to binary converter in a three moduli set with common factors
inferredcites →https://doi.org/10.1109/82.471401openalex-snapshot
A high-speed realization of a residue to binary number system converter
inferredcites →https://doi.org/10.1109/82.661651openalex-snapshot
Residue-to-binary arithmetic converter for the moduli set (2/sup k/, 2/sup k/-1, 2/sup k-1/-1)
inferredcites →https://doi.org/10.1109/82.752949openalex-snapshot
Residue-to-binary number converters for three moduli sets
inferredcites →https://doi.org/10.1109/acssc.1998.750847openalex-snapshot
New Chinese remainder theorems
inferredcites →https://doi.org/10.1109/icassp.1999.756279openalex-snapshot
A parallel residue-to-binary converter
inferredcites →https://doi.org/10.1109/iscas.1999.780162openalex-snapshot
A high-speed residue-to-binary converter and a scheme for its VLSI implementation
inferredcites →https://doi.org/10.1109/tc.1985.1676602openalex-snapshot
Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding
inferredcites →https://doi.org/10.1109/tcs.1977.1084321openalex-snapshot
The use of residue number systems in the design of finite impulse response digital filters
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.ch6openalex-snapshot
RNS‐Based Arithmetic Circuits and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-49742-6_3openalex-snapshot
Non-Modular Operations of the Residue Number System: Functions for Computing
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/s11235-015-0098-2openalex-snapshot
RDTP: reliable data transport protocol in wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s11432-010-4133-3openalex-snapshot
Efficient CRT-based residue-to-binary converter for the arbitrary 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/s41870-019-00297-8openalex-snapshot
VLSI implementation of residue number system based efficient digital signal processor architecture for wireless sensor nodes
inferred← citeshttps://doi.org/10.1016/j.aeue.2007.08.008openalex-snapshot
New reverse converters for the moduli set
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2006.01.024openalex-snapshot
A parallel residue-to-binary conversion algorithm without trial division
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2023.108654openalex-snapshot
Optimized reverse converters with multibit soft error correction support at 7nm technology
inferred← citeshttps://doi.org/10.1016/j.sysarc.2008.03.006openalex-snapshot
An efficient architecture for designing reverse converters based on a general three-moduli set
inferred← citeshttps://doi.org/10.1016/s0167-9260(03)00018-xopenalex-snapshot
An arithmetic residue to binary conversion technique
inferred← citeshttps://doi.org/10.1016/s1383-7621(03)00062-6openalex-snapshot
Residue number system to binary converter for the moduli set (2n−1,2n−1,2n+1)
inferred← citeshttps://doi.org/10.1049/ip-cdt:20030060openalex-snapshot
Efficient residue to binary converter
inferred← citeshttps://doi.org/10.1049/ip-cdt:20031029openalex-snapshot
Arithmetic binary to residue encoders for moduli (2n±2k+1)
inferred← citeshttps://doi.org/10.1049/ip-cdt:20040033openalex-snapshot
Residue-to-binary decoder for an enhanced moduli set
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.1093/comjnl/bxy119openalex-snapshot
On the Design of RNS Inter-Modulo Processing Units for the Arithmetic-Friendly Moduli Sets {2n+k, 2n− 1, 2n+1 − 1}
inferred← citeshttps://doi.org/10.1109/acssc.2001.987709openalex-snapshot
FPGA hardware implementation of an RNS FIR digital filter
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/eiconrus.2017.7910546openalex-snapshot
Research of effective methods of conversion from positional notation to RNS on FPGA
inferred← citeshttps://doi.org/10.1109/eit.2006.252123openalex-snapshot
Residue-to-Binary Converters for High-speed Digital Signal Processing
inferred← citeshttps://doi.org/10.1109/eit.2007.4374470openalex-snapshot
VLSI implementation of residue-to-binary converters for digital signal processing
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/hpcs48598.2019.9188057openalex-snapshot
Weighted Two-Levels Secret Sharing Scheme for Multi-Clouds Data Storage with Increased Reliability
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/iccae.2010.5451409openalex-snapshot
A novel generic three-moduli set and its optimum arithmetic residue to binary converters
inferred← citeshttps://doi.org/10.1109/icccas.2009.5250359openalex-snapshot
A New efficient RNS-to-binary conversion for the three-moduli sets
inferred← citeshttps://doi.org/10.1109/iccci.2012.6158921openalex-snapshot
A novel high dynamic range 4-module set {22n+1, 22n + 1, 2n + 1, 2n − 1} whit efficient reverse converter and review improving modular multiplication's dynamic range with this module set
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/icecet58911.2023.10389589openalex-snapshot
Optimal Moduli Searching for RNS-Based Devices
inferred← citeshttps://doi.org/10.1109/icee.2007.4287306openalex-snapshot
A New Moduli Set for Residue Number System: {rn 2,rn 1,rn}
inferred← citeshttps://doi.org/10.1109/ictta.2008.4530266openalex-snapshot
A New Residue to Binary Converter Based on Mixed-Radix Conversion
inferred← citeshttps://doi.org/10.1109/iscas.2003.1205945openalex-snapshot
Moduli selection in RNS for efficient VLSI implementation
inferred← citeshttps://doi.org/10.1109/iscas.2010.5537592openalex-snapshot
A new four-modulus RNS to binary converter
inferred← citeshttps://doi.org/10.1109/iscit.2010.5665122openalex-snapshot
An improved reverse converter for moduli set (2n−1,2n,2n+1)
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/ispacs.2009.5383901openalex-snapshot
A new design of reverse converter for a three-moduli set
inferred← citeshttps://doi.org/10.1109/iwsoc.2004.1319854openalex-snapshot
RNS application for digital image processing
inferred← citeshttps://doi.org/10.1109/primeasia.2017.8280351openalex-snapshot
An efficient residue-to-binary converter for the moduli set {2n−1−1, 2n+k, 2n−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/sibcon.2015.7147268openalex-snapshot
Effect of RNS moduli set selection on digital filter performance for satellite communications
inferred← citeshttps://doi.org/10.1109/tc.2003.1214338openalex-snapshot
Deterministic BIST for RNS adders
inferred← citeshttps://doi.org/10.1109/tc.2004.1261842openalex-snapshot
Modified booth modulo 2/sup n/ - 1 multipliers
inferred← citeshttps://doi.org/10.1109/tc.2008.126openalex-snapshot
The Mixed-Radix Chinese Remainder Theorem and Its Applications to Residue Comparison
inferred← citeshttps://doi.org/10.1109/tcsi.2002.808191openalex-snapshot
A study of the residue-to-binary converters for the three-moduli sets
inferred← citeshttps://doi.org/10.1109/tcsi.2007.895515openalex-snapshot
RNS-to-Binary Converters for Two Four-Moduli Sets $\{2^{n}-1,2^{n},2^{n}+1,2^{{n}+1}-1\}$ and $\{2^{n}-1,2^{n},2^{n}+1,2^{{n}+1}+1\}$
inferred← citeshttps://doi.org/10.1109/tcsi.2009.2026681openalex-snapshot
Efficient Reverse Converter Designs for the New 4-Moduli Sets $\{2^{n} -1, 2^{n}, 2^{n} +1, 2^{2n + 1}-1\}$ and $\{2^{n} -1, 2^{n} +1, 2^{2n}, 2^{2n} +1\}$ Based on New CRTs
inferred← citeshttps://doi.org/10.1109/tcsi.2016.2612723openalex-snapshot
A Reverse Converter and Sign Detectors for an Extended RNS Five-Moduli Set
inferred← citeshttps://doi.org/10.1109/tcsii.2002.1013871openalex-snapshot
A note on "A high-speed residue-to-binary converter for three-moduli (2/sup k/ 2/sup k/ - 1, 2/sup k-1/ - 1) RNS and a scheme for its VLSI implementation"
inferred← citeshttps://doi.org/10.1109/tcsii.2003.814808openalex-snapshot
Residue-to-binary conversion by the "quotient function"
inferred← citeshttps://doi.org/10.1109/tcsii.2007.900844openalex-snapshot
RNS-To-Binary Converter for a New Three-Moduli Set $\{2^{{n}+1}-1,2^{n},2^{n}-1\}$
inferred← citeshttps://doi.org/10.1109/tcsii.2016.2608335openalex-snapshot
An Efficient Reverse Converter for the Three-Moduli Set ( $ 2^{n+1}-1, 2^{n}, 2^{n}-1$ )
inferred← citeshttps://doi.org/10.1109/te.2010.2048329openalex-snapshot
How to Teach Residue Number System to Computer Scientists and Engineers
inferred← citeshttps://doi.org/10.1109/tencon.2012.6412197openalex-snapshot
Residue-binary number conversion using signed-digit arithmetic for a three-moduli set
inferred← citeshttps://doi.org/10.1109/tvlsi.2004.840400openalex-snapshot
VLSI implementation of new arithmetic residue to binary decoders
inferred← citeshttps://doi.org/10.1142/s0218126604001970openalex-snapshot
NOVEL DESIGN AND FPGA IMPLEMENTATION OF DA-RNS FIR FILTERS
inferred← citeshttps://doi.org/10.1142/s0218126611007906openalex-snapshot
AN EFFICIENT REVERSE CONVERTER FOR THE NEW FOUR-MODULI SET {22n, 2n+1 - 1, 2n/2 + 1, 2n/2 - 1}
inferred← citeshttps://doi.org/10.1142/s0218126618500755openalex-snapshot
Area Efficient Memoryless Reverse Converter for New Four Moduli Set {2n−1,2n−1,2n+1,22n+1−1}
inferred← citeshttps://doi.org/10.1142/s0218126618502249openalex-snapshot
RNS-to-Binary Converters for New Three-Moduli Sets {2k−3, 2k−2, 2k−1} and {2k+1, 2k+2, 2k+3}
inferred← citeshttps://doi.org/10.1142/s0218126619501263openalex-snapshot
A Residue-to-Binary Converter with an Adjustable Structure for an Extended RNS Three-Moduli Set
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.1628openalex-snapshot
Efficient MRC-Based Residue to Binary Converters for the New Moduli Sets {22n, 2n -1, 2n+1 -1} and {22n, 2n -1, 2n-1 -1}
inferred← citeshttps://doi.org/10.1587/transinf.e94.d.264openalex-snapshot
A General Reverse Converter Architecture with Low Complexity and High Performance
inferred← citeshttps://doi.org/10.2298/fuee0901125sopenalex-snapshot
Digital FIR filter architecture based on the residue number system
inferred← citeshttps://doi.org/10.2478/v10006-011-0013-2openalex-snapshot
Hierarchical residue number systems with small moduli and simple converters
inferred← citeshttps://doi.org/10.26634/jcs.2.4.2472openalex-snapshot
Analysis on Modified Booth 2n -1 Multipliers
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.336-338.1852openalex-snapshot
Efficiency Reverse Converter for 4-Moduli Set {22n, 22n+1-1, 2n+1, 2n-1} Based on New CRT-II
inferred← citeshttps://doi.org/10.4218/etrij.2018-0408openalex-snapshot
Efficient programmable power‐of‐two scaler for the three‐moduli set {2 n + p , 2 n − 1, 2 n +1 − 1}
inferred← citeshttps://doi.org/10.4316/aece.2011.02006openalex-snapshot
Improving the Delay of Residue-to-Binary Converter for a Four-Moduli Set
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.