Process for compressing and expanding structurally associated multiple-data sequences, and arrangements for implementing the process
AssigneeHeinz-Ulrich Wiebach
InventorsHeinz-Ulrich Wiebach, Reinhard Lidzba
Life of this patent
Estimating the term…
Loading patent…
AssigneeHeinz-Ulrich Wiebach
InventorsHeinz-Ulrich Wiebach, Reinhard Lidzba
Estimating the term…
A process and data processing system are disclosed for compressing and expanding structurally associated multiple data sequences. The process is particular to data sets in which an analysis is made of the structure in order to identify a characteristic common to a predetermined number of successive data elements of a data sequence. In place of data elements, a code is used which is again decoded during expansion. The common characteristic is obtained by analyzing data elements which have the same order number in a number of data sequences. During expansion, the data elements obtained by decoding the code are ordered in data series on the basis of the order number of these data elements. The data processing system for performing the processes includes a storage matrix (26) and an index storage (28) having line addresses of the storage matrix (26) in an assorted line sequence.
Process of compression and expansion of several structurally associated data sequences, including data sequences comprising data sets to be compressed, wherein the data sets to be compressed are stored in parallel in a storage matrix with regard to their structural association for obtaining a number of data elements of the data sequences of linking characteristic for several data sequences, the process comprising the steps of:
A data processing system for performing compression and expansion of several structurally associated data sequences, including data sequences comprising data sets to be compressed, the system comprising:
Data processing system according to claim 39, characterized in that the system further comprises an index storage having its number of lines equal to those of the storage matrix and which contains the line address of the storage matrix in an assorted line sequence.
Data processing system according to claim 39, characterized in that the system further comprises an attribute and descriptor storage connected on its address inputs with a third switchover device by which, in dependence on a third switchover signal, the line and column addresses of storage places of the storage are exchangeable.
Data processing system according to claim 39, characterized in that the system further comprises at least one decoder for obtaining the actual switchover signal from the storage address.
Data processing system according to claim 39, characterized in that the actual switchover device is a multiplexer.
Data processing system according to claim 39, characterized in that the system further comprises:
Data processing system according to claim 39, characterized in that the system further comprises fixed data storage as code storage that is addressable by a data structure classification result of a data column to be compressed and by an actual half character of the respective data column, where the data structure classification forms an address portion of a higher value and the actual half character forms an address portion of a low value.
Dependencies are inferred from the claim text.