کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4634851 | 1340701 | 2007 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Fast binary multiplication by performing dot counting and complement recoding
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In this paper, we present a new computation method by combining the dots counting method and the complement recoding method to efficiently evaluate modular multiplication in binary multiplications. The LUT (Look-Up Table) technique can be adopted in our proposed method to efficiently reduce the number of multiplications. And the proposed method can be easily implemented for the hardware. Numerous examples are provided to show the efficient and easy operations of the binary multiplication method. In average case, the worst case for the Hamming weight of the product XâY is uv4, where u is the bit-length of multiplicand X, v is the bit-length of multiplier Y. If the proposed method is applied, we could effectively reduce the Hamming weight of the product XâY to 0.25u.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 191, Issue 1, 1 August 2007, Pages 132-139
Journal: Applied Mathematics and Computation - Volume 191, Issue 1, 1 August 2007, Pages 132-139
نویسندگان
Chia-Long Wu, Der-Chyuan Lou, Te-Jen Chang,