scientific article; zbMATH DE number 5708383
From MaRDI portal
Publication:3560897
Recommendations
- Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers
- An Algorithm for Multiplication in Modular Arithmetic
- A decimal multiplication algorithm for microcomputers
- Fast binary multiplication by performing dot counting and complement recoding
- New methods for binary multiplication
- scientific article; zbMATH DE number 5504474
- Low complexity bit-parallel multipliers for a class of finite fields
- An iterative modular multiplication algorithm
- A fast modular multiplication algorithm
Cited in
(6)- A delay efficient Vedic multiplier
- Run-time-reconfigurable multi-precision floating-point matrix multiplier intellectual property core on FPGA
- High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree
- scientific article; zbMATH DE number 60194 (Why is no real title available?)
- Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity
- Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3560897)
