Process for compressing and expanding structurally associated multiple-data sequences, and arrangements for implementing the process

Claim 2

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: compression of the data sequences by applying codes in substitution and representative of the data elements of coincident ordinal numbers; expansion of the data sequences by encoding the codes and obtaining the data elements, and arranging the data elements in data sequences with regard to the respective actual data element ordinal number; characterized in that the process further comprises the steps of: evaluation of the lengths of the data sequences, prior to performance of the structural analysis; formation of data sequence groups comprising data sequences of equal length, prior to performance of the structural analysis; and arrangement of the groups of data sequences in accordance with increasing or decreasing length of the sequences, prior to performance of the structural analysis.

Claim 3

Process according to claim 1, characterized in that the data sequences of each data sequence group are evaluated as to identity of characteristics and are arranged in accordance with the evaluation.

Claim 4

Process according to claim 2, characterized in that storage matrix-line numbers are determined for the arranged data sequences of equal effective length and identical characteristics, and the data sequences are arranged in accordance with increasing or decreasing storage matrix-line numbers.

Claim 5

Process according to claim 1, characterized in that an attribute field is generated for each data sequence and completes the corresponding data sequence, with the attribute field containing at least the effective length of the data sequence, a data sequence characteristic and the storage matrix-line number of the corresponding data sequence.

Claim 6

Process according to claim 1, characterized in that individual data sequences are serially precompressed.

Claim 7

Process according to claim 4, characterized in that the last data element of at least one data sequence, as well as eventually the number of such data elements, representing a repetition factor, is taken over into the attribute field, and that this last data element, as well as the direct precursors coinciding with the last data element, are eliminated for shortening the data sequence.

Claim 8

Process according to claim 6, characterized in that the last and the next to last data elements of the unshortened data sequence are taken over as data sequence characteristics into the attribute field and are eliminated in the data sequence.

Claim 9

Process according to claim 5, characterized in that at least the longest of the equal data elements consisting of a character string of a data sequence is eliminated and replaced by a fill character, and the character string is inscribed into a descriptor field, provided separately for each data sequence by an index, marking the beginning of the character string by the length of the character string and by the replaced character.

Claim 10

Process according to claim 5, characterized in that at least the greatest jittering of interfering characters are ascertained in data sequences to be compressed, fill characters, and the interfering character field is inscribed by a jittering index, marking the beginning of the interfering character by the field length and by the replaced interfering character.

Claim 11

Process according to claim 1, characterized in that for each data element column always at least one column descriptor field is generated that inscribes, at least partly, the data element column.

Claim 12

Process according to claim 10, characterized in that the data element columns consisting of identical characters are eliminated, replaced by fill characters and inscribed in the respective descriptor fields by indication of the actually replaced character.

Claim 13

Process according to claim 11, characterized in that at least the longest character string of a data element column consisting of identical data elements is eliminated and replaced by fill characters, and the character string in the respective column descriptor is inscribed by an index marking the beginning of the character string, by the length of the character string and by the replaced character.

Claim 14

Process according to claim 11, characterized in that at least the longest character string of a data element column is recorded in a code word that is shorter in comparison with the respective character string and is replaced by this code word, and the data element places which have been thereby set free are filled with fill characters.

Claim 15

Process according to claim 10, characterized in that two adjacent character strings of a data element column are exchanged, and that an index marking the contact place of the character strings in their original position and lengths of the character strings in the descriptor field of the respective data element column are stored.

Claim 16

Process according to claim 10, characterized in that the data elements of at least a portion of a data element column are recorded in a code that is less redundant.

Claim 17

Process according to claim 10, characterized in that the data elements of a data element column are interlinked by the logical function with the truth table A×B=W, when A=B and A×B=B, when A≠B on the condition that B≠W, where W is a repetition character.

Claim 18

Process according to claim 1, characterized in that each data element of a data element column is coded into an evaluation or indicator code word, the indicator code words of the individual data elements are bit by bit added to a data element column, directly adjacent indicator code words are bit by bit EXCLUSIVE-OR interlinked, the linkage results are added, and both additional results are evaluated for the classification of the data structure.

Claim 19

Process according to claim 17, characterized in that each data element column is half characterwise reset into code words determined by the result of classification.

Claim 20

Process according to claim 18, characterized in that the classification result is expressed by m-bits, that from the bit classification result, together with as n-bit half character, an (m+n) bit address is formed for addressing a code storage containing the cord words, and that the addressed code words are successively read out from the code storage.

Claim 21

Process according to claim 19, characterized in that the two code words last read out from the code storage at any given time are evaluated for equality after each reading cycle of the code storage.

