Abstract
A simple approach for implementing integer binary multiplication without rounding is proposed. In two versions of this approach, multiplication is implemented through the use of adders together with a small ROM that stores either a table of the squares of integers or half of such a table. The improved version of this approach has several advantages over other existing approaches for table-assisted multiplication, including smaller ROM size and simpler and/or less arithmetic operations. The extension of the present approach to complex multiplication is also explored.
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.
