By Topic

Understanding VLSI bit serial multipliers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
P. T. Balsara ; Dept. of Electr. Eng., Texas Univ., Dallas, TX, USA ; D. T. Harper

The efficient design of bit serial multipliers is necessary in many applications areas as diverse as digital communications and the implementation of artificial neural networks. Because of these applications, bit serial architectures are a part of courses in computer arithmetic, very large scale integration (VLSI) architectures, and digital signal processing. Comprehensive descriptions for three bit serial algorithms for signed multiplication are presented. The primary difference among the three algorithms is in the recoding of the multipliers, Each bit serial multiplier is systematically derived from its equivalent parallel multiplier found in textbooks. Furthermore, complete CMOS layouts for the three multipliers are constructed, simulated, and compared

Published in:

IEEE Transactions on Education  (Volume:39 ,  Issue: 1 )