On the public citation graph
Hardware/software codesign of finite field datapath for low-energy Reed-Solomon codecs
0 signed · 48 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/3-540-54303-1_148openalex-snapshot
A 30 Mbits/s (255,223) reed-solomon decoder
inferredcites →https://doi.org/10.1007/978-1-4613-1983-2openalex-snapshot
Finite Fields for Computer Scientists and Engineers
inferredcites →https://doi.org/10.1023/a:1008013818413openalex-snapshot
Low-Energy Digit-Serial/Parallel Finite Field Multipliers
inferredcites →https://doi.org/10.1109/12.392853openalex-snapshot
Architecture for a low complexity rate-adaptive Reed-Solomon encoder
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/25.61362openalex-snapshot
Design of Reed-Solomon (16,12) codec for North American Advanced Train Control System
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/92.661252openalex-snapshot
Efficient semisystolic architectures for finite-field arithmetic
inferredcites →https://doi.org/10.1109/9780470546345openalex-snapshot
Reed-Solomon Codes and Their Applications
inferredcites →https://doi.org/10.1109/icassp.1996.550579openalex-snapshot
Efficient standard basis Reed-Solomon encoder
inferredcites →https://doi.org/10.1109/icassp.1998.678169openalex-snapshot
Low-energy heterogeneous digit-serial Reed-Solomon codecs
inferredcites →https://doi.org/10.1109/iscas.1998.706962openalex-snapshot
Low-energy programmable finite field data path architectures
inferredcites →https://doi.org/10.1109/sips.1998.715790openalex-snapshot
Scheduling strategies for low-energy programmable digit-serial Reed-Solomon codecs
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.1982.1675964openalex-snapshot
Architecture for VLSI Design of Reed-Solomon Encoders
inferredcites →https://doi.org/10.1109/tc.1984.1676351openalex-snapshot
The VLSI Implementation of a Reed—Solomon Encoder Using Berlekamp's Bit-Serial Multiplier Algorithm
inferredcites →https://doi.org/10.1109/tc.1984.1676409openalex-snapshot
Architecture for VLSI Design of Reed-Solomon Decoders
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.1676579openalex-snapshot
A VLSI Design of a Pipeline Reed-Solomon Decoder
inferredcites →https://doi.org/10.1109/vlsisp.1996.558299openalex-snapshot
VLSI architectures for multiplication in GF(2/sup m/) for application tailored digital signal processors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11771-012-1140-0openalex-snapshot
Low latency systolic multipliers for finite field GF (2 m ) based on irreducible polynomials
inferred← citeshttps://doi.org/10.1016/b978-155860702-6/50038-7openalex-snapshot
Introduction to Implementation Generation
inferred← citeshttps://doi.org/10.1016/j.micpro.2009.02.005openalex-snapshot
Instruction set extensions for software defined radio
inferred← citeshttps://doi.org/10.1109/81.956016openalex-snapshot
Approaches to low-power implementations of DSP systems
inferred← citeshttps://doi.org/10.1109/access.2020.3000604openalex-snapshot
Multilevel High-Rate Coding With Twofold Concatenation for IoTs in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/apccas.2004.1412708openalex-snapshot
An universal VLSI architecture for bit-parallel computation in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/asap.2005.42openalex-snapshot
Instruction Set Extensions for Reed-Solomon Encoding and Decoding
inferred← citeshttps://doi.org/10.1109/asscc.2005.251707openalex-snapshot
Universal Architectures for Reed-Solomon Error-and-Erasure Decoder
inferred← citeshttps://doi.org/10.1109/dsd.2006.59openalex-snapshot
Hardware/Software Co-design Applied to Reed-Solomon Decoding for the DMB Standard
inferred← citeshttps://doi.org/10.1109/icassp.2001.940503openalex-snapshot
A class of efficient-encoding generalized low-density parity-check codes
inferred← citeshttps://doi.org/10.1109/iscas.2001.922302openalex-snapshot
Custom VLSI design of efficient low latency and low power finite field multiplier for Reed-Solomon codec
inferred← citeshttps://doi.org/10.1109/isvlsi.2004.1339564openalex-snapshot
Parallel programmable finite field GF (2/sup m/) multipliers
inferred← citeshttps://doi.org/10.1109/mssc.2017.2688720openalex-snapshot
Takao Nishitani: An Outstanding Researcher, Technical Leader, and Mentor
inferred← citeshttps://doi.org/10.1109/sips.2004.1363040openalex-snapshot
A scalable Reed-Solomon decoding processor based on unified finite-field processing element design
inferred← citeshttps://doi.org/10.1109/tc.2007.70741openalex-snapshot
A Novel Architecture for Galois Fields GF(2^m) Multipliers Based on Mastrovito Scheme
inferred← citeshttps://doi.org/10.1109/tcsi.2008.2010143openalex-snapshot
A Universal VLSI Architecture for Reed–Solomon Error-and-Erasure Decoders
inferred← citeshttps://doi.org/10.1109/tcsi.2014.2349577openalex-snapshot
High-Throughput Finite Field Multipliers Using Redundant Basis for FPGA and ASIC Implementations
inferred← citeshttps://doi.org/10.1109/tvlsi.2006.876102openalex-snapshot
Multi-symbol-sliced dynamically reconfigurable Reed-Solomon decoder design based on unified finite-field processing element
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2006080openalex-snapshot
Systolic and Non-Systolic Scalable Modular Designs of Finite Field Multipliers for Reed–Solomon Codec
inferred← citeshttps://doi.org/10.1145/1086297.1086332openalex-snapshot
Instruction set extensions for software defined radio on a multithreaded processor
inferred← citeshttps://doi.org/10.1145/944645.944659openalex-snapshot
Design space exploration of a hardware-software co-designed GF(2m) galois field processor for forward error correction and cryptography
inferred← citeshttps://doi.org/10.1587/transinf.e95.d.2939openalex-snapshot
A Fully Programmable Reed-Solomon Decoder on a Multi-Core Processor Platform
inferred← citeshttps://doi.org/10.5120/ijca2016908878openalex-snapshot
18 Years of Redundant Basis Multipliers over Galois Field
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.