Abstract
A new parallel multiplier structure is proposed. In this multiplier the operands are partitioned into four groups of bits to produce 16 partial product terms. The novelty of the new structure is that these partial product terms are each repartioned further into two groups. This will enable the use of parallel counters rather than carry lookahead adders in the intermediate stages. It is shown that the proposed technique has better performance than existing designs with respect to both area and speed.
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.
