Title :
Evaluating the Hardware Performance of a Million-Bit Multiplier
Author :
Doroz, Yarkin ; Ozturk, E. ; Sunar, Berk
Author_Institution :
Worcester Polytech. Inst., Worcester, MA, USA
Abstract :
In this work we present the first full and complete evaluation of a very large multiplication scheme in custom hardware. We designed a novel architecture to realize a million-bit multiplication architecture based on the Schönhage-Strassen Algorithm and the Number Theoretical Transform (NTT). The construction makes use of an innovative cache architecture along with processing elements customized to match the computation and access patterns of the FFT-based recursive multiplication algorithm. When synthesized using a 90nm TSMC library operating at a frequency of 666 MHz, our architecture is able to compute the product of integers in excess of a million bits in 7.74 milliseconds. Estimates show that the performance of our design matches that of previously reported software implementations on a high-end 3 Ghz Intel Xeon processor, while requiring only a tiny fraction of the area.
Keywords :
digital arithmetic; fast Fourier transforms; matrix multiplication; microprocessor chips; FFT-based recursive multiplication algorithm; Intel Xeon processor; Schonhage-Strassen algorithm; TSMC library; access pattern; cache architecture; computation pattern; fast Fourier transforms; frequency 666 MHz; million-bit multiplication architecture; million-bit multiplier; multiplication scheme; multiplier hardware performance; number theoretical transform; processing elements; size 90 nm; Algorithm design and analysis; Computer architecture; Hardware; Indexes; Routing; Software algorithms; Transforms; FFT; Number Theoretical Transform; homomorphic encryption; large multiplier;
Conference_Titel :
Digital System Design (DSD), 2013 Euromicro Conference on
Conference_Location :
Los Alamitos, CA
DOI :
10.1109/DSD.2013.108