On the public citation graph
Unified Approach to the Design of Modulo-(2^n +/- 1) Adders Based on Signed-LSB Representation of Residues
0 signed · 47 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.1002/0470863110.ch17openalex-snapshot
Residue Number System Arithmetic
inferredcites →https://doi.org/10.1016/s0898-1221(00)90295-5openalex-snapshot
Computer arithmetic: Algorithms and hardware designs
inferredcites →https://doi.org/10.1109/12.257703openalex-snapshot
A reduced-area scheme for carry-select adders
inferredcites →https://doi.org/10.1109/12.863036openalex-snapshot
High-speed parallel-prefix module 2/sup n/-1 adders
inferredcites →https://doi.org/10.1109/81.340862openalex-snapshot
Fast conversion techniques for binary-residue number systems
inferredcites →https://doi.org/10.1109/81.883337openalex-snapshot
Adaptive control of uncertain Chua's circuits
inferredcites →https://doi.org/10.1109/81.883343openalex-snapshot
An improved residue-to-binary converter
inferredcites →https://doi.org/10.1109/t-c.1971.223261openalex-snapshot
A 40-ns 17-Bit by 17-Bit Array Multiplier
inferredcites →https://doi.org/10.1109/tc.1973.5009159openalex-snapshot
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
inferredcites →https://doi.org/10.1109/tc.2002.1146705openalex-snapshot
Diminished-one modulo 2/sup n/+1 adder design
inferredcites →https://doi.org/10.1109/tc.2004.60openalex-snapshot
Fast parallel-prefix modulo 2/sup n/+1 adders
inferredcites →https://doi.org/10.1109/tc.2005.63openalex-snapshot
Efficient Diminished-1 Modulo 2^n+1 Multipliers
inferredcites →https://doi.org/10.1109/tcsi.2005.851679openalex-snapshot
Weighted two-valued digit-set encodings: unifying efficient hardware representation schemes for redundant number systems
inferredcites →https://doi.org/10.1109/tcsii.2008.923413openalex-snapshot
VLSI Design of Diminished-One Modulo $2^{n}+1$ Adder Using Circular Carry Selection
inferredcites →https://doi.org/10.1142/9781860948671openalex-snapshot
Residue Number Systems - Theory and Implementation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cta.3148openalex-snapshot
A novel generic modulo‐2 graph with full set taxonomical conversion to parallel prefix adders
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-94-007-1488-5_14openalex-snapshot
SUT-RNS Forward and Reverse Converters
inferred← citeshttps://doi.org/10.1007/978-981-16-2911-2_1openalex-snapshot
Design and Implementation of Multi-operand 2$$^n-1$$, 2$$^n$$, and 2$$^n+1$$ Modulo Set Adder
inferred← citeshttps://doi.org/10.1007/s00034-011-9326-5openalex-snapshot
On the Design of Modulo 2 n ±1 Subtractors and Adders/Subtractors
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.1016/j.compeleceng.2019.01.023openalex-snapshot
Impact of diminished-1 encoding on residue number systems arithmetic units and converters
inferred← citeshttps://doi.org/10.1016/j.micpro.2012.02.004openalex-snapshot
Area-time efficient multi-modulus adders and their applications
inferred← citeshttps://doi.org/10.1049/iet-cds.2017.0470openalex-snapshot
General modular adder designs for residue number system applications
inferred← citeshttps://doi.org/10.1049/iet-cdt.2011.0059openalex-snapshot
Efficient realisation of arithmetic algorithms with weighted collection of posibits and negabits
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.1093/comjnl/bxu060openalex-snapshot
Digital Arithmetic in Nature: Continuous-Digit RNS
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/apccas.2012.6419085openalex-snapshot
Multifunction RNS modulo (2n±1) multipliers based on modified booth encoding
inferred← citeshttps://doi.org/10.1109/arith64983.2025.00023openalex-snapshot
A Generic Modulo- $(2^{n}\pm\delta)$ Addition Algorithm via Two-Valued Digit Encoding
inferred← citeshttps://doi.org/10.1109/cads.2010.5623646openalex-snapshot
Posibits, negabits, and their mixed use in efficient realization of arithmetic algorithms
inferred← citeshttps://doi.org/10.1109/dsd.2010.25openalex-snapshot
Area-Efficient Multi-moduli Squarers for RNS
inferred← citeshttps://doi.org/10.1109/iccd.2010.5647761openalex-snapshot
A unified addition structure for moduli set {2n−1, 2n, 2n+1} based on a novel RNS representation
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/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/icindma.2010.5538308openalex-snapshot
Hardware implementation of a fast FIR filter with residue number system
inferred← citeshttps://doi.org/10.1109/iranianmvip.2015.7397518openalex-snapshot
Efficient multiply-add unit specified for DSPs utilizing low-power pipeline modulo 2n+1 multiplier
inferred← citeshttps://doi.org/10.1109/isvlsi.2010.23openalex-snapshot
SUT-RNS Forward and Reverse Converters
inferred← citeshttps://doi.org/10.1109/tc.2016.2547381openalex-snapshot
A Sign Detector for a Group of Three-Moduli Sets
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/vdat.2011.5783558openalex-snapshot
Efficient weighted modulo 2n+1 adders by partitioned parallel-prefix computation and enhanced circular carry generation
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.5120/11948-7765openalex-snapshot
Analysis of Power Efficient Modulo 2n+1 Adder Architectures
inferred← citeshttps://doi.org/10.5120/14213-2110openalex-snapshot
Design of High Speed Modulo 2n+1 Adder
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.