CPC H04N 5/378 (2013.01) [G06T 9/00 (2013.01)] | 15 Claims |
1. A data compression method, the method comprising:
receiving a raw binary number comprising a first predefined number n1 of bits, each bit representing either zero or 2(n−1) with n representing a position of the bit in the binary number and 1≤n≤n1;
identifying, in the raw binary number, a position of a highest-weighted bit unequal zero;
generating, by using a first electronic circuit, binary position information by encoding the identified position;
compiling an encoded binary number, wherein the encoded binary number is based on the binary position information and on a partial binary number being a portion of the raw binary number directly following the highest-weighted bit unequal zero, and wherein the encoded binary number comprises a second predefined number m1 of bits, wherein the second predefined number m1 of bits is smaller than the first predefined number n1 of bits.
|