Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,123,703 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.
2006
2006
MAI-Free MC-CDMA Systems Based on Hadamard–Walsh Codes
S. Tsai
,
Yuan-Pei Lin
,
C.-C. Jay Kuo
IEEE Transactions on Signal Processing
2006
Corpus ID: 8675500
It is known that multicarrier code-division multiple-access (MC-CDMA) systems suffer from multiaccess interference (MAI) when the…
Expand
2001
2001
Computational Nonlinear Morphology with Emphasis on Semitic Languages. Studies in Natural Language Processing.
G. Kiraz
2001
Corpus ID: 60281071
Computational morphology would be an almost trivial exercise if every language were like English. Here, chopp-ing off the…
Expand
1996
1996
The modulo time plot-a useful data aquisition diagnostic tool
D. Hummels
1996
Corpus ID: 7801248
This paper illustrates the use of the Modulo Time Plot to facilitate diagnosis of data acquisition systems and components. While…
Expand
Highly Cited
1994
Highly Cited
1994
Trellis-coded continuous-phase frequency-shift keying with ring convolutional codes
R. 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
1994
1994
Design of high-speed residue-to-binary number system converter based on Chinese Remainder Theorem
S. Piestrak
Proceedings IEEE International Conference on…
1994
Corpus ID: 8360418
The carry-free nature of the residue number system (RNS) has made it attractive for implementing a variety of specialized high…
Expand
1993
1993
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
Jordi Levy
,
J. Agustí-Cullell
International Conference on Rewriting Techniques…
1993
Corpus ID: 14710645
We propose an extension of rewriting techniques to derive inclusion relations \(a \subseteq b\) between terms built from…
Expand
1985
1985
Comments on "A Computer Algorithm for Calculating the Product AB Modulo M"
K. Sloan
IEEE Trans. Computers
1985
Corpus ID: 206623189
The modular multiplication algorithm (MMA) was presented as a method of calculating " the smallest nonnegative integer R…
Expand
Review
1978
Review
1978
Group characters: Sequences with good correlation properties
R. Scholtz
,
L. Welch
IEEE Transactions on Information Theory
1978
Corpus ID: 32585682
The structure of the group of integers relatively prime to n under multiplication modulo n is reviewed, and the basic properties…
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
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