On the public citation graph
A new bit-serial systolic multiplier over GF(2/sup m/)
0 signed · 44 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/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1049/ip-i-1.1981.0010openalex-snapshot
Introduction to V.L.S.I. Systems
inferredcites →https://doi.org/10.1109/tc.1984.1676441openalex-snapshot
Systolic Multipliers for Finite Fields GF(2m)
inferredcites →https://doi.org/10.1109/tc.1985.1676616openalex-snapshot
VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11424758_53openalex-snapshot
Compact Linear Systolic Arrays for Multiplication Using a Trinomial Basis in GF(2 m ) for High Speed Cryptographic Processors
inferred← citeshttps://doi.org/10.1007/11676935_52openalex-snapshot
Unidirectional Two Dimensional Systolic Array for Multiplication in GF(2 m ) Using LSB First Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-54195-0_62openalex-snapshot
Systolic architectures for multiplication over finite field GF(2m)
inferred← citeshttps://doi.org/10.1007/3-540-57936-2_31openalex-snapshot
A finite field arithmetic unit VLSI chip
inferred← citeshttps://doi.org/10.1007/bf02407028openalex-snapshot
Bit-level systolic arrays for finite-field multiplications
inferred← citeshttps://doi.org/10.1016/0167-9260(95)00007-3openalex-snapshot
A dual basis bit-serial systolic multiplier for GF(2 )
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2008.09.009openalex-snapshot
More efficient systolic arrays for multiplication in GF() using LSB first algorithm with irreducible polynomials and trinomials
inferred← citeshttps://doi.org/10.1016/j.hcc.2025.100356openalex-snapshot
A compact and energy-efficient semi-systolic field multiplier for secure IoT edge devices in smart city applications
inferred← citeshttps://doi.org/10.1016/j.vlsi.2007.05.001openalex-snapshot
Low-complexity bit-parallel systolic multipliers over GF(2 )
inferred← citeshttps://doi.org/10.1016/s0898-1221(98)00014-5openalex-snapshot
Polynomial division using left shift register
inferred← citeshttps://doi.org/10.1023/a:1007959127141openalex-snapshot
Novel Radix Finite Field Multiplier for GF(2m)
inferred← citeshttps://doi.org/10.1049/iet-cds:20060314openalex-snapshot
Scalable and systolic Montgomery multiplier over GF(2 m ) generated by trinomials
inferred← citeshttps://doi.org/10.1049/ip-cds:20050188openalex-snapshot
Low-complexity bit-parallel systolic architectures for computing A(x)B2(x) over GF(2m)
inferred← citeshttps://doi.org/10.1049/ip-cdt:19981906openalex-snapshot
Digit-serial systolic multiplier for finite fields GF(2m)
inferred← citeshttps://doi.org/10.1049/ip-com:19981799openalex-snapshot
Systolic decoder for burst error-correcting codes
inferred← citeshttps://doi.org/10.1109/12.156540openalex-snapshot
Bit-serial systolic divider and multiplier for finite fields GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/3dpvt.2004.40openalex-snapshot
Construction of animal models and motion synthesis in 3D virtual environments using image sequences
inferred← citeshttps://doi.org/10.1109/82.488283openalex-snapshot
ACE: a VLSI chip for Galois field GF(2/sup m/) based exponentiation
inferred← citeshttps://doi.org/10.1109/82.868459openalex-snapshot
High-speed easily testable Galois-field inverter
inferred← citeshttps://doi.org/10.1109/92.219904openalex-snapshot
SIGMA: a VLSI systolic array implementation of a Galois field GF(2/sup m/) based multiplication and division algorithm
inferred← citeshttps://doi.org/10.1109/ainaw.2007.225openalex-snapshot
Low-Complexity Parallel Systolic Architectures for Computing Multiplication and Squaring over FG(2^m)
inferred← citeshttps://doi.org/10.1109/ats.1998.741629openalex-snapshot
On-line error detection schemes for a systolic finite-field inverter
inferred← citeshttps://doi.org/10.1109/edac.1993.386410openalex-snapshot
Systolic VLSI implementations of a Galois field arithmetic algorithms
inferred← citeshttps://doi.org/10.1109/icjece.2020.3035182openalex-snapshot
Compact Bit-Parallel Systolic Multiplier Over GF(2m)
inferred← citeshttps://doi.org/10.1109/icsmc.2006.384557openalex-snapshot
Low-Complexity Bit-Parallel Systolic Multipliers over GF(2m)
inferred← citeshttps://doi.org/10.1109/icvd.1993.669630openalex-snapshot
SIGMA: A VLSI Chip for Galois Field GF(2m) Based Multiplication and Division
inferred← citeshttps://doi.org/10.1109/icvd.1994.282702openalex-snapshot
Cellular automata based VLSI architecture for computing multiplication and inverses in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/icvd.1994.282705openalex-snapshot
ACE: a VLSI chip for Galois field GF(2/sup m/) based exponentiation
inferred← citeshttps://doi.org/10.1109/ipps.1992.223032openalex-snapshot
A systolic algorithm and architecture for Galois field arithmetic
inferred← citeshttps://doi.org/10.1109/iscas.2003.1206392openalex-snapshot
A systolic multiplier with LSB first algorithm over GF(2/sup m/) which is as efficient as the one with MSB first algorithm
inferred← citeshttps://doi.org/10.1109/tc.2012.239openalex-snapshot
Low-Latency Digit-Serial Systolic Double Basis Multiplier over $\mbi GF{(2^m})$ Using Subquadratic Toeplitz Matrix-Vector Product Approach
inferred← citeshttps://doi.org/10.1109/vlsisp.1994.574755openalex-snapshot
Efficient power based Galois Field Arithmetic architectures
inferred← citeshttps://doi.org/10.3109/01480540903311043openalex-snapshot
The potential dermal irritating effect of residual (meth)acrylic monomers in pressure sensitive adhesive tapes
inferred← citeshttps://doi.org/10.3390/app15052660openalex-snapshot
Enhancing Security and Efficiency in IoT Assistive Technologies: A Novel Hybrid Systolic Array Multiplier for Cryptographic Algorithms
inferred← citeshttps://doi.org/10.3390/cryptography9020037openalex-snapshot
Enhancing Security for Resource-Constrained Smart Cities IoT Applications: Optimizing Cryptographic Techniques with Effective Field Multipliers
inferred← citeshttps://doi.org/10.3390/math10050815openalex-snapshot
Low-Space Bit-Parallel Systolic Structure for AOP-Based Multiplier Suitable for Resource-Constrained IoT Edge Devices
inferred← citeshttps://doi.org/10.3390/math11010111openalex-snapshot
Low-Complexity One-Dimensional Parallel Semi-Systolic Structure for Field Montgomery Multiplication Algorithm Perfect for Small IoT Edge Nodes
inferred← citeshttps://doi.org/10.3390/systems13030154openalex-snapshot
Optimizing Security of Radio Frequency Identification Systems in Assistive Devices: A Novel Unidirectional Systolic Design for Dickson-Based Field Multiplier
inferred← citeshttps://doi.org/10.3745/kipsta.2002.9a.3.271openalex-snapshot
Design of Multiple-Valued Logic Circuits on Reed-Muller Expansions Using Perfect Shuffle
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.