Abstract
Three serial/parallel multipliers are introduced, which both receive the serial input data and produce the serial product in a most-significant-bit-first (MSB-first) fashion, Advantages of using MSB-first multiplication over conventional least-significant-bit-first multiplication include: efficient calculation of MSB-first data from analogue/digital conversion; efficient interfacing with MSB-first algorithms such as square root and division; and simple truncation of the product. The approach does not utilise any special number system, but multiplier architectures both for unsigned and two's complement number representation (both for the direct and the Baugh-Wooley algorithms) are provided.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
