Pseudo Division and Pseudo Multiplication Processes

@article{Meggitt1962PseudoDA,
  title={Pseudo Division and Pseudo Multiplication Processes},
  author={John E. Meggitt},
  journal={IBM J. Res. Dev.},
  year={1962},
  volume={6},
  pages={210-226}
}
  • J. E. Meggitt
  • Published 1 April 1962
  • Computer Science
  • IBM J. Res. Dev.
Some digit-by-digit methods for the evaluation of the elementary functions are described. The methods involve processes that resemble repeated-addition multiplication and repeated-subtraction division. Consequently, the methods are easy to implement and the resultant execution times are short. 

Figures and Tables from this paper

Digit-by-Digit Methods for Polynomials

This paper presents a general system configuration for an arithmetic unit of a computer, which is used to solve polynomial problems efficiently. The technique is based on a digit-by-digit computation

A bibliography on computer arithmetic

This bibliography on computer arithmetic uses, by and large, the format and abbreviations employed by Computing Reviews. It is presented in alphabetical order only and not by individual topics. The

A Survey of Some Recent Contributions to Computer Arithmetic

  • H. Garner
  • Computer Science
    IEEE Transactions on Computers
  • 1976
This paper surveys some recent contributions to computer arithmetic. The survey includes floating-point arithmetic, nonstandard number systems, and the generation of elementary functions. The design

Right Shift for Low-Cost Multiply and Divide

Although integrated-circuit technology promises to reduce the cost of logic, there are still situations where low-cost multiplication and/or division algorithms must be implemented in today's

A fast CORDIC co-processor architecture for digital signal processing applications

TLDR
A classification method is described that can be used for the possible applications of the CORDIC algorithm and the architecture that is required for fast hardware computing of the algorithm.

Efficient VLSI Implementation of CORDIC-Based Multiplier Architecture

TLDR
An effort has been made to reduce the latency of a processor by implementing a multiplier less architecture using the CORDIC algorithm for computing trigonometric relationships.

Radix-16 Evaluation of Certain Elementary Functions

  • M. Ercegovac
  • Computer Science
    IEEE Transactions on Computers
  • 1973
TLDR
This paper describes a family of algorithms for evaluation of a class of elementary functions including division, logarithms, and exponentials and demonstrates the feasibility of higher radix implementations and compares performance with radix 2.

A 6.7-MFLOPS floating-point coprocessor with vector/matrix instructions

TLDR
An 80-bit floating-point coprocessor which implements 24 vector/matrix instructions and 22 mathematical functions is described and the performance of 6.7 MFLOPS in the vector-matrix multiplication at 20 MHz has been attained by the use of parallel operations.

A general method for evaluation of functions and computations in a digital computing

  • M. Ercegovac
  • Computer Science
    1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH)
  • 1975
TLDR
The method, is well suited for fast evaluation of commonly used, mathematical functions, and provides a unique, simple and fast algorithm for solving many computational problems, such as the evaluation of polynomials, rational functions and arithmetic expressions.
...

References

SHOWING 1-2 OF 2 REFERENCES

Mathematical Methods for Digital Computers

TLDR
This is the book that many people in the world waiting for to publish, mathematical methods for digital computers, and the book lovers are really curious to see how this book is actually.