Abstract
This chapter firstly extends the earlier principles of addition to provide faster adders. It then describes the underlying principles of binary multiplication and division, and especially techniques for fast operations.
Keywords: Adders, carry-lookahead adder, carry-skip adder, asynchronous adder, carry-save adder, fast carry-path adder, multipliers, twos-complement multiplication, skipping over 0s and 1s, high radix multiplier, combinational multiplier, restoring division, non-restoring division, SRT division, approximate quotient digit division, additive refinement division.
Related Journals
Recent Patents on Computer Science
Current E-Learning
Current Computer Science
International Journal of Sensors, Wireless Communications and Control
Recent Advances in Computer Science and Communications
Journal of Fuzzy Logic and Modeling in Engineering
The Chinese Journal of Artificial Intelligence
Current Chinese Computer Science
Related Books
Computational Intelligence For Data Analysis
Applied Machine Learning and Multi-Criteria Decision-Making in Healthcare
A First Course in Artificial Intelligence
Artificial Intelligence: Models, Algorithms and Applications
Advanced Computing Techniques: Implementation, Informatics and Emerging Technologies
Handbook of Mobile Application Development: A Guide to Selecting the Right Engineering and Quality Features
Applications of Modern High Performance Networks
Arduino Meets Matlab: Interfacing, Programs and Simulink
Arduino and SCILAB based Projects
Application of Chaos and Fractals to Computer Vision