COMPRESSION METHOD FOR A DATA TRANSFER THAT IS INDEPENDENT OF COMPUTER ARCHITECTURE AND/OR DECOMPRESSION METHOD FOR A DATA RECORD

• US 20090193045A1
• Filed: 11/21/2006
• Published: 07/30/2009
• Est. Priority Date: 11/23/2005
• Status: Active Grant

• Current Assignee: Christian Werner
• Original Assignee: Universitat Zu Lubeck
• Inventors: Werner, Christian
• Granted Patent: US 8,650,217 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: H03M 7/30 Compression speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N; Expansion; Suppression of unnecessary data, e.g. redundancy reduction

Abstract

A compression method for a data transfer that is independent of computer architecture and/or a decompression method for a data record that contains structural indicators and variable values are provided. The method includes the following steps: provision of a string automaton, which represents the structuring rules of the data record in a unit that compresses the original data record; input of the data record into the string automaton; generation of a second, shorter data record by the string automaton, the record containing the variable values of the first data record and control symbols that are specific to the string automaton equipment, the symbols representing a switch from an automaton condition to a sequence condition; and transmission of the second data record to a similar string automaton, which interprets the control symbols, whereby a copy of the original data record with an identical data structure is generated.

Claims

1-10. -10. (canceled)

11. A method for compressing of a data record, the method comprising:

providing a string automaton in a compression apparatus, wherein the string automaton represents predefined structuring rules of the data record;

inputting the data record into the string automaton, wherein the data record comprises structure tags and unstructured values and complies with the predefined structuring rules; and

processing the input data record by the string automaton to thereby produce a compressed data record, wherein the compressed data record comprises the un-structured values of the data record and control symbols representing state transitions of the string automaton'"'"'s flow path caused by the structure tags of the input data record.

12. The method according to claim 11, wherein processing the input data record by the string automaton comprises adding control symbols to the compressed data record only for those states of the string automaton allowing for transitions to plural subsequent states.

13. The method according to claim 11, further comprising transmitting the compressed data record to a decompression apparatus.

14. The method according to claim 11, wherein the data record is an eXtensible Markup Language (XML) document.

15. The method according to claim 11, wherein processing the input data record by the string automaton comprises controlling external functional groups or modules.

16. The method according to claim 11, further comprising determining bit representations for the control symbols taking into consideration probabilities or frequencies of the state transitions encoded by the control symbols.

17. The method according to claim 11, wherein the un-structured values of the data record are output by the string automaton in an at least partially altered, encoded form or are recognized and converted by said string automaton.

18. The method according to claim 11, further comprising storing additional coding rules in the string automaton relating to state transitions.

19. The method according to claim 11, further comprising determining bit representations of the control symbols for coding state transitions of the string automaton based on dynamically changing memory content.

20. A method for decompressing a compressed data record, the method comprising:

providing a string automaton in a decompression apparatus, wherein the string automaton represents predefined structuring rules of the data record;

inputting the compressed data record into the string automaton, wherein the compressed data record comprises control symbols for the string automaton and un-structured values, and complies with the predefined structuring rules; and

processing the input compressed data record by the string automaton to generate a decompressed data record, wherein the string automaton replaces the control symbols by structure tags to thereby generate the decompressed data record comprising structure tags and un-structured values.

21. The method according to claim 20, wherein, in addition or alternatively to generating the decompressed data record, processing the input compressed data record comprises controlling functional groups or modules by the string automaton.

22. The method according to claim 20, further comprising storing additional coding rules for state transitions of the string automaton.

23. The method according to claim 20, further comprising determining bit representations of the control symbols for coding state transitions of the string automaton based on dynamically changing memory content.

24. A compression apparatus for compressing of a data record, the compression apparatus comprising:

circuitry implementing a string automaton representing predefined structuring rules of the data record,

wherein the circuitry implementing the string automaton is operable to process a data record input to the string automaton to thereby produce a compressed data record, wherein the input data record comprises structure tags and unstructured values and complies with the predefined structuring rules,

wherein the circuitry implementing the string automaton is further operable to add to the compressed data record the unstructured values of the data record and control symbols representing state transitions of the string automaton'"'"'s flow path caused by the structure tags of the input data record.

25. The compression apparatus according to claim 24, further comprising a push-down stack and wherein the circuitry implements a state machine.

29. A micro-chip comprising a compression apparatus according to claim 24.

26. A decompression apparatus for decompressing a compressed data record, the decompression apparatus comprising:

circuitry implementing a string automaton representing predefined structuring rules of the data record,

wherein the circuitry implementing the string automaton is operable to process a compressed data record input to the string automaton to thereby produce a decompressed data record, wherein the input compressed data record comprises control symbols and unstructured values and complies with the predefined structuring rules, and wherein the control symbols of the compressed data record describe a flow path of the string automaton,

wherein the circuitry implementing the string automaton is further operable to replace the control symbols by structure tags to thereby generate the decompressed data record comprising structure tags and unstructured values.

27. The decompression apparatus according to claim 26, wherein the circuitry implementing the string automaton, in addition or alternatively to generating the decompressed data record, is operable to control functional groups or modules by the string automaton.

28. The decompression apparatus according to claim 26, further comprising a push-down stack and wherein the circuitry implements a state machine.

30. A micro-chip comprising a decompression apparatus according to claim 26.