Abstract
In this paper, the authors developed a new methodology for designing a lower-error and area-time efficient 2s-complement fixed-width Booth multiplier that receives two n-bit numbers and produces an n-bit product. By properly choosing the generalized index and binary thresholding, a better error-compensation bias was derived to reduce the truncation error. Since the proposed error-compensation bias is realizable, the constructing low-error fixed-width Booth multiplier is area-time efficient for VLSI implementation. Finally, the proposed fixed-width Booth multiplier was applied to speech signal processing. The simulation results show that the performance is superior to that using the direct-truncation fixed-width Booth multiplier
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: 2003 46th Midwest Symposium on Circuits and Systems
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.