Title: A Fast Fixed Point Signed Multiplication Algorithm
Abstract: A fast fixed point signed multiplication algorithm is proposed in this paper.The algorithm decomposes a given multiplicator into several sub-components,one is a primitive integer 1,or 0,or-1,the others are a power of two number.So the multiplication algorithm can perform only by several shift-add operations.Therefore,faster speed is achieved using this decomposition.The multiplication algorithm is simulated on MATLAB platform.
Publication Year: 2007
Publication Date: 2007-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot