Bit-level systolic arrays for modular multiplication |
| |
Authors: | ?etin K Ko? and Ching Yu Hung |
| |
Institution: | (1) Department of Electrical Engineering, University of Houston, 77204 Houston, TX |
| |
Abstract: | This paper presents bit-level cellular arrays implementing Blakley's algorithm for multiplication of twon-bit integers modulo anothern-bit integer. The semi-systolic version uses 3n(n+3) single-bit carry save adders and 2n copies of 3-bit carry look-ahead logic, and computes a pair of binary numbers (C, S) in 3n clock cycles such thatC+S 0, 2N). The carry look-ahead logic is used to estimate the sign of the partial product, which is needed during the reduction process. The final result in the correct range 0,N) can easily be obtained by computingC+S andC+S–N, and selecting the latter if it is positive; otherwise, the former is selected. We construct a localized process dependence graph of this algorithm, and introduce a systolic array containing 3nw simple adder cells. The latency of the systolic array is 6n+w–2, wherew= n/2 . The systolic version does not require broadcast and can be used to efficiently compute several modular multiplications in a pipelined fashion, producing a result in every clock cycle. |
| |
Keywords: | modular multiplication carry save adders sign estimation systolic array scheduling |
本文献已被 SpringerLink 等数据库收录! |
|