Patent ID: 10084477

Abstract:
Adaptively compressing an input string (10) comprising a sequence of symbols in order to create a plurality of segment dictionaries Dm, with the steps of: generating a lookup map (110); generating a key value segment Sm,n; searching the lookup map for each symbol received in the input string (120, 130); upon detecting a symbol is not stored in the lookup map, adding the symbol by storing the symbol at a next sequential key index in the lookup map lookup map (135) and assigning a next sequential key value entry to the symbol and adding this key value to the key value segment Sm,n (150); upon detecting the symbol is stored in the lookup map, adding the corresponding key value assigned to this symbol to the next sequential entry of the key value segment Sm,n (150); wherein a new key value segment Sm,n+1 of the lookup map is generated if the number of different symbols equals the number of available key values k=2n for the opened/current key value segment Sm,n (141, 142), and where-in the lookup map is converted into a segment dictionary Dm if the maximal key value size knmax=2nmax is reached (132, 133, 134), with n being any positive integral number 1 to nmax, nmax denoting the maximal bit size, and m being any positive integral number denoting the consecutive numbering of segment dictionaries Dm.