imported>PragyaanRover at 13:07, 11 December 2024

2024-12-11T13:07:10Z

New page

{{Short description|Lossy Compression Algorithm}}
{{DISPLAYTITLE:Modulo-''N'' code}}
{{Unreferenced|date=December 2009}}
'''Modulo-''N'' code''' is a [[lossy compression]] algorithm used to compress [[correlated]] data sources using [[modular arithmetic]].

==Compression==
When applied to two nodes in a [[computer networking|network]] 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 <math>M_o = D_o</math>; the even node is required to send the coded data as the <math> M_e = D_e \bmod N </math>. Hence the name modulo-''N'' code.

Since at least <math>\log_2 K</math> bits are required to represent a number ''K'' in binary, the modulo coded data of the two nodes requires <math>\log_2 M_o + \log_2 M_e</math> bits. As we can generally expect <math>\log_2 M_e \le \log_2 M_o</math> always, because <math>M_e \le N</math>. This is how compression is achieved.

A compression ratio achieved is <math>\text{C.R.} = \frac{\log_2 M_o + \log_2 M_e}{2\log_2 M_o}.</math>

==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

: <math>\operatorname{CLOSEST}(M_o,N.k+ M_e).</math>

The decoder essentially finds the closest match to <math>M_o \simeq N.k + M_e</math> and the decoded value is declared as <math>N.k + M_e</math>

==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)
<math> 43 \simeq 8 \cdot 5 + 7</math>
D_o=43,D_e=47

Modulo-''N'' decoding is similar to [[phase unwrapping]] 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 <math>\pi</math>), then decoding leads to an incorrect value.

==See also==
* [[DISCUS]] is a more sophisticated technique for compressing correlated data sources.
* [[Delta encoding]] is a related algorithm used in lossless compression algorithms designed for correlated data sources.

==References==
{{reflist}}

{{DEFAULTSORT:Modulo-N Code}}
[[Category:Information theory]]
[[Category:Data compression]]
[[Category:Wireless sensor network]]

Modulo-N code - Revision history

imported>PragyaanRover at 13:07, 11 December 2024