Back to Search
Start Over
Comment on “Subquadratic Space-Complexity Digit-Serial Multipliers Over GF(2^m) Using Generalized $(a, b)$-Way Karatsuba Algorithm”.
- Source :
- IEEE Transactions on Circuits & Systems. Part I: Regular Papers; Aug2016, Vol. 63 Issue 8, p1316-1319, 4p
- Publication Year :
- 2016
-
Abstract
- In the literature, the generalized $(a, b)$- way Karatsuba algorithm (KA) is a well-known high-precision technique for implementing a subquadratic digit-serial multiplication. We present here the corrections to the space and complexities pertaining to addition operations in $(a, b)$-way KA approach. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 15498328
- Volume :
- 63
- Issue :
- 8
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Circuits & Systems. Part I: Regular Papers
- Publication Type :
- Periodical
- Accession number :
- 117416507
- Full Text :
- https://doi.org/10.1109/TCSI.2016.2568213