Pages that link to "Item:Q937456"
From MaRDI portal
The following pages link to Multiplexer-based bit-parallel systolic multipliers over GF(\(2^m)\) (Q937456):
Displaying 12 items.
- Partitioned systolic architecture for modular multiplication in \(\mathrm{GF}(2^{m})\) (Q294869) (← links)
- Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (Q1944198) (← links)
- Novel hybrid-size digit-serial systolic multiplier over \(\mathrm{GF}(2^m)\) (Q2333849) (← links)
- Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm (Q2507343) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- A dual basis bit-serial systolic multiplier for GF(2 ) (Q3122545) (← links)
- VLSI algorithms, architectures, and implementation of a versatile GF(2/sup m/) processor (Q3417043) (← links)
- Systolic architectures for multiplication over finite field \(GF(2^ m)\) (Q3975194) (← links)
- Derivation of Reduced Test Vectors for Bit-Parallel Multipliers over GF(2^m) (Q4564084) (← links)
- Low-Latency High-Throughput Systolic Multipliers Over <formula formulatype="inline"><tex Notation="TeX">$GF(2^{m})$</tex> </formula> for NIST Recommended Pentanomials (Q5007724) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901247) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901302) (← links)
