Skew binary number system

The skew binary number system is a non-standard positional numeral system in which the nth digit has a value of $2^{{n+1}}-1$ (digits are indexed from 0) instead of $2^{n}$ as they have in binary. Each digit has a value of 0, 1, or 2. Notice that a number in decimal can have many skew binary representations. For example a decimal number 15 can be written as 1000, 201 and 122. Each number can be written uniquely in skew binary canonical form where there is only at most one instance of the digit 2, which must be the first non-zero least significant digit. In this case 15 is written canonically as 1000.

Examples

Skew binary representations of the numbers from 0 to 15 are shown in following table:

Decimal	Skew binary	binary
0	0	0
1	1	1
2	2	10
3	10	11
4	11	100
5	12	101
6	20	110
7	100	111
8	101	1000
9	102	1001
10	110	1010
11	111	1011
12	112	1100
13	120	1101
14	200	1110
15	1000	1111

Arithmetical operations

The advantage of skew binary is that each increment operation can be done with at most one carry operation. This exploits the fact that $2(2^{{n+1}}-1)+1=2^{{n+2}}-1$ . Incrementing a skew binary number is done by setting the only two to a zero and incrementing the next digit from zero to one or one to two.^[1] When numbers are represented using Run-length encoding, called sparse representations of numbers by Okasaki,^[2] incrementation and decrementation can be performed in constant time.

Other arithmetic operations are performed^[3] by switching between the Skew binary representation and the binary representation.

From skew binary representation to binary representation

Given a skew binary number, its value can be computed by a loop, computing the successive values of $2^{n+1}-1$ and adding it once or twice for each $n$ such that the $n$ th digit is 1 or 2 respectively. A more efficient method is no given, with only bit representation and one substraction. The skew binary number of the form $b_{0}\dots b_{n}$ without 2 and with $m$ 1s is equal to the binary number $0b_{0}\dots b_{n}$ minus $m$ . Let $d^{c}$ represents the digit $d$ repeated $c$ times. The skew binary number of the form $0^{c_{0}}21^{c_{1}}0b_{0}\dots b_{n}$ with $m$ 1s is equal to the binary number $0^{c_{0}+c_{1}+2}1b_{0}\dots b_{n}$ minus $m$ .

From binary representation to skew binary representation

Similarly to the preceding section, the binary number $b$ of the form $b_{0}\dots b_{n}$ with $m$ 1s equals the skew binary number $b_{1}\dots b_{n}$ plus $m$ . Note that since addition is not defined, adding $m$ corresponds to incrementing the number $m$ times. However, $m$ is bounded by the logarithm of $b$ and incrementation takes constant time. Hence transforming a binary number into a skew binary number runs in time linear in the length of the number.

Applications

Skew binary numbers find applications in skew binomial heaps, a variant of binomial heaps that support worst-case O(1) insertion, and in skew binary random access lists, a purely functional data structure. They also find use in bootstrapped skew binomial heaps, which have excellent asymptotic guarantees.^[2]

Notes

↑ skew binary numbers
1 2 Okasaki, Chris. Purely Functional Data Structures.
↑ Elmasry, Amr; Jensen, Claus; Katajainen, Jyrki (2012). "Two Skew-Binary Numeral Systems and One Application" (PDF). Theory of Computing Systems. 50: 185–211. doi:10.1007/s00224-011-9357-0.

External links

This sequence is a sequence A169683, the at On-Line Encyclopedia of Integer Sequences, published electronically at https://oeis.org, 2016

This article is issued from Wikipedia - version of the 9/12/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.