Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.