Fast Hardware Computation of x mod z
Abstract
We show a high-speed hardware implementation of
xmod z that can be pipelined in O(n ° m) stages, where x is
represented in n bits and z is represented in m bits. It is suitable
for large x. We offer two versions. In the first, the value of z
is fixed by the hardware. For example, using this circuit, we
show a random number generator that produces more than 11
million random numbers per second on the SRC-6 reconfigurable
computer. In the second, z is an independent input. This is
suitable for RNS number system applications, for example. The
second version can be pipelined in O(n) stages.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.Collections
Related items
Showing items related by title, author, creator and subject.
-
Hardware index to permutation converter
Sasao, T.; Butler, Jon T. (2012-05);We demonstrate a circuit that generates a permutation in response to an index. Since there are n! n-element permutations, the index ranges from 0 to n! à ¢ 1. Such a circuit is needed in the hardware implementation of ... -
Automatic Generation of System Plans for Autonomous Unmanned Systems
Berzins, Valdis (Monterey, California: Naval Postgraduate School, 2018-04); NPS-18-N341-BProject Summary: The objective of the study is to leverage automatic programming in support of Systems Center Pacific (SSC-P) strategies for developing unmanned systems autonomy software. To apply artificial intelligence ... -
Composite system stability methods applied to advanced shipboard electric power systems
Amy, John Victor (Monterey California. Naval Postgraduate School, 1992-05);Large increases in the complexity of shipboard electric loads as well as development of electric drive, integrated electric drive and pulsed power systems make manifest the present and future importance of naval electric ...