Design and Implementation of a High Speed Systolic Serial Multiplier and Squarer for Long Unsigned Integer Using VHDL
author
Abstract:
A systolic serial multiplier for unsigned numbers is presented which operates without zero words inserted between successive data words, outputs the full product and has only one clock cycle latency. 
The multiplier is based on a modified serial/parallel scheme with two adjacent multiplier cells. Systolic concept is a well-known means of intensive computational task through replication of functional units and their repetitive use. Digital signal processing applications often involve high-speed sequential data. Bit-serial processing in particular can result in efficient communications, both within and between VLSI chips because of the reduced number of interconnections required. Serial input multipliers have received considerable attention, particularly for hardwired VLSI algorithms used in signal processing application, due to their minimal chip area required for interconnections. Bit-serial architectures are often used in parallel systems with high connectivity to reduce the wiring down to a reasonable level. The conventional add-shift technique for multiplication, which uses a minimum number of gates, is inexpensive to implement, but too slow to achieve the desired result. Iterative array multipliers are needed to satisfy the high speed requirement of systems. With the advantage of high scale integration, the hardware is not regarded as a major obstacle in implementation.

similar resources
High Speed Modified Booth’s Multiplier for Signed and Unsigned Numbers
In this paper, we have designed a signed booth’s multiplier as well as an unsigned booth’s multiplier for 4 bit, 8 bit and 16 bits performing multiplication on signed and unsigned number. The implementation is done through Verilog on xiling12.4 platform which provide diversity in calculating the various parameters. The unsigned booth multiplication is implemented by doing some modification in t...
full textHigh-Speed Montgomery Modular Multiplication Using High-Radix Systolic Multiplier
A new high-radix systolic multiplier architecture is presented for Montgomery modular multiplication. Using a radix 2, an n-bit modular multiplication only takes about n/w+6 cycles. This leads to a competitive ASIC implementation for RSA and Elliptic Curve Cryptography (ECC).
full textDesign and Verification of High Speed Multiplier
Multiplier is one of the essential element for all digital systems such as digital signal processors, microprocessors etc. In this paper, a new high speed multiplier using booth recoding technique is presented. This algorithm can be implemented by using the radix-8 booth recoding process. The proposed multiplier reduces the partial product array by almost 3/4 th the size of the bits. This reduc...
full textDesign and Optimization of High Speed Multiplier
Two’s complement multipliers are important for a wide range of applications. Paper describes a technique to reduce by one row the maximum height of the partial product array generated by Radix-4 Booth’s multiplier, without any increase in the delay of the partial product generation stage. The design of 8 bit and 16 bit multiplication scheme using different types of multiplier like Array multipl...
full textEasily Testable Array Multiplier Design Using Vhdl
Presents the design of variable array multipliers using VHDL. Multipliers of various operand sizes for different target processes can be implemented using the proposed VHDL based approach. The multipliers will be testable with a constant number of test vectors irrespective of the operand word lengths. A fast test pattern generator is also developed for simulation of the multiplier designs and s...
full textMy Resources
Journal title
volume 26 issue 2
pages 1- 14
publication date 2008-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023