New architectures for serial-serial multiplication

Traditional serial-serial multiplier structures suffer from an inefficient generation of partial products, which leads to hardware overuse and slow speed systems. In this paper, two new architectures for fully serial multiplication are presented. To the best of our knowledge, the first structure is the first fully serial multiplier reported in the literature with comparable performance-in terms of speed-to existing serial-parallel multipliers. The second structure requires an extra multiplexer in the clock path thus making it slower, but has the merit of reducing the latency of the multiplier. Both structures are systolic and need near communication links only. Compared with available architectures, an FPGA based implementation has shown an increase in the speed of the multipliers by about 200% for the first structure and 150% for the second structure.

[1]  I-Ngo Chen,et al.  An 0(n) Parallel Multiplier with Bit-Sequential Input and Output , 1979, IEEE Transactions on Computers.

[2]  V. Thomas Rhyne,et al.  A Canonical Bit-Sequential Multiplier , 1982, IEEE Transactions on Computers.

[3]  S. Kung,et al.  VLSI Array processors , 1985, IEEE ASSP Magazine.

[4]  Paolo Ienne,et al.  Bit-Serial Multipliers and Squarers , 1994, IEEE Trans. Computers.

[5]  Keshab K. Parhi,et al.  Design and implementation of low-power digit-serial multipliers , 1997, Proceedings International Conference on Computer Design VLSI in Computers and Processors.

[6]  Ray Andraka,et al.  A survey of CORDIC algorithms for FPGA based computers , 1998, FPGA '98.

[7]  A. Amira,et al.  A Parameterised FPGA Implementation of Discrete Orthogonal Transforms using a Bit-Level Structure , 2000 .

[8]  M. K. Ibrahim,et al.  Area-time efficient serial-serial multipliers , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).