On the public citation graph
Comments on "A high speed realization of a residue to binary number system converter"
0 signed · 56 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.1049/el:19911429openalex-snapshot
Two quadrant analogue squarer circuit based on MOS square-law characteristic
inferredcites →https://doi.org/10.1049/el:19930857openalex-snapshot
Ratiometric temperature stable current reference
inferredcites →https://doi.org/10.1049/el:19931068openalex-snapshot
Programmable analogue VLSI for radial basis function networks
inferredcites →https://doi.org/10.1109/31.14470openalex-snapshot
A new efficient memoryless residue to binary converter
inferredcites →https://doi.org/10.1109/72.143377openalex-snapshot
Using radial basis functions to approximate a function and its error bounds
inferredcites →https://doi.org/10.1109/72.238312openalex-snapshot
A clustering technique for digital communications channel equalization using radial basis function networks
inferredcites →https://doi.org/10.1109/82.365346openalex-snapshot
Analog CMOS integration and experimentation with an autoadaptive independent component analyzer
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/92.273156openalex-snapshot
A Gaussian synapse circuit for analog VLSI neural networks
inferredcites →https://doi.org/10.1109/ijcnn.1991.155225openalex-snapshot
'Bump' circuits for computing similarity and dissimilarity of analog voltages
inferredcites →https://doi.org/10.1109/ijcnn.1991.170475openalex-snapshot
Recognition of handwritten Katakana in a frame using moment invariants based on neural network
inferredcites →https://doi.org/10.1109/ijcnn.1991.170501openalex-snapshot
A neural network which learns decision boundaries with nonlinear clustering
inferredcites →https://doi.org/10.1109/ijcnn.1992.226921openalex-snapshot
A radial basis function neurocomputer implemented with analog VLSI circuits
inferredcites →https://doi.org/10.1109/ipps.1992.222971openalex-snapshot
Parallel coprocessor for Kohonen's self-organizing neural network
inferredcites →https://doi.org/10.1109/iscas.1994.409570openalex-snapshot
An analogue radial basis function circuit using a compact Euclidean distance calculator
inferredcites →https://doi.org/10.1109/jssc.1979.1051259openalex-snapshot
Direct-coupled MOS squaring circuit
inferredcites →https://doi.org/10.1109/jssc.1987.1052733openalex-snapshot
A class of analog CMOS circuits based on the square-law characteristic of an MOS transistor in saturation
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-41385-3_6openalex-snapshot
Scaling, Base Extension, Sign Detection and Comparison in RNS
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-016-0440-2openalex-snapshot
Reverse Conversion Using Core Function, CRT and Mixed Radix Conversion
inferred← citeshttps://doi.org/10.1007/s00034-017-0530-9openalex-snapshot
Design of Reverse Converters for a New Flexible RNS Five-Moduli Set $$\{ 2^k, 2^n-1, 2^n+1, 2^{n+1}-1, 2^{n-1}-1 \}$$ { 2 k , 2 n - 1 , 2 n + 1 , 2 n + 1 - 1 , 2 n - 1 - 1 } (n Even)
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/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/s11265-017-1238-6openalex-snapshot
Design of RNS Reverse Converters with Constant Shifting to Residue Datapath Channels
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/s13369-014-0963-4openalex-snapshot
High Speed Residue to Binary Converter for the New Four-Moduli Set {22n , 2 n + 1, 2 n/2 + 1, 2 n/2−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.1080/09747338.2003.12088395openalex-snapshot
Residue Number Systems — A Tutorial Review
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/81.940195openalex-snapshot
Comments on "Breaking the 2n-bit carry-propagation barrier in residue to binary conversion for the [2/sup n/-1, 2/sup n/, 2/sup n/+1] moduli set" and author's reply
inferred← citeshttps://doi.org/10.1109/acssc.2008.5074734openalex-snapshot
A residue to binary converter for the {2n + 2, 2n + 1, 2n} moduli set
inferred← citeshttps://doi.org/10.1109/discover47552.2019.9007938openalex-snapshot
New RNS-To-Binary Converters for Three-Moduli Set $\{2^{n+1}-1,\ 2^{n}-1,\ 2^{n+k}\}$
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/spcom.2004.1458383openalex-snapshot
Reverse converters for the moduli sets {2/sup 2N/-1, 2/sup N/, 2/sup 2N/ +1} and {2/sup N/-3, 2/supN/ +1, 2/sup N/-1, 2/sup N +3}
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.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.2008.917994openalex-snapshot
Fast Sign Detection for RNS $(2^{n}-1,2^{n},2^{n}+1)$
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.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)
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/tencon.2008.4766524openalex-snapshot
New residue to binary converters for the moduli set {2k, 2k−1, 2k-1−1}
inferred← citeshttps://doi.org/10.1109/tencon.2008.4766575openalex-snapshot
An RNS based transform architecture for H.264/AVC
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.1145/2206781.2206799openalex-snapshot
Design of an RNS reverse converter for a new five-moduli special set
inferred← citeshttps://doi.org/10.1186/s13634-023-01037-8openalex-snapshot
Design of reverse converters for the general RNS 3-moduli set {2k, 2n − 1, 2n + 1}
inferred← citeshttps://doi.org/10.32657/10356/2379openalex-snapshot
VLSI efficient architectures for triple moduli based RNS computations
inferred← citeshttps://doi.org/10.32657/10356/50689openalex-snapshot
Novel modulo multipliers for moduli 2^n-1, 2^n and 2^n+1.
inferred← citeshttps://doi.org/10.32657/10356/59524openalex-snapshot
VLSI efficient RNS scalers and arbitrary modulus residue generators
inferred← citeshttps://doi.org/10.5815/ijigsp.2012.09.06openalex-snapshot
Effective Reverse Converter for General Three Moduli Set{(2^n)-1,(2^n)+1,(2^(pn+1))-1}
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.