Claim 22

Process according to claim 20, characterized in that the number of the directly successive reading cycles of the code storage are counted, after which at any given time the two code words last read out from the code storage will coincide.

Claim 23

Process according to claim 21, characterized in that the counter result is coded in dependence on the type of the code words so that the coded counter result is discernible from the respective code words.

Claim 24

Process according to claim 18, characterized in that in a data element column preponderantly occurring half characters are represented once, and each one of the remaining half characters, as well as an index, indicating the actual position of this remaining character, is separately represented in the compression code.

Claim 25

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: a storage matrix for storing the data sets to be compressed in parallel with regard to their structural association so as to obtain a number of data elements of the data sequences of linking characteristic for several data sequences; means for compressing the data sequences, including means for applying codes in substitution and representative of the data elements of coincident ordinal numbers; means for expanding the data sequences by decoding the codes and obtaining the data elements, and arranging the data elements in data sequences with regard to their respective actual data element ordinal number; characterized in that the data processing system further comprises; means for evaluating the lengths of the data sequences prior to performance of the structural analysis; means for forming data sequence groups comprising data sequences of equal length, prior to performance of the structural analysis; means for arranging the groups of data sequences in accordance with increasing or decreasing length of the sequences, prior to performance of the structural analysis; address inputs connected to the storage matrix; and a first switchover device exchangeable in dependence on a first switchover signal, with the line and column addresses of the places of the data element storage.

Claim 26

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: a storage matrix for storing the data sets to be compressed in parallel with regard to their structural association so as to obtain a number of data elements of the data sequences of linking characteristic for several data sequences; means for compressing the data sequences, including means for applying codes in substitution and representative of the data elements of coincident ordinal numbers; means for expanding the data sequences by decoding the codes and obtaining the data elements, and arranging the data elements in data sequences with regard to their respective actual data element ordinal number; characterized in that the data processing system further comprises; means for evaluating the lengths of the data sequences prior to performance of the structural analysis; means for forming data sequence groups comprising data sequences of equal length, prior to performance of the structural analysis; means for arranging the groups of data sequences in accordance with increasing or decreasing length of the sequences, prior to performance of the structural analysis; address inputs connected to the storage matrix; and a first switchover device exchangeable in dependence on a first switchover signal, with the line and column addresses of the places of the data element storage.

Claim 27

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.

Claim 28

Data processing system according to claim 25, characterized in that the system further comprises a second switchover device by which the line address inputs of the storage matrix can be actuated in dependence on a second switchover signal with the outputs of the index storage.

Claim 29

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.

Claim 30

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.

Claim 31

Data processing system according to claim 39, characterized in that the actual switchover device is a multiplexer.

Claim 32

Data processing system according to claim 39, characterized in that the system further comprises: means for coding each data element of a data element column into an evaluation or indicator code word; means for adding, bit by bit, to a data element column the indicator code words of the individual data elements; means for EXCLUSIVE-OR interlinking, bit by bit, directly adjacent indicator code words; means for adding the linkage results; means for evaluating both additional results for the classification of the data structure; and wherein the system comprises at least one indicator code word containing reading storage and addressable by the data elements.

Claim 33

Data processing system according to claim 30, characterized in that the system further comprises a counter arrangement connected with a double number of individual counters in comparison with the bit number of indicator words with a data output of the reading storage and that half of the individual counters have an EXCLUSIVE-OR member series connected, to the inputs of which at any time a bit position of directly adjacent indicator words in the reading storage is admitted.

Claim 34

Data processing system according to claim 31, characterized in that between the data output of the reading storage and the inputs of the EXCLUSIVE-OR members the system comprises two registers which serve for intermediate storage of an immediately prior indicator code word read out from the reading storage.

Claim 35

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.

Claim 36

Data processing system according to claim 33, characterized in that a first and a second register are connected in parallel to the code storage for intermediate storage, at any given time, of the immediately prior and next to immediately prior read code words.

Claim 37

Data processing system according to claim 34, characterized in that a comparison circuit that controls a counter is connected with the outputs of the first and of the second register.

Claim 38

Data processing system according to claim 24, characterized in that an A register and a B register are provided, serving also as result register, that the outputs of both registers are connected bit by bit with the inputs of the EXCLUSIVE-OR members, and that the outputs of the EXCLUSIVE-OR members are connected with the inputs of a disjunctive linkage member, the output signal of which controls the resetting input of the B register.

Claim 39

Data processing system according to claim 35, characterized in that for coding of a counter count of the counter, depending on the kind of code words, a multiplexer circuit is provided, containing the code words to be coded.