Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,908,990 papers from all fields of science
Search
Sign In
Create Free Account
Modulo operation
Known as:
Mod operator
, Modulo function
, Mod
Expand
In computing, the modulo operation finds the remainder after division of one number by another (sometimes called modulus). Given two positive numbers…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AC (complexity)
AMPL
Assertion (software development)
BASIC
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Oscillator and Filter Algorithms for Virtual Analog Synthesis
V. Välimäki
,
Antti Huovilainen
Computer Music Journal
2006
Corpus ID: 207618021
19 Virtual analog synthesis refers to computational methods that imitate the sound production principles used in electronic music…
Expand
Highly Cited
2005
Highly Cited
2005
Efficient Secure Group Signatures with Dynamic Joins and Keeping Anonymity Against Group Managers
A. Kiayias
,
M. Yung
International Conference on Cryptology in…
2005
Corpus ID: 45717445
The demonstration of an efficient construction proven secure in a formal model that captures all intuitive security properties of…
Expand
Highly Cited
2005
Highly Cited
2005
Certain Exponential Sums and Random Walks on Elliptic Curves
T. Lange
,
I. Shparlinski
Canadian Journal of Mathematics - Journal…
2005
Corpus ID: 120141205
Abstract For a given elliptic curve $\mathbf{E}$ , we obtain an upper bound on the discrepancy of sets of multiples ${{z}_{s}}G…
Expand
Highly Cited
1995
Highly Cited
1995
Coded continuous phase modulation using ring convolutional codes
B. Rimoldi
,
Quinn Li
IEEE Transactions on Communications
1995
Corpus ID: 35402183
Rate 1/2 convolutional codes over the ring of integers modulo M are combined with M-ary continuous phase modulation (CPM) schemes…
Expand
Highly Cited
1994
Highly Cited
1994
Trellis-coded continuous-phase frequency-shift keying with ring convolutional codes
Richard H.-H. Yang
,
Desmond P. Taylor
IEEE Transactions on Information Theory
1994
Corpus ID: 206393460
Trellis-coding techniques are applied to continuous-phase frequency-shift keying (CPFSK). A new coding scheme based on…
Expand
Highly Cited
1994
Highly Cited
1994
A Systolic, Linear-Array Multiplier for a Class of Right-Shift Algorithms
Peter Kornerup
IEEE Trans. Computers
1994
Corpus ID: 18678340
A very simple multiplier cell is developed for use in a linear, purely systolic array forming a digit-serial multiplier for…
Expand
Review
1987
Review
1987
Inference without Chaining
Alan M. Frisch
International Joint Conference on Artificial…
1987
Corpus ID: 912418
The problem of specifying, constructing, and understanding specialized, limited inference systems arises in many areas of AI. As…
Expand
Highly Cited
1986
Highly Cited
1986
The extra stage gamma network
Kyungsook Y. Lee
,
Wael Hegazy
International Symposium on Computer Architecture
1986
Corpus ID: 903279
The augmented data manipulator (ADM), inverse augmented data manipulator (IADM), and the gamma network are based on the Plus…
Expand
Highly Cited
1970
Highly Cited
1970
Minimization of Exclusive or and Logical Equivalence Switching Circuits
A. Mukhopadhyay
,
Greg Schmitz
IEEE transactions on computers
1970
Corpus ID: 800032
This paper is an attempt to develop minimization algorithms for switching circuits based on Reed-Muller canonic forms. In…
Expand
Highly Cited
1970
Highly Cited
1970
On the Addition of Binary Numbers
R. Brent
IEEE transactions on computers
1970
Corpus ID: 35094613
An upper bound is derived for the time required to add numbers modulo 2n, using circuit elements with a limited fan-in and unit…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE