Method for numeric compression and decompression of binary data
AssigneeATOP Innovations S.p.A.
InventorElena Leanza
Life of this patent
Estimating the term…
Abstract
A method for numerical representation particularly advantageously applicable to storage of data and to transmit and receive operations of signals modulated by digital data and adapted to minimize by a selective rate the data amount, under maintainment of their integrity.
Claims66
A compression method for compressing an input data binary string having a number, L, of bits, to a compressed output data binary string, having a number, X, of bits, characterized in that at least one sub-string an−1an−2 . . . a1a0, having a number, n, of bits, of the input binary string is construed by assigning a integer numeric value, N, equal to a sum of items of a monotonic increasing succession S={s0,s1,s2, . . . } of integer numbers, among the first n items of such succession S, whose corresponding ai is equal to “1,” according to the formula:
- N = a n - 1 · s n - 1 + a n - 2 · s n - 2 + … + a 1 · s 1 + a 0 · s 0 = ∑ i = 0 n - 1 a i · s i
- and, for each sub-string an−1an−2 . . . a1a0, a compressed binary sub-string dm−1dm−2 . . . d1d0 is created, comprising m bits, in which the-binary representation of said integer numeric value N, as assigned to the corresponding sub-string an an−1an−2 . . . a1a0, is stored, the binary representation of N being furnished by the formula:
- N = d m - 1 · 2 m - 1 + d m - 2 · 2 m - 2 + … + d 1 · 2 1 + d 0 · 2 0 = ∑ i = 0 m - 1 d i · 2 i ,
- said output data binary string comprising, for each sub-string an−1an−2 . . . a1a0, a corresponding compressed binary sub-string dm−1dm−2 . . . d1d0 and the data of said input binary string lacking of said at least one sub-string an−1an−2 . . . a1a0, the ratio R k = s k s k - 1 ,
- where k=1, 2, . . . , between two consecutive items of said succession S, fulfilling the condition expressed by the formula:
- Rk<2 where k≧q≧1,
- the number n of bits of said at least one sub-string an−1an−2 . . . a1a0 being in the range between a minimum value nmin and the number L of bits included in said input data binary string, according to formula:
- nmin≦n≦L,
- a minimum value nmin being equal to the minimum value of n that fulfills the following condition:
- m = int sup [ log 2 ( ∑ i = 0 n - 1 s i ) ] < n
- where the function y=intsup[x] returns the minimum integer value not lower than x(y≧x).
Dependencies are inferred from the claim text.