Please use this identifier to cite or link to this item:
|Title:||Radix-2n serial–serial multipliers|
|Keywords:||Computer architecture;VLSI design;Digital circuits;Computer arithmetics|
|Citation:||IEE Proceedings - Circuits Devices and Systems. 151(6): 503-509|
|Abstract:||All serial–serial multiplication structures previously reported in the literature have been confined to bit serial–serial multipliers. An architecture for digit serial–serial multipliers is presented. A set of designs are derived from the radix-2n design procedure, which was first reported by the authors for the design of bit level pipelined digit serial–parallel structures. One significant aspect of the new designs is that they can be pipelined to the bit level and give the designer the flexibility to obtain the best trade-off between throughput rate and hardware cost by varying the digit size and the number of pipelining levels. Also, an area-efficient digit serial–serial multiplier is proposed which provides a 50% reduction in hardware without degrading the speed performance. This is achieved by exploiting the fact that some cells are idle for most of the multiplication operation. In the new design, the computations of these cells are remapped to other cells, which make them redundant. The new designs have been implemented on the S40BG256 device from the SPARTAN family to prove functionality and assess performance.|
|Appears in Collections:||Electronic and Computer Engineering|
Dept of Electronic and Computer Engineering Research Papers
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.