On the public citation graph
Design of squarers modulo A with low-level pipelining
0 signed · 42 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.1007/bf02409397openalex-snapshot
ROM based methods for computing the squaring operation in modular rings
inferredcites →https://doi.org/10.1049/el:19760227openalex-snapshot
Digital filters using read-only memories
inferredcites →https://doi.org/10.1049/el:19760289openalex-snapshot
Implementation of number-theoretic transforms
inferredcites →https://doi.org/10.1049/el:19770117openalex-snapshot
Multipliers for residue-number-arithmetic digital filters
inferredcites →https://doi.org/10.1049/ip-e.1991.0033openalex-snapshot
Novel approach for implementing convolutions with small tables
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/31.31329openalex-snapshot
Adaptive detection and enhancement of multiple sinusoids using a cascade IIR filter
inferredcites →https://doi.org/10.1109/4.278352openalex-snapshot
A 177 Mb/s VLSI implementation of the International Data Encryption Algorithm
inferredcites →https://doi.org/10.1109/71.382314openalex-snapshot
Modulo reduction in residue number systems
inferredcites →https://doi.org/10.1109/76.143414openalex-snapshot
An integrated circuit design for pruned tree-search vector quantization encoding with an off-chip controller
inferredcites →https://doi.org/10.1109/82.251845openalex-snapshot
Full adder-based arithmetic units for finite integer rings
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.566648openalex-snapshot
A VLSI design methodology for RNS full adder-based inner product architectures
inferredcites →https://doi.org/10.1109/iccd.1993.393303openalex-snapshot
A new modulo 2/sup a/+1 multiplier
inferredcites →https://doi.org/10.1109/iccd.1994.331962openalex-snapshot
Design of high-speed residue-to-binary number system converter based on Chinese Remainder Theorem
inferredcites →https://doi.org/10.1109/proc.1980.11678openalex-snapshot
A high-speed low-cost modulo Pimultiplier with RNS arithmetic applications
inferredcites →https://doi.org/10.1109/tcs.1981.1085027openalex-snapshot
Large moduli multipliers for signal processing
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_4openalex-snapshot
Modulo Multiplication and Modulo Squaring
inferred← citeshttps://doi.org/10.1016/j.vlsi.2011.03.006openalex-snapshot
Efficient modulo 2 ±1 squarers
inferred← citeshttps://doi.org/10.1049/iet-cdt:20060009openalex-snapshot
RNS multiplication/sum-of-squares units
inferred← citeshttps://doi.org/10.1109/apccas.2008.4746265openalex-snapshot
A low complexity modulo 2n+1 squarer design
inferred← citeshttps://doi.org/10.1109/dsd.2004.1333300openalex-snapshot
Diminished-1 modulo 2/sup n/ + 1 squarer design
inferred← citeshttps://doi.org/10.1109/ecctd.2005.1523013openalex-snapshot
Modulo 2/sup n/ - 1 multiplication / sum-of-squares units
inferred← citeshttps://doi.org/10.1109/eurcon.2005.1630004openalex-snapshot
A Simplified Modulo (2n-1) Squaring Scheme for Residue Number System
inferred← citeshttps://doi.org/10.1109/icdsp.2009.5201088openalex-snapshot
Efficient architectures for modulo 2n−1 squares
inferred← citeshttps://doi.org/10.1109/icniconsmcl.2006.2openalex-snapshot
A CAD Tool for Generation of Synthesizable and Scalable Square of Binary Numbers
inferred← citeshttps://doi.org/10.1109/iscas.2003.1206269openalex-snapshot
Design of a 32-bit squarer - exploiting addition redundancy
inferred← citeshttps://doi.org/10.1109/iscas.2005.1464675openalex-snapshot
A New Design Method to Modulo 2>sup /sup<-1 Squaring
inferred← citeshttps://doi.org/10.1109/iscas.2009.5117780openalex-snapshot
Fixed and variable multi-modulus squarer architectures for triple moduli base of RNS
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.5937775openalex-snapshot
A simple radix-4 Booth encoded modulo 2n+1 multiplier
inferred← citeshttps://doi.org/10.1109/isspa.2010.5605457openalex-snapshot
A reconfigurable Digital Signal Processor using residue number system
inferred← citeshttps://doi.org/10.1109/rsp.2005.27openalex-snapshot
KoVer: A Sophisticated Residue Arithmetic Core Generator
inferred← citeshttps://doi.org/10.1109/sips.2008.4671771openalex-snapshot
Low-complexity polynomials modulo integer with linearly incremented variable
inferred← citeshttps://doi.org/10.1109/tcsi.2010.2092133openalex-snapshot
Radix-8 Booth Encoded Modulo $2 ^{n} -1$ Multipliers With Adaptive Delay for High Dynamic Range Residue Number System
inferred← citeshttps://doi.org/10.1109/tcsi.2011.2142950openalex-snapshot
Simple, Fast, and Exact RNS Scaler for the Three-Moduli Set $\{2^{n} - 1, 2^{n}, 2^{n} + 1\}$
inferred← citeshttps://doi.org/10.1109/tcsi.2013.2252642openalex-snapshot
Radix-4 and Radix-8 Booth Encoded Multi-Modulus Multipliers
inferred← citeshttps://doi.org/10.1109/tcsii.2005.857090openalex-snapshot
Improved memoryless RNS forward converter based on the periodicity of residues
inferred← citeshttps://doi.org/10.1117/12.452058openalex-snapshot
Application of symmetric redundant residues for fast and reliable arithmetic
inferred← citeshttps://doi.org/10.32657/10356/59524openalex-snapshot
VLSI efficient RNS scalers and arbitrary modulus residue generators
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.