MODULAR ARITHMETIC COMPUTING TECHNIQUES.
Abstract
Modular arithmetic concepts and associated computation techniques and organization are outlined. Fundamental operations of modular arithmetic discussed include sign or relative magnitude determination and division, mathematical solution using modular arithmetic, techniques for efficient mechanization of modular arithmetic adders and multipliers, and organization and control of a modular arithmetic computer. Numerical analysis studies yielded novel results including the introduction of signed residues, overflow detection techniques, and a division algorithm 3 times as fast as any previously disclosed. A square-root algorithm which is considerably faster than the Newton-Raphson algorithm is discussed. Implementation techniques are described for trading speed for complexity, programming a computer to extend its range, and design techniques for reducing component counts in adders and multipliers. A functional simulation of modular arithmetic computation in a conventional computer is described, and statistical data on the operation of the various algorithms is included.
Document Details
- Document Type
- Technical Report
- Publication Date
- May 01, 1963
- Accession Number
- AD0410534
Entities
Organizations
- Westinghouse Electric Corporation