On the public citation graph
A Family of High Radix Signed Digit Adders
0 signed · 32 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.1016/j.compeleceng.2009.12.002openalex-snapshot
An improved maximally redundant signed digit adder
inferredcites →https://doi.org/10.1016/j.mejo.2009.07.002openalex-snapshot
A fully redundant decimal adder and its application in parallel decimal multipliers
inferredcites →https://doi.org/10.1016/s0167-9260(00)00015-8openalex-snapshot
Redundant arithmetic, algorithms and implementations
inferredcites →https://doi.org/10.1049/iet-cds:20050228openalex-snapshot
Stored-transfer representations with weighted digit-set encodings for ultrahigh-speed arithmetic
inferredcites →https://doi.org/10.1049/ip-e.1989.0021openalex-snapshot
RBCD: redundant binary coded decimal adder
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1109/12.46283openalex-snapshot
Generalized signed-digit number systems: a unifying framework for redundant number representations
inferredcites →https://doi.org/10.1109/arith.2001.930098openalex-snapshot
Leading zero anticipation and detection-a comparison of methods
inferredcites →https://doi.org/10.1109/arith.2003.1207665openalex-snapshot
The case for a redundant format in floating point arithmetic
inferredcites →https://doi.org/10.1109/arith.2009.23openalex-snapshot
Fully Redundant Decimal Arithmetic
inferredcites →https://doi.org/10.1109/cads.2010.5623646openalex-snapshot
Posibits, negabits, and their mixed use in efficient realization of arithmetic algorithms
inferredcites →https://doi.org/10.1109/iscas.1999.777914openalex-snapshot
New high radix maximally-redundant signed digit adder
inferredcites →https://doi.org/10.1109/isvlsi.2009.30openalex-snapshot
Maximally Redundant High-Radix Signed-Digit Adder: New Algorithm and Implementation
inferredcites →https://doi.org/10.1109/t-c.1969.222633openalex-snapshot
Decimal Adder with Signed Digit Arithmetic
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/tec.1961.5219227openalex-snapshot
Signed-Digit Numbe Representations for Fast Parallel Arithmetic
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.ch8openalex-snapshot
Redundant Number System‐Based Arithmetic Circuits
inferred← citeshttps://doi.org/10.1007/s00034-013-9586-3openalex-snapshot
Decimal SRT Square Root: Algorithm and Architecture
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.1049/iet-cdt.2011.0059openalex-snapshot
Efficient realisation of arithmetic algorithms with weighted collection of posibits and negabits
inferred← citeshttps://doi.org/10.1109/dcas.2014.6965332openalex-snapshot
Radix-2h online floating point multipliers
inferred← citeshttps://doi.org/10.1109/fccm.2014.24openalex-snapshot
A New Algorithm for Carry-Free Addition of Binary Signed-Digit Numbers
inferred← citeshttps://doi.org/10.1109/iscas.2014.6865615openalex-snapshot
High-speed FFT processors based on redundant number systems
inferred← citeshttps://doi.org/10.1109/ised.2012.10openalex-snapshot
Improved Design of High-Radix Signed-Digit Adders
inferred← citeshttps://doi.org/10.1109/les.2025.3529731openalex-snapshot
Auto Digit Selection for Most Significant Digit First Multiplication
inferred← citeshttps://doi.org/10.1109/pcitc.2015.7438171openalex-snapshot
Efficient hardware realization of signed arithmetic operation using IEN
inferred← citeshttps://doi.org/10.1109/tc.2014.2329678openalex-snapshot
Reviewing High-Radix Signed-Digit Adders
inferred← citeshttps://doi.org/10.1109/tcad.2025.3610064openalex-snapshot
Efficient Modular Addition for FPGA-Based Cryptographic Operations
inferred← citeshttps://doi.org/10.1109/tvlsi.2016.2604346openalex-snapshot
Energy-Efficient VLSI Realization of Binary64 Division With Redundant Number Systems
inferred← citeshttps://doi.org/10.5120/15430-4001openalex-snapshot
Comments on "Area Time Efficient Sign Detection Technique for Binary Signed-Digit Number System" proposed by Srikanthan, Lam and Suman
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.