1975•IEEE Transactions on ComputersRequires access

A Note on Fast Base Extension for Residue Number Systems with Three Moduli

Kenneth H. O'Keefe

Abstract

An algorithm is given for the base-extension (BE) computation in residue number systems that requires the standard four steps (for systems with three moduli) but which saves hardware. Furthermore, for the particular moduli m-1, m, and m+1 it is shown that fast-BE in only two steps is possible, for all combinations of the moduli.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Residue number system, Moduli, Computation, Extension (predicate logic), Residue (chemistry), Base (topology), Mathematics, Computer science