On the public citation graph
Fast and flexible architectures for RNS arithmetic decoding
0 signed · 77 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/31.14466openalex-snapshot
Efficient VLSI networks for converting an integer from binary system to residue number system and vice versa
inferredcites →https://doi.org/10.1109/31.14470openalex-snapshot
A new efficient memoryless residue to binary converter
inferredcites →https://doi.org/10.1109/31.7576openalex-snapshot
An efficient residue to binary converter design
inferredcites →https://doi.org/10.1109/31.7577openalex-snapshot
Residue to binary conversion for RNS arithmetic using only modular look-up tables
inferredcites →https://doi.org/10.1109/arith.1989.72827openalex-snapshot
theta (logN) architectures for RNS arithmetic decoding
inferredcites →https://doi.org/10.1109/arith.1989.72829openalex-snapshot
Systolic arrays for integer Chinese remaindering
inferredcites →https://doi.org/10.1109/arrays.1988.18094openalex-snapshot
A systolic array for fault tolerant digital signal processing using a residue number system approach
inferredcites →https://doi.org/10.1109/iscas.1989.100326openalex-snapshot
A fast and flexible residue decoder based on the Chinese remainder theorem
inferredcites →https://doi.org/10.1109/mc.1984.1659138openalex-snapshot
Residue Arithmetic A Tutorial with Examples
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.1978.1084495openalex-snapshot
Techniques for residue-to-analog conversion for residue-encoded digital filters
inferredcites →https://doi.org/10.1109/tcs.1984.1085465openalex-snapshot
A VLSI algorithm for direct and reverse conversion from weighted binary number system to residue number system
inferredcites →https://doi.org/10.1109/tcs.1987.1086188openalex-snapshot
A look-up table VLSI design methodology for RNS structures used in DSP applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ett.4460090607openalex-snapshot
Performance of residue number system based DS‐CDMA over multipath fading channels using orthogonal sequences
inferred← citeshttps://doi.org/10.1007/3-540-63508-4_110openalex-snapshot
Real time hardware architecture for visual robot navigation
inferred← citeshttps://doi.org/10.1007/978-3-540-24709-8_23openalex-snapshot
Multiplier with Parallel CSA using CRT’s Specific Moduli (2 k -1, 2 k , 2 k +1)
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.1016/0020-0190(94)90036-1openalex-snapshot
A fully parallel algorithm for residue to binary conversion
inferred← citeshttps://doi.org/10.1016/j.phycom.2014.01.002openalex-snapshot
Redundant residue number system based space-time block codes
inferred← citeshttps://doi.org/10.1016/j.vlsi.2009.04.002openalex-snapshot
Fast modulo 2n+1 multi-operand adders and residue generators
inferred← citeshttps://doi.org/10.1016/j.vlsi.2020.07.003openalex-snapshot
On reverse converters for arbitrary multi-moduli RNS
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00003-xopenalex-snapshot
RNS architectures for the implementation of the `diagonal function'
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00077-6openalex-snapshot
On the optimal utilization of all available states in the moduli set
inferred← citeshttps://doi.org/10.1023/a:1021162422734openalex-snapshot
An RNS Architecture for Quasi-Chaotic Oscillators
inferred← citeshttps://doi.org/10.1049/ip-cdt:19981948openalex-snapshot
Area-time-efficient VLSI residue-to-binary converters
inferred← citeshttps://doi.org/10.1080/0020721031000148263openalex-snapshot
Handling zero in diminished-one modulo 2n+ 1 adders
inferred← citeshttps://doi.org/10.1093/comjnl/41.1.45openalex-snapshot
Logic Design of a Fast Circuit for Iterative Additions in Redundant Hybrid Number Systems
inferred← citeshttps://doi.org/10.1109/12.628400openalex-snapshot
A signed-digit architecture for residue to binary transformation
inferred← citeshttps://doi.org/10.1109/12.833113openalex-snapshot
New efficient structure for a modular multiplier for RNS
inferred← citeshttps://doi.org/10.1109/12.863036openalex-snapshot
High-speed parallel-prefix module 2/sup n/-1 adders
inferred← citeshttps://doi.org/10.1109/5.687834openalex-snapshot
Algorithm-based low-power and high-performance multimedia signal processing
inferred← citeshttps://doi.org/10.1109/81.678485openalex-snapshot
RNS-to-binary conversion for efficient VLSI implementation
inferred← citeshttps://doi.org/10.1109/82.298378openalex-snapshot
Area-time efficient modulo 2/sup n/-1 adder design
inferred← citeshttps://doi.org/10.1109/82.475251openalex-snapshot
A systolic architecture for modulo multiplication
inferred← citeshttps://doi.org/10.1109/82.559370openalex-snapshot
The digit parallel method for fast RNS to weighted number system conversion for specific moduli (2/sup k/-1,2/sup k/,2/sup k/+1)
inferred← citeshttps://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)
inferred← citeshttps://doi.org/10.1109/82.826745openalex-snapshot
Residue-to-binary converters based on new Chinese remainder theorems
inferred← citeshttps://doi.org/10.1109/82.868463openalex-snapshot
RNS arithmetic multiplier for medium and large moduli
inferred← citeshttps://doi.org/10.1109/82.899659openalex-snapshot
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/acssc.1996.600859openalex-snapshot
Choosing the system moduli of RNS arithmetic processors
inferred← citeshttps://doi.org/10.1109/acssc.1998.750847openalex-snapshot
New Chinese remainder theorems
inferred← citeshttps://doi.org/10.1109/acssc.1998.751525openalex-snapshot
Efficient RNS to binary conversion using high-radix SRT division
inferred← citeshttps://doi.org/10.1109/aero.2003.1235253openalex-snapshot
RNS implementation of high performance filters for satellite demultiplexing
inferred← citeshttps://doi.org/10.1109/arith.1993.378112openalex-snapshot
Combined system-level redundancy and modular arithmetic for fault tolerant digital signal processing
inferred← citeshttps://doi.org/10.1109/arith.1997.614902openalex-snapshot
Scaled and unscaled residue number system to binary conversion techniques using the core function
inferred← citeshttps://doi.org/10.1109/arith.2001.930121openalex-snapshot
High speed parallel-prefix modulo 2/sup n/+1 adders for diminished-one operands
inferred← citeshttps://doi.org/10.1109/icaccs57279.2023.10112959openalex-snapshot
High-Performance Computing Based on Residue Number System: A Review
inferred← citeshttps://doi.org/10.1109/iccd.1994.331910openalex-snapshot
A parallel CMOS 2's complement multiplier based on 5:3 counter
inferred← citeshttps://doi.org/10.1109/iccd.1994.331962openalex-snapshot
Design of high-speed residue-to-binary number system converter based on Chinese Remainder Theorem
inferred← citeshttps://doi.org/10.1109/icecs.1999.813388openalex-snapshot
New area efficient residue-to-weighted number system converters
inferred← citeshttps://doi.org/10.1109/icecs.2000.912958openalex-snapshot
Modified Booth 1's complement and modulo 2/sup n/-1 multipliers
inferred← citeshttps://doi.org/10.1109/icecs.2000.913011openalex-snapshot
High-radix residue number system forward and inverse converters
inferred← citeshttps://doi.org/10.1109/icetet.2015.23openalex-snapshot
FPGA Implementation of Modulo (231-1) Adder
inferred← citeshttps://doi.org/10.1109/icip.1999.822930openalex-snapshot
A dedicated hardware system for a class of nonlinear order statistics rational hybrid filters with applications to image processing
inferred← citeshttps://doi.org/10.1109/icrc.2019.8914700openalex-snapshot
Integrated Photonics Architectures for Residue Number System Computations
inferred← citeshttps://doi.org/10.1109/iscas.1997.621555openalex-snapshot
Efficient modulo extraction for CRT based residue to binary converters
inferred← citeshttps://doi.org/10.1109/iscas.2001.922245openalex-snapshot
FPGA realization of RNS to binary signed conversion architecture
inferred← citeshttps://doi.org/10.1109/iscas.2003.1205951openalex-snapshot
Design of a high speed reverse converter for a new 4-moduli set residue number system
inferred← citeshttps://doi.org/10.1109/iscas.2003.1205999openalex-snapshot
New efficient residue-to-binary converters for 4-moduli set {2/sup n/ - 1, 2/sup n/, 2/sup n/ + 1, 2/sup n+1/ - 1}
inferred← citeshttps://doi.org/10.1109/ispa.2003.1296391openalex-snapshot
Adder based residue to binary converters for a new balanced 4-moduli set
inferred← citeshttps://doi.org/10.1109/mwscas.1992.271097openalex-snapshot
Fault tolerant architectures for efficient realization of common DSP kernels
inferred← citeshttps://doi.org/10.1109/mwscas.2000.952900openalex-snapshot
An area-time-efficient residue-to-binary converter
inferred← citeshttps://doi.org/10.1109/sips.1997.626113openalex-snapshot
Implementing area-time efficient VLSI residue to binary converters
inferred← citeshttps://doi.org/10.1109/tc.2002.1146705openalex-snapshot
Diminished-one modulo 2/sup n/+1 adder design
inferred← citeshttps://doi.org/10.1109/tc.2003.1244938openalex-snapshot
Modulo 2/sup n/ ± adder design using select-prefix blocks
inferred← citeshttps://doi.org/10.1109/tcsi.2003.817789openalex-snapshot
An efficient reverse converter for the 4-moduli set [2/sup n/ - 1, 2/sup n, 2/sup n + 1, 2/sup 2n/ + 1] based on the new chinese remainder theorem
inferred← citeshttps://doi.org/10.1109/tcsi.2007.890623openalex-snapshot
A Residue-to-Binary Converter for a New 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/tvt.2002.804850openalex-snapshot
A residue number system based parallel communication scheme using orthogonal signaling. I. System outline
inferred← citeshttps://doi.org/10.1109/twc.2013.031813.121113openalex-snapshot
Performance of Systematic RRNS Based Space-Time Block Codes with Probability-Aware Adaptive Demapping
inferred← citeshttps://doi.org/10.1142/s0218126605002726openalex-snapshot
ON THE DESIGN OF EFFICIENT MODULAR ADDERS
inferred← citeshttps://doi.org/10.1142/s021812660700371xopenalex-snapshot
FAST RESIDUE-TO-BINARY CONVERSION USING BASE EXTENSION AND THE CHINESE REMAINDER THEOREM
inferred← citeshttps://doi.org/10.14419/jacst.v1i4.269openalex-snapshot
Study of error control capability for the new moduli set {22n+1+2n-1, 22n+1-1, 2n-1, 23n,23n+1-1}
inferred← citeshttps://doi.org/10.32657/10356/2379openalex-snapshot
VLSI efficient architectures for triple moduli based RNS computations
inferred← citeshttps://doi.org/10.5120/ijca2018916106openalex-snapshot
Residue Number System: An Important Application in Bioinformatics
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.