On the public citation graph

A systolic power-sum circuit for GF(2/sup m/)

0 signed · 73 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1109/12.5988openalex-snapshot
On the VLSI design of a pipeline Reed-Solomon decoder using systolic arrays
inferredcites →https://doi.org/10.1109/26.241736openalex-snapshot
High-speed decoder of Reed-Solomon codes
inferredcites →https://doi.org/10.1109/31.135751openalex-snapshot
Systolic array implementation of multipliers for finite fields GF(2/sup m/)
inferredcites →https://doi.org/10.1109/t-c.1971.223173openalex-snapshot
A Cellular-Array Multiplier for GF(2m)
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)
inferredcites →https://doi.org/10.1109/tc.1987.1676857openalex-snapshot
A Construction Method of High-Speed Decoders Using ROM's for Bose–Chaudhuri–Hocquenghem and Reed–Solomon Codes
inferredcites →https://doi.org/10.1109/tit.1982.1056591openalex-snapshot
Bit-serial Reed - Solomon encoders

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-36087-5_17openalex-snapshot
Parallel Algorithm and Architecture for Public-Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/3-540-36159-6_18openalex-snapshot
Low Complexity Bit Serial Systolic Multipliers over GF(2m) for Three Classes of Finite Fields
inferred← citeshttps://doi.org/10.1007/3-540-44839-x_100openalex-snapshot
Computational Algorithm and Architecture for AB2 Multiplication in Finite Fields
inferred← citeshttps://doi.org/10.1007/3-540-44839-x_93openalex-snapshot
Efficient Architecture for Exponentiation and Division in GF(2m) Using Irreducible AOP
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_18openalex-snapshot
Efficient Power-Sum Systolic Architectures for Public-Key Cryptosystems in GF(2m)
inferred← citeshttps://doi.org/10.1007/3-540-45801-8_40openalex-snapshot
A Power-Sum Systolic Architecture in GF(2m)
inferred← citeshttps://doi.org/10.1007/3-540-45811-5_22openalex-snapshot
Inversion/Division Systolic Architecture for Public-Key Cryptosystems in GF(2m)
inferred← citeshttps://doi.org/10.1007/978-3-540-24669-5_129openalex-snapshot
Semi-systolic Architecture for AB 2 Operation over GF(2 m )
inferred← citeshttps://doi.org/10.1007/978-3-540-24707-4_55openalex-snapshot
Bit-Serial Multipliers for Exponentiation and Division in GF(2 m ) Using Irreducible AOP
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_67openalex-snapshot
New Digit-Serial Systolic Arrays for Power-Sum and Division Operation in GF(2 m )
inferred← citeshttps://doi.org/10.1007/978-3-540-24768-5_10openalex-snapshot
Digit-Serial AB 2 Systolic Array for Division in GF(2 m )
inferred← citeshttps://doi.org/10.1007/978-3-540-39881-3_20openalex-snapshot
Cellular Automata Based Multiplier for Public-Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/s10440-006-9071-0openalex-snapshot
Scalable and Systolic Architecture for Computing Double Exponentiation Over GF(2 m )
inferred← citeshttps://doi.org/10.1007/s11390-006-0887-xopenalex-snapshot
Low-Complexity Bit-Parallel Multiplier over GF(2m) Using Dual Basis Representation
inferred← citeshttps://doi.org/10.1007/s11390-007-9003-0openalex-snapshot
Unified Parallel Systolic Multiplier Over ${\it GF}(2^{m})$
inferred← citeshttps://doi.org/10.1016/j.camwa.2005.07.019openalex-snapshot
A novel approach for bit-serial AB2 multiplication in finite fields GF(2m)
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2007.09.004openalex-snapshot
Multiplexer-based bit-parallel systolic multipliers over GF(2m)
inferred← citeshttps://doi.org/10.1016/j.csi.2007.11.015openalex-snapshot
Area and time efficient AB2 multipliers based on cellular automata
inferred← citeshttps://doi.org/10.1016/j.vlsi.2004.01.003openalex-snapshot
Low complexity bit-parallel systolic architecture for computing C+AB2 over a class of GF(2 )
inferred← citeshttps://doi.org/10.1023/a:1008013818413openalex-snapshot
Low-Energy Digit-Serial/Parallel Finite Field Multipliers
inferred← citeshttps://doi.org/10.1049/el.2015.3681openalex-snapshot
Parallel in/out systolic AB 2 architecture with low complexity in GF (2 m )
inferred← citeshttps://doi.org/10.1049/ip-cds:20030337openalex-snapshot
Computation of AB2 multiplication in GF(2m) using low-complexity systolic architecture
inferred← citeshttps://doi.org/10.1049/ip-cds:20040161openalex-snapshot
Design of new AB2 multiplier over GF(2m) using cellular automata
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-cds:20059054openalex-snapshot
Digit-serial AB2 systolic architecture in GF(2m)
inferred← citeshttps://doi.org/10.1049/ip-cds:20059059openalex-snapshot
Low-power exponent architecture in finite fields
inferred← citeshttps://doi.org/10.1049/ip-cdt:20030061openalex-snapshot
Low complexity bit-parallel systolic multiplier over GF(2m) using irreducible trinomials
inferred← citeshttps://doi.org/10.1080/02564602.2014.891383openalex-snapshot
Efficient Cellular Automata Based MontgomeryAB2Multipliers overGF(2m)
inferred← citeshttps://doi.org/10.1109/12.888047openalex-snapshot
New systolic arrays for C+AB/sup 2/, inversion, and division in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/12.926154openalex-snapshot
Bit-parallel systolic multipliers for GF(2/sup m/) fields defined by all-one and equally spaced polynomials
inferred← citeshttps://doi.org/10.1109/76.212719openalex-snapshot
A high-speed real-time binary BCH decoder
inferred← citeshttps://doi.org/10.1109/82.633444openalex-snapshot
VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/82.877151openalex-snapshot
A low-complexity power-sum circuit for GF(2/sup m/) and its applications
inferred← citeshttps://doi.org/10.1109/82.938363openalex-snapshot
Low-complexity bit-parallel systolic architecture for computing AB/sup 2/+C in a class of finite field GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/92.661252openalex-snapshot
Efficient semisystolic architectures for finite-field arithmetic
inferred← citeshttps://doi.org/10.1109/apccas.2002.1114972openalex-snapshot
Low-complexity systolic multiplier over GF(2/sup m/) using weakly dual basis
inferred← citeshttps://doi.org/10.1109/apccas.2006.342062openalex-snapshot
New Bit-Parallel Systolic Multiplier over GF(2m) Using The Modified Booth's Algorithm
inferred← citeshttps://doi.org/10.1109/arith.2001.930103openalex-snapshot
Bit-parallel systolic modular multipliers for a class of GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/arith.2003.1207679openalex-snapshot
A low complexity and a low latency bit parallel systolic multiplier over GF(2/sup m/) using an optimal normal basis of type II
inferred← citeshttps://doi.org/10.1109/cason.2010.32openalex-snapshot
Concurrent Error Detection in Systolic Array AB^2 Multiplier Using Linear Codes
inferred← citeshttps://doi.org/10.1109/icassp.1995.480130openalex-snapshot
Low latency standard basis GF(2/sup m/) multiplier and squarer architectures
inferred← citeshttps://doi.org/10.1109/icecs.2003.1301678openalex-snapshot
FPGA based realization of a reduced complexity high speed decoder for error correction
inferred← citeshttps://doi.org/10.1109/icosp.2000.894561openalex-snapshot
The design of a low-complexity systolic architecture for fast bit-parallel exponentiation in a class of GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/iscas.1994.409232openalex-snapshot
VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/iscas.1997.621557openalex-snapshot
A new systolic squarer and its application to compute exponentiations in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/iscas.1998.706981openalex-snapshot
VLSI architectures of divider for finite field GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/iscas.1999.777943openalex-snapshot
A low time-complexity, hardware-efficient bit-parallel power-sum circuit for finite fields GF(2/sup M/)
inferred← citeshttps://doi.org/10.1109/iscas.2001.922244openalex-snapshot
Cellular-array power-sum circuits over programmable finite field GF(2''')
inferred← citeshttps://doi.org/10.1109/iscas.2001.922303openalex-snapshot
New bit-parallel systolic multipliers for a class of GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/ismvl.2003.1201419openalex-snapshot
Dynamic reliability indices for multi-state system
inferred← citeshttps://doi.org/10.1109/itict.2007.4475666openalex-snapshot
A low-area, high-speed, processor array architecture for field ALU over GF (2m)
inferred← citeshttps://doi.org/10.1109/tcsi.2008.919757openalex-snapshot
Arithmetic Unit for Finite Field ${\rm GF}(2^{m})$
inferred← citeshttps://doi.org/10.1109/tencon.2001.949623openalex-snapshot
Architecture of the high-speed standard basis multiplier with delay-boxes over GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/vlsisp.1994.574755openalex-snapshot
Efficient power based Galois Field Arithmetic architectures
inferred← citeshttps://doi.org/10.1109/vtsa.2001.934542openalex-snapshot
High-speed bit-parallel systolic multipliers for a class of GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/vtsa.2001.934544openalex-snapshot
New efficient low-complexity architecture for performing inversion and divisions
inferred← citeshttps://doi.org/10.1145/3056662.3056676openalex-snapshot
Efficient montgomery AB 2 multiplier for finite fields defined by irreducible all-one polynomials
inferred← citeshttps://doi.org/10.14372/iemek.2012.7.2.079openalex-snapshot
Design of Low-Latency Architecture for AB2 Multiplication over Finite Fields GF(2m)
inferred← citeshttps://doi.org/10.1587/elex.16.20190080openalex-snapshot
Low-latency semi-systolic architecture for multiplication over finite fields
inferred← citeshttps://doi.org/10.1587/transele.2021ecs6006openalex-snapshot
Bit-Parallel Systolic Architecture for AB and AB2 Multiplications over GF(2m)
inferred← citeshttps://doi.org/10.3745/kipsta.2004.11a.1.001openalex-snapshot
A Design of Cellular Array Parallel Multiplier on Finite Fields GF(2m)
inferred← citeshttps://doi.org/10.4218/etrij.17.0116.0770openalex-snapshot
Low-Power and Low-Hardware Bit-Parallel Polynomial Basis Systolic Multiplier over GF(2 m ) for Irreducible Polynomials
inferred← citeshttps://doi.org/10.6109/jkiice.2011.15.3.510openalex-snapshot
Construction of High-Speed Parallel Multiplier on Finite Fields GF(3m)
inferred← citeshttps://doi.org/10.9708/jksci.2012.17.3.001openalex-snapshot
A Study on the Construction of Parallel Multiplier over GF2m)
inferred← citeshttps://doi.org/10.9708/jksci.2015.20.2.001openalex-snapshot
Design of High-Speed Parallel Multiplier on Finite Fields GF(3m)
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.