Modulo-''N'' code is a

lossy compression In information technology, lossy compression or irreversible compression is the class of data compression methods that uses inexact approximations and partial data discarding to represent the content. These techniques are used to reduce data size ...

algorithm used to compress

correlated In statistics, correlation or dependence is any statistical relationship, whether causal or not, between two random variables or bivariate data. Although in the broadest sense, "correlation" may indicate any type of association, in statistics ...

data sources using

modular arithmetic In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book ...

Compression

When applied to two nodes in a

network Network, networking and networked may refer to: Science and technology * Network theory, the study of graphs as a representation of relations between discrete objects * Network science, an academic field that studies complex networks Mathematics ...

whose data are in close range of each other modulo-''N'' code requires one node (say odd) to send the coded data value as the raw data

M_o = D_o

; the even node is required to send the coded data as the

M_e = D_e \bmod N

. Hence the name modulo-''N'' code. Since at least

\log_2 K

bits are required to represent a number ''K'' in binary, the modulo coded data of the two nodes requires

\log_2 M_o + \log_2 M_e

bits. As we can generally expect

\log_2 M_e \le \log_2 M_o

always, because

M_e \le N

. This is the how compression is achieved. A compression ratio achieved is

\text = \frac.

Decompression

At the receiver by joint decoding we may complete the process of extracting the data and rebuilding the original values. The code from the even node is reconstructed by the ''assumption'' that it must be close to the data from the odd node. Hence the decoding algorithm retrieves even node data as :

\operatorname(M_o,N.k+ M_e).

The decoder essentially finds the closest match to

M_o \simeq N.k + M_e

and the decoded value is declared as

N.k + M_e

Example

For a mod-8 code, we have ''Encoder'' D_o=43,D_e=47 M_o=43,M_e=47 mod(8) = 7, ''Decoder'' M_o=43,M_e=47 mod(8) = 7, D_o=43,D_e=CLOSEST(43,8⋅k + 7)

43 \simeq 8 \cdot 5 + 7

D_o=43,D_e=47 Modulo-''N'' decoding is similar to

phase unwrapping Instantaneous phase and frequency are important concepts in signal processing that occur in the context of the representation and analysis of time-varying functions. The instantaneous phase (also known as local phase or simply phase) of a ''comple ...

and has the same limitation: If the difference from one node to the next is more than ''N''/2 (if the phase changes from one sample to the next more than

\pi

), then decoding leads to an incorrect value.

Compression

Decompression

Example

See also