A new high radix-2r (r≥8) multibit recoding algorithm for large operand size (N≥32) multipliers
Abstract
References
Index Terms
- A new high radix-2r (r≥8) multibit recoding algorithm for large operand size (N≥32) multipliers
Recommendations
Approximate Radix-8 Booth Multipliers for Low-Power and High-Performance Operation
The Booth multiplier has been widely used for high performance signed multiplication by encoding and thereby reducing the number of partial products. A multiplier using the radix-<inline-formula><tex-math notation="LaTeX">$4$ </tex-math><alternatives><...
Parallel High-Radix Nonrestoring Division
An algorithm for high-radix nonrestoring division is proposed which combines a cost-efficient quotient estimation technique with collapsing of the division into one operation each iteration. The quotient estimation technique is a direct combinatorial ...
Very High Radix Scalable Montgomery Multipliers
IWSOC '05: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time ApplicationsThis paper describes a very high radix scalable Montgomery multiplier. It extends the radix-2 Tenca-Koç scalable architecture using w v-bit integer multipliers in place of AND gates. The new design can perform 1024-bit modular exponentiation in 6.6 ms ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 98Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in