학술논문

LOW-COMPLEXITY BIT-PARALLEL MULTIPLIERS FOR A CLASS OF GF(2m) BASED ON MODIFIED BOOTH'S ALGORITHM.
Document Type
Article
Source
International Journal of Computers & Applications; 2007, Vol. 29 Issue 4, p337-345, 9p
Subject
ALGORITHMS
FINITE fields
POLYNOMIALS
TIME delay systems
ALGEBRA
Language
ISSN
1206212X
Abstract
Copyright of International Journal of Computers & Applications is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)