DocumentCode :
254576
Title :
Subquadratic space complexity digit-serial multiplier over binary extension fields using Toom-Cook algorithm
Author :
Chiou-Yng Lee ; Meher, P.K. ; Wen-Yo Lee
Author_Institution :
Lunghwa Univ. of Sci. & Technol., Taoyuan, Taiwan
fYear :
2014
fDate :
10-12 Dec. 2014
Firstpage :
176
Lastpage :
179
Abstract :
In this paper, we present a new (4,2)-way Toom-Cook algorithm using finite field interpolation. The proposed algorithm uses multi-evaluation scheme to construct a digit-serial multiplier over GF(2m) which involves subquadratic space-complexity. From theoretical analysis, it is found that the proposed architecture has O(mlog4 5) space complexity and O(mlog4 2) latency, which is significantly less than traditional digit-serial multipliers.
Keywords :
Galois fields; computational complexity; digital arithmetic; interpolation; (4,2)-way Toom-Cook algorithm; GF(2m); O(mlog4 2) latency; O(mlog4 5) space complexity; binary extension fields; finite field interpolation; multievaluation scheme; subquadratic space complexity digit-serial multiplier; Algorithm design and analysis; Complexity theory; Computer architecture; Delays; Logic gates; Polynomials; Pulse width modulation; Toom-Cook algorithm; digit-serial multiplication; multi-evaluation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Integrated Circuits (ISIC), 2014 14th International Symposium on
Conference_Location :
Singapore
Type :
conf
DOI :
10.1109/ISICIR.2014.7029517
Filename :
7029517
Link To Document :
بازگشت