Abstract
A serial-parallel multiplier for two's complement numbers is proposed. Based on an efficient two's complement multiplication algorithm, the proposed multiplier is composed of modularised logic blocks and locally interconnected signal lines, which is suitable for VLSI implementation. It requires 2n + 1 cycles to obtain a complete product, which is the same delay as in the unsigned scheme except that one XOR gate delay is added to each cycle.
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.
