کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
427770 | 686555 | 2011 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Multiplexer implementation of low-complexity polynomial basis multiplier in GF(m2)GF(2m) using all one polynomial
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Polynomial basis multipliers are realized by conventional AND and XOR gates. In this study, polynomial basis multiplier is implemented by multiplexers rather than traditional AND and XOR gates. Two bits are processed at the same time. The proposed multiplexer-based multiplier saves about 14% space complexity as compared to other existing multipliers. Furthermore, the proposed multiplier also saves about 37% time complexity (for example, m=156m=156) while comparing with other existing multipliers.
► Polynomial basis multiplier is implemented by multiplexers.
► Two bits in the proposed multiplier are processed at the same time.
► The proposed multiplexer-based multiplier saves both space and time complexities.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Processing Letters - Volume 111, Issues 21–22, 15 November 2011, Pages 1044–1047
Journal: Information Processing Letters - Volume 111, Issues 21–22, 15 November 2011, Pages 1044–1047
نویسندگان
Che Wun Chiou, Chiou-Yng Lee, Yun-Chi Yeh,