Sciweavers

192 search results - page 1 / 39
» Arithmetic Optimization Using Carry-Save-Adders
Sort
View
DAC
1998
ACM
13 years 11 months ago
Arithmetic Optimization Using Carry-Save-Adders
Carry-save-adderCSA is the most often used type of operation in implementing a fast computation of arithmetics of register-transfer level design in industry. This paper establis...
Taewhan Kim, William Jao, Steven W. K. Tjiang
DATE
2006
IEEE
85views Hardware» more  DATE 2006»
14 years 1 months ago
Optimizing high speed arithmetic circuits using three-term extraction
Carry Save Adder (CSA) trees are commonly used for high speed implementation of multi-operand additions. We present a method to reduce the number of the adders in CSA trees by ext...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
ICCD
2004
IEEE
138views Hardware» more  ICCD 2004»
14 years 4 months ago
Design and Implementation of Scalable Low-Power Montgomery Multiplier
In this paper, an efficient Montgomery multiplier is introduced for the modular exponentiation operation, which is fundamental to numerous public-key cryptosystems. Four aspects a...
Hee-Kwan Son, Sang-Geun Oh
VLSI
2010
Springer
13 years 5 months ago
Design of low-complexity and high-speed digital Finite Impulse Response filters
—In this paper, we introduce a design methodology to implement low-complexity and high-speed digital Finite Impulse Response (FIR) filters. Since FIR filters suffer from a larg...
Diego Jaccottet, Eduardo Costa, Levent Aksoy, Paul...
DELTA
2006
IEEE
13 years 11 months ago
Modified Montgomery Modular Multiplication Using 4: 2 Compressor and CSA Adder
The efficiency of the Public Key encryption systems like RSA and ECC can be improved with the adoption of a faster multiplication scheme. In this paper, Modified Montgomery multip...
Himanshu Thapliyal, Anvesh Ramasahayam, Vivek Redd...