|
Asymmetric Binary System was introduced by Jarek Duda from Jagiellonian University in Poland.
Since method is new not many articles are available for the moment, but publications are appearing
and changing rapidly, so those who interested to find more materials can simply Google inventors
name or method. According to suggested technique one integer with uneven distribution of positive
and zero bits can be reversibly converted to shorter integer with even distribution of bits. The
conversion is performed bitwise. The resulting integer is called state S
that is changing after processing of each bit in original number depending on estimated frequency
of positive bits P
Si+1 = f [ Si , b , P ]
where
b is particular bit in the stream (either 0 or 1). The reverse transformation
uses different formula
Si = g [ Si+1 , b(Si+1) , P ]
where b is particular bit extracted from state
Si+1 before the state is changed. Interesting that method works for
arbitrary starting state S0 and in reverse transformations
state variable takes same values as in direct transformations but in reverse order.
The suggested article shows that encoding may be graphically interpreted as descend in
the special binary tree and that method can be generalized to the case of non-dual alphabet
even without suggested formulas.
|