Design and implementation of a high-speed reconfigurable multiplier

On the basis of analyzing the theory of multiplication operation in block ciphers and modular multiplication algorithms of different operation width, this paper present a high-speed reconfigurable multiplier, which can be reconfigured to perform 16-bit, 32-bit multiplication and modulo 216+1 multiplication operation, and then optimize each critical block. The design is realized using Altera's FPGA. Synthesis, placement and routing of reconfigurable multiplier have accomplished on 0.18 mum SMIC technology. The result proves that the propagation time of the critical path is 2.84 ns. The reconfigurable multiplier is able to achieve relatively high performance in the block cipher algorithms processing.

[1]  Oscal T.-C. Chen,et al.  Low-power multipliers by minimizing switching activities of partial products , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[2]  J. L. Smith,et al.  A One-Microsecond Adder Using One-Megacycle Circuitry , 1956, IRE Trans. Electron. Comput..

[3]  Romesh M. Jessani,et al.  Comparison of Single- and Dual-Pass Multiply-Add Fused Floating-Point Units , 1998, IEEE Trans. Computers.

[4]  Huey Ling High Speed Binary Adder , 1981, IBM J. Res. Dev..

[5]  Andrew D. Booth,et al.  A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .

[6]  Yutai Ma A Slimplified Architecture for Modulo (2n + 1) Multiplication , 1998, IEEE Trans. Computers.

[7]  H. T. Kung,et al.  A Regular Layout for Parallel Adders , 1982, IEEE Transactions on Computers.