Back to Search
Start Over
New Block Recombination for Subquadratic Space Complexity Polynomial Multiplication Based on Overlap-Free Approach.
- Source :
-
IEEE Transactions on Computers . Aug2017, Vol. 66 Issue 8, p1396-1406. 11p. - Publication Year :
- 2017
-
Abstract
- In this paper, we present new parallel polynomial multiplication formulas which result in subquadratic space complexity. The schemes are based on a recently proposed block recombination of polynomial multiplication formula. The proposed two-way, three-way, and four-way split polynomial multiplication formulas achieve the smallest space complexities. Moreover, by providing area-time tradeoff method, the proposed formulas enable one to choose a parallel formula for polynomial multiplication which is suited for a design environment. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189340
- Volume :
- 66
- Issue :
- 8
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Computers
- Publication Type :
- Academic Journal
- Accession number :
- 124027423
- Full Text :
- https://doi.org/10.1109/TC.2017.2669998