G - Physics – 06 – F
Patent
G - Physics
06
F
354/238
G06F 5/00 (2006.01) H03H 17/06 (2006.01) H03M 7/30 (2006.01)
Patent
CA 1181867
TITLE OF THE INVENTION Data compression process ABSTRACT OF THE DISCLOSURE In a process for compressing redundant sequences of serial data elements divided into sequence components each having any number of data elements and a closing character, the first and second elements of a sequence are combined to form a first pair which is stored with its code designation in a group list, That code designation and the third element form a second pair which is also stored with its code designation. That code designation and the following element form a further pair which receives a code designation, and so forth, until the closing character which, with the code designation of the preceding pair, forms a last pair which is again stored with a code. For second and subsequent sequences, the above steps are repeated, with checking for identity between the first pair of the second sequence component and the first pair of the first or one of the further components. If no identity, procedure is as with the first sequence, while if there is identity, the code designation of the first pair is combined with the third element and a check is again made for identity between the further pair of this sequence and the further pair of the first or a further component sequence. If there is identity, the code designation of the further pair is combined with the following element, and so on, to the end of identity between the pairs. The code designation of the last identical pair is stored in the list, and further elements are then processed as required. In a compressed data sequence list, each component sequence is identified by the code designation of its last pair. The compressed sequence is decompressed by calling up the first code designation of the compressed list, checking whether the first member of the pair is code designation or element; if an element, output of the pair, and repeat the procedure for all subsequent code designations, if a code designation, checking is repeated for the pair denoted by the code designation, until reaching an initial group having an element as first member, followed by output of the pair and the second member of all previously processed pairs. The procedure is then repeated for all subsequent code designations.
402653
Heinz Karl E.
Kirby Eades Gale Baker
LandOfFree
Data compression process does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Data compression process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data compression process will most certainly appreciate the feedback.
Profile ID: LFCA-PAI-O-1262429