Constant integer multiplication using minimum adders
From MaRDI portal
Recommendations
- Simplified design of constant coefficient multipliers
- Multiplierless multiple constant multiplication
- Minimum number of adders for implementing a multiplier and its application to the design of multiplierless digital filters
- Constant number serial pipeline multipliers
- Low-power constant-coefficient multiplier generator
Cited in
(19)- Shallow circuits and concise formulae for multiple addition and multiplication
- Low-power constant-coefficient multiplier generator
- Algebraic methods for optimizing constant multiplications in linear systems
- Simplified design of constant coefficient multipliers
- Garbage-free reversible constant multipliers for arbitrary integers
- Multiplierless multiple constant multiplication
- Carry propagation in multiplication by constants
- Parallel multipliers with NOR gates based on G-minimum adders
- scientific article; zbMATH DE number 1962050 (Why is no real title available?)
- Implementing multiplication with split read-only memory
- A new design technique for column compression multipliers
- Minimum number of adders for implementing a multiplier and its application to the design of multiplierless digital filters
- Minimal digit sets for parallel addition in non-standard numeration systems
- Formal Methods in Computer-Aided Design
- Constant number serial pipeline multipliers
- Backtracking-assisted multiplication
- Fast discrete Fourier transform computations using the reduced adder graph technique
- Hamming weight pyramid -- a new insight into canonical signed digit representation and its applications
- Reconfigurable multiplier blocks: Structures, algorithm and applications
This page was built for publication: Constant integer multiplication using minimum adders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4325342)
