Pseudo Division and Pseudo Multiplication Processes

  title={Pseudo Division and Pseudo Multiplication Processes},
  author={John E. Meggitt},
  journal={IBM J. Res. Dev.},
  • 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 General Hardware-Oriented Method for Evaluation of Functions and Computations in a Digital Computer

  • M. Ercegovac
  • Computer Science, Mathematics
    IEEE Transactions on Computers
  • 1977
A parallel computational method is described that provides a simple and fast algorithm for the evaluation of polynomials, certain rational functions and arithmetic expressions, solving a class of systems of linear equations, or performing the basic arithmetic operations in a fixed-point number representation system.

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

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

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

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
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

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.

An Analysis of Algorithms for Hardware Evaluation of Elementary Functions.

Algorithms for the automatic evaluation of elementary functions were studied to determine their suitability for hardware implementation, in terms of their accuracy, convergence rate, and hardware requirements.



Mathematical Methods for Digital Computers

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.