HU0900432A2 - Procedure, system, computer program and computer program product for the compression of short messages - Google Patents

Procedure, system, computer program and computer program product for the compression of short messages Download PDF

Info

Publication number
HU0900432A2
HU0900432A2 HU0900432A HU0900432A HU0900432A2 HU 0900432 A2 HU0900432 A2 HU 0900432A2 HU 0900432 A HU0900432 A HU 0900432A HU 0900432 A HU0900432 A HU 0900432A HU 0900432 A2 HU0900432 A2 HU 0900432A2
Authority
HU
Hungary
Prior art keywords
message
type
compression
elements
message element
Prior art date
Application number
HU0900432A
Other languages
Hungarian (hu)
Other versions
HU0900432D0 (en
Inventor
Tibor Ratkay
Norbert Kis
Original Assignee
Metall Print Kft
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Metall Print Kft filed Critical Metall Print Kft
Priority to HU0900432A priority Critical patent/HU0900432A2/en
Publication of HU0900432D0 publication Critical patent/HU0900432D0/en
Publication of HU0900432A2 publication Critical patent/HU0900432A2/en

Links

Classifications

    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04MTELEPHONIC COMMUNICATION
    • H04M1/00Substation equipment, e.g. for use by subscribers; Analogous equipment at exchanges
    • H04M1/72Substation extension arrangements; Cordless telephones, i.e. devices for establishing wireless links to base stations without route selecting
    • H04M1/725Cordless telephones
    • H04M1/72519Portable communication terminals with improved user interface to control a main telephone operation mode or to indicate the communication status
    • H04M1/72522With means for supporting locally a plurality of applications to increase the functionality
    • H04M1/72547With means for supporting locally a plurality of applications to increase the functionality with interactive input/output means for internally managing multimedia messages
    • H04M1/72552With means for supporting locally a plurality of applications to increase the functionality with interactive input/output means for internally managing multimedia messages for text messaging, e.g. sms, e-mail

Abstract

A method for compressing short messages. The message is composed of at least one message element of a first type and at least one message element of a second type. At least one message element set containing a plurality of message elements of the first type is predefined, each of said message elements of the first type being associated with a code. During generation of the message, the user is prompted to select at least one message element of the first type (S104) and to input at least one message element of the second type (S112), in an arbitrary order. After generation of the message, said message element of the second type is compressed by using a compression technique selected by the user (S122).

Description

PROCEDURE, SYSTEM, COMPUTER PROGRAM AND COMPUTER SOFTWARE FOR COMPRESSING SHORT MESSAGES

The present invention relates to a method, system, computer program and computer program product for compressing short messages.

Short message messaging, especially short message sending, is used in almost every area of life, especially in the field of mobile communication. The best known way of sending short messages is to send SMS messages on mobile telecommunication networks. The content of a short message can be very different, for example. personal content, banking news, transaction alerts, daily, business, sports news, medical patient information transfer, instant (automatic) emergency assistance, SMS games, SMS voting, sports betting; communication between companies 15, service alarms, telemetry, telemarketing; electronic shopping (bus ticket, movie ticket, concert ticket, sports ticket); direct marketing, special promotions, product feedback, etc.

At present, the very widespread use of short message service for SMS has a significant restriction on the length of messages. If we use the 20 Unicode character representation (the maximum length of the message is 70 characters), although the message is linguistically correct, the information and messages transmitted are very short and thus their information content is very small. Another method used in practice is a message of up to 160 characters as described in GSM 03.38, which, although using 7-bit karak25 space representation, lacks the special characters of many Latin script languages, which may result in grammatically incorrect or even misunderstood content text.

In current SMS standards, messages are capable of transmitting relatively small amounts of data, and although longer messages that cannot be transmitted in a single short message can be transmitted in several related short messages, such messaging involves additional costs.

US 2006/0142997 A1. discloses a mobile terminal for compressing text messages that includes a display, a text input device, a predictive editor, and another program that uses a predictive editor to replace at least a portion of the words in the typed text with references to corresponding elements of a language-specific dictionary. in the output file. The mobile terminal places words and other strings not found in the language-specific dictionary in the output file unencrypted. The amount of data in the resulting compressed output file may be significantly less than the amount of original text. The disadvantages of this solution are that words or other strings not found in the dictionary are included in the output file without compression, and that the text message waiting to be sent is compressed using a single compression method (in this case word-based compression), where sending long paragraphs of text or sentences with the same or nearly identical content is often not effective enough to compress.

SUMMARY OF THE INVENTION It is an object of the present invention to overcome the above-mentioned drawbacks and to provide a compression method, system and computer program that enables more efficient compression of short messages, especially text messages or text messages.

It is a further object of the present invention to provide a compression method and system in which the compression is performed interactively in accordance with the decision of the user sending the message.

It is also an object of the present invention to provide language-independent coding of text data in a message to be transmitted and displaying text data in the selected language, in the form of text with the same content as the original message, in the correct language.

The present invention is based on the discovery that short text messages in most cases consist of frequently repeated message elements (e.g. sentences, picture elements, audio files, etc.) of a length comparable to the length of the user data field of standard short messages and unique messages. is much shorter than its length, typically text message elements (e.g. abbreviations, symbols, words, etc.). By combining different compression types of two message elements optimized for each message element type, such short messages can be compressed much more efficiently than hitherto.

• · ·· ···· ·

On the one hand, the objects are achieved by implementing a method for compressing short messages, preferably text messages or text messages, wherein the message is generated from at least one type of message element and at least one type of message element; the number and order of the second type of message items is arbitrary. The procedure includes the following steps:

receiving a message element selected by the user from a predefined set of message elements as the first type of message element,

- accepting as the second type of message element any user-defined message element consisting of one or more text characters,

generating a compressed output file based on the message compiled from the at least one first type of message element and the at least one second type of message element, such that

replacing each first type message element with a code of less than the original bit length stored in the message element set of said first type message element, and

- compressing each second type of message element from a predefined compression method using a user-selected compression method,

- wherein the average compression rate of all first type message elements in the predefined message element set is substantially higher than the average compression rate of all possible characters supported by the compression method selected for the second type message elements, and

associating the compressed output file with information suitable for identifying, at least for the second type of message elements, a selected compression method.

On the other hand, the objects are achieved by implementing a system for compressing short messages, preferably text or text messages, comprising:

- a message item set containing predefined first type message items, each of the first type message items being assigned a code with a bit length less than the original bit length stored in the message item set, ···· ····

- a group of predefined compression methods,

- a message processing means for generating the message from at least one pre-stored message type message element and at least one user-defined second message element type consisting of one or more text characters,

- a message element browse means for selecting at least one first type of message element from a pre-stored set of message elements,

- a data compression means for replacing the first type of message elements with the appropriate code, and for compressing the second type of message elements by a user-selected compression method, thereby producing a compressed output file, and

- a message formatting means for attaching to the compressed output file a message header containing information suitable for identifying at least the compression method selected for the second type of message elements.

The objects are further achieved by implementing a computer program comprising instructions executed on a computer or other processor device to carry out the process according to the invention.

Finally, the objects are achieved by implementing a computer program product stored on a data storage medium readable by a computer or other processor device and comprising instructions executed on a computer or other processor device in accordance with the present invention.

The invention will now be described in more detail by way of non-limiting embodiments, with reference to the accompanying drawings. In the drawing:

Figure 1 a flowchart illustrating the main steps of a preferred embodiment of the process of the invention, Figure 2 an example of a message header used in a preferred embodiment of the method of the present invention, and Figure 3 a functional block diagram of a preferred embodiment of the system of the invention.

An essential feature of the method of the present invention is that the message to be transmitted is composed of at least two message elements, using at least one first type message element and at least one second type message message message application. It is important to note that the present

In the specification and claims, the first, second and third terms used to distinguish message elements refer only to the type of message element and not to the logical sequence of each message element during message generation.

The first type of message elements is preferably text data or audio or image files of at least 2 characters in length. The first type of message elements is comprised of a predetermined set of message elements pre-stored in the user equipment, in which each type of message element is assigned a code of substantially smaller bit length than the original bit length stored in the message element set. token. Preferably, the predefined message element set contains words, groups of words, or complete sentences with which words, groups of words or sentences of the same or similar content often occur in human-to-machine or machine-to-machine communication. However, the predefined message element set can contain not only text elements, but also frequently transmitted voice data (eg ringtones, other sound effects) or image data (eg logos, graphic symbols, photos, movies). The predefined message element set thus contains commonly used message bit lengths which, when replaced with the appropriate tokens, provide a significant compression rate for such message elements.

The predefined message element set is conveniently stored in a structured manner to facilitate the selection of its elements. The predefined message element set can be structured e.g. by subject, alphabetically, frequency of items, etc.

Because the first type of message elements are predefined, pre-stored data, they can only be added to the message as one unit when generating or editing the message, or the entire first type of message elements added to the message can be deleted when editing the message. not possible.

Text message items stored in a predefined message set are stored in the dictionary in at least one language. In a preferred embodiment of the method of the invention, a predetermined message element set includes a message element containing a given information in multiple languages, thus allowing text first

type message items in a language other than the one used in the message generation. Multiple storage of the first type of message elements in multiple languages thus enables the implementation of an interpreter function.

Tokens for the first type of message elements selected from the predefined message element set are, after selecting the message elements, placed in a temporary data file, which is stored in a temporary buffer during message editing. Thus, the first type of message elements in the temporary file are already compressed, in the form of tokens.

Depending on the bit length of the tokens used in the method of the invention, the average compression ratio of the first type message elements in the predefined message element set is typically at least 2: 1, but preferably at least 5: 1, over the entire message element set. Thus, the average compression ratio of the first type of message elements within a given message is typically at least 2.5: 1, which means that the total bit size of the tokens replacing the first message elements in the temporary data file is typically up to 40% of the first the aggregate original bit length of the message elements. Obviously, depending on the content of the message, typically a much higher compression rate than the typical value of the minimum compression ratio can be achieved, but it is not excluded that in very rare cases only approx. Compression of the first type of message elements will be 2: 1 or less relative to the total of the first type of message elements in a given message. This latter case can occur if the message contains a relatively larger number of less frequently used first type message elements, thus represented by longer tokens.

Tokens can be fixed in length, but can also be used in variable length tokens, where less common or longer first type message elements include larger bit length tokens.

Because the predefined message element set contains predefined message elements (e.g., sentences, word phrases), the user may not always find one that has the same or substantially the same content as the information he wishes to transmit. In such a case, you must necessarily add such information to the message itself in the form of a second type of message element. The second type of message elements, which are only text data, typically abbreviations, symbols, unique or infrequently used words, word groups, sentences, etc. may be added to the message per character per text.

The second type of message elements are stored in the transitional buffer without characterizing the message, without representing any special compression.

The message generated by the method of the present invention may comprise any number (but at least one) of the first and second type message elements, and the first and second type message elements may follow each other in any order in the message.

The following is a concrete example of how a message is represented in the message editor and in the buffer buffer. In the example, it is assumed that the user is writing the message in Hungarian by selecting the first type of message elements from the Hungarian language elements of the pre-stored message element set when editing the message.

The Hungarian message to be forwarded is displayed by the message editor:

<Good day>> Excuse me for a minute ...> «Let me go in. > <Name> Tibor. «My car was hacked.>« I would like to call the Hungarian Embassy.> «Where is the nearest police station?> .... ??? .... <you are very kind.> «Thank you and sorry for the interference.>

In the above representation, <> marks the first type of message elements, which the message editor treats as a story.

In the buffer buffer, the above message is represented as follows:

<token1> <token2> <token3> <token4> Tibor. <Tokenkód5>

<tokenkód6> <tokenkód7> .... ??? .... <tokencode8> <tokencode9>

If the message decoding device is set to display the message in Spanish, then - assuming the given language is Spanish. · In the device, the pre-stored message item set contains Spanish message items corresponding to each token - the message will appear on the device display as follows:

<jBuenos días!> <Perdón, un momento ...> <Permittame que me presente.> <Me llamo ...> Tibor. <Me han forzado el coche.> <Quisiera Hamar a la Embajada de Hungría.> <6Dónde está la comisaría other cercana?> .... ??? .... <Usted es muy amable.> <Gracias y discúlpeme por la molestia.>

If a first type message element is deleted while editing a message, the entire first type message element, i.e., the entire text between the <> characters on the display, and the transition buffer as the corresponding first type message element is deleted. Since the second type of message elements are stored in character form, characters that are deleted from the message are also deleted from the temporary buffer per character when editing a message.

On the second type of message elements, a compression step is also performed after the message has been completed (edited).

Preferably, the second type message elements stored in character buffer in the temporary buffer are compressed using a language-specific, frequency-based compression method currently selected (or pre-configured by the user). The essence of this compression method is to replace each character or predefined group of characters in the second type of message elements with a variable length bit sequence pre-stored in the code set associated with that compression method. Variable length codes can be generated using, for example, the Huffman algorithm. For unique second-type message elements containing text characters, the compression ratio obtained by using said code tables is generally substantially lower than the compression ratio obtainable for the first-type message elements. The language-specific code tables allow you to replace the characters of the second type of message with variable length codes optimized based on the frequency of the language used by the user sending the message, so that the second type of message is typed in any language ···· ··· ·

full, statistically the shortest possible sequence of codes for the whole message is generated in the compression step of the second type of message elements.

Advantageously, the process of the present invention comprises at least one of the following compression methods:

a) Compression based on the character frequency of the language, where 3-64 bits are represented by the characters stored in the code tables.

b) Compression based on the most common character groups in the language, where a character group consists of 2 to 50 characters.

c) Compression based on the complete character set of the language, where the letters and punctuation marks of the alphabets used today are supplemented with 364 bits, which are the characters previously used in the language.

d) Compression based on a unified character set, where grouping, sorting can be based on the languages of adjacent ethnic groups, the geographical location of languages, etc., and where all the characters that occur in the languages belonging to that group are represented in the code table.

e) Compression by voice data transmission method, preferably DTMF codes, where the data bits of the message, as a communication data unit, are represented in audio encoded form instead of the usual digital "text information channel".

(f) Other loss of text compression procedures (eg, case-insensitive, case-insensitive, other redundant character sets, space-deletion, etc.)

In view of the compression methods described above, the compression ratio available for character-typed second type message elements in short text messages is far below the compression ratio available for first type message elements. Frequency-based compression techniques used in the method of the present invention typically achieve a compression ratio of about 1 to about 10. It is in the range of 1.4: 1 to 1.1: 1, which means that the original, combined bit length of the total of unique characters added to the message by the user is typically approx. It can be reduced by 10-30%. Although the above mentioned compression rate of the second type of message elements in each message is relatively small and significantly smaller than the compression rate of the first type of message elements in a given message, in many cases, due to the fixed data field length of standard messages can save on transmission costs. Although the most efficient compression of the second type of message elements can be achieved by using variable bit length codes, with some applications in mind, one embodiment of the method of the invention may include a code set using fixed length codes to compress the second type message elements.

Thus, from the above, the average compression rate (i.e., the ratio of the average bit length of all predefined first type message elements to the average bit length of the tokens belonging to the first type message elements) in the predefined message element set is significantly higher than the the average compression rate of all possible characters supported by the compression method (i.e., the ratio of the average bit length of the selected character set to the average bit length of the character codes), which is an important and novel feature of the compression method of the present invention.

Because short messages can contain characters that are not in the code table of the user-selected compression process, and message items that are already stored in a compressed form on the user's device (typically, the unique voice that the user adds to the message) files, unique image data, typically stored as files such as mp3, mp4, jpg, gif, etc.) in a preferred embodiment of the method of the invention are added to the message in the form of third type message elements and such third type message elements are also stored unmodified in the buffer. However, for the third type of message elements, no further compression is performed, and they are added to the compressed output file according to their original representation. During message generation, the tokens corresponding to the first type message elements, the compressed second type message elements and the data of unchanged third type message elements in the output buffer and after the compression of the second type message elements are selected with appropriate flags in a preferred embodiment of the method of the invention. where each of the flag bit groups for each message element is preferably placed before the message elements in the output file. These flag bit groups clearly define the type of message element to which they belong. There are other suitable methods to separate the data corresponding to each message item in the transition buffer.

As a final step of compression, a message header is added to the output file, which contains at least information identifying the compression method selected to compress the second type of message elements. This information is represented by a field of given bit length. If the message is to be transmitted embedded in a data field of a standard data transmission message, said message header may also include a special (fixed) message bit sequence identifying the message compressed by the method of the present invention.

The message header may also include a field containing the length (bit rate) of the compressed file and other fields containing other information.

The use of a special message start bit at the very beginning of the header when transmitting the compressed output file is essential because the data in the standard data message field must indicate that it is data compressed by the method according to the invention and therefore in the data field of the incoming you must submit it to a decryption routine according to the compression method of the present invention that is capable of retrieving their original contents.

In a preferred embodiment of the method of the invention, two groups of methods for compressing second type message elements are defined; the first group includes commonly used compression methods, the second group includes less frequently used compression methods. Accordingly, the methods of the first group are identified with shorter sets of bits than the methods of the second group. The first group of methods, typically those used in the most common languages or the most effective, e.g. It is identified by a 10-bit code (2 10 = 1024 possible compression methods), and the second group eg. Identified by a 17-bit code (2 17 = 131072 possible compression methods). With this configuration, it is possible to include in the first group about 50% of each of the 50 to 100 most common languages. 8-10 preferred compression methods. For both groups, it is possible to use part of the entire code range to indicate special functions. Such special functions can be indicated when the compressed output file is transmitted in more than one part, since the header of the first section contains information identifying the compression method used for the second type of message elements for the whole message, so this information does not need to be repeated , the corresponding bit group may therefore carry other information or even be omitted.

If the compression methods for the second type of message elements are divided into two or more groups, the identifier for each group must also be provided in a separate field in the message header.

As mentioned above, the compressed output file generated on the basis of the message, together with the above-mentioned header, may be stored on a storage device or embedded in the data field of at least one standard transmission message to one or more other devices. Standard data transmission messages may, if appropriate, be further compressed according to the higher level protocols used, but are no longer subject to the invention.

If the length of the compressed message to be transmitted is such that the length of the output data file produced by the method of the invention exceeds the data field of a standard transmission message used to transmit the message, the compressed output file is split into sections of appropriate size along with information embedded in several standard data transmission messages. In this case, a header containing at least the following fields is added to each section of the compressed output file in each standard data message:

- a message starting bit sequence identifying the message compressed by the method according to the invention,

- a field containing information identifying the compression method chosen for the compression of the second type of message elements (at least in the standard data message containing the first stage),

..........

- a field containing information suitable for identifying a given section of the output file.

Figure 2 shows a specific example of a header used in the above-mentioned preferred embodiment of the method of the invention. In this particular example, the message header contains the following fields:

- special message start bit sequence (14 bits),

- header type indicator field (2 bits total) to denote batch transmission and identify groups of compression method,

- sectional transmission (6 bits in total) to denote the total number of sections (3 bits) and to indicate the sequence number of the section (3 bits)

- compression method identifier (10 or 17 bits),

- data field length (11 bits).

In a preferred embodiment of the method of the invention, a further step of the method is to pre-compress the second type of message elements stored in the transition buffer by a plurality of methods selected from all available compression methods prior to the actual compression of the second type message elements, and generating and displaying to the user compression information about the compressed second type message elements. The compression information may be e.g. the compression ratio achieved with each method, the number of characters that can still be used, and other information that helps the user make a decision. In this way, the user is allowed to choose from among the available compression methods, on a personal basis, the final compression method used to produce the output file for the second type of message elements. For the sake of quicker selection, the user may be offered, for example, the default compression method or, for example, the highest compression method. If the user does not accept the proposed compression method, he / she can choose any other method available.

A flowchart showing the main steps of a preferred embodiment of the process of the invention is shown in Figure 1.

• ·

In step S100 of the method, upon initiation of the user, a message editing application is initiated in the user equipment, thereby enabling the user to produce the message interactively. In step S102, it is examined whether the user wants to add a predefined message type of message to the message. If the user launches an application for browsing a message item set containing the first type message items and selects the desired first type message item, in step S104, the selected first message item is selected, and in step S106, it is added to the message. In step S108, the short code for the selected first type of message element, that is, as a batch, is added to the temporary data file stored in the temporary buffer. Next, we go to step S120 to check if the message has been edited or if the user wants to add more message elements to the message.

An important and novel feature of the method according to the invention is that by storing the tokens in the temporary data file, the message is partially compressed at the time the message is generated (including editing), including user interaction.

If in step S102 it is determined that the user does not want to add a predefined message element to the message, but rather an individual message element, then in step S110, it is examined whether a second type of message element (text message element) is added. If so, in step S112, the second type of message element is characteristically added to the temporary file stored in the temporary buffer, and then it proceeds to step S120 and examines whether the message continues to be edited.

If the user did not want to add a first or second type of message element to the message, in step S114, it is examined whether a third type of message element is to be added to the message. If not, we proceed to step S120 mentioned above, but if you want to add a third type of message element (e.g., by selecting a menu item for this function in the message editor application), then in step S116, the user-defined unique third type message element ( such as a special character typed by the user or from the device memory

a unique audio or video file or other file scanned in compressed form) is also added to the temporary stream stored in the temporary buffer.

The sequential elements of the temporary file, i.e. the tokens, the strings corresponding to the second type of message elements, and optionally the third type of message elements added unchanged, for example, are separated by inserting appropriate flags (bit groups) in the transition buffer. Alternatively, different message elements may be provided in other ways, e.g. based on the unique code of each message element, using a special set of flags in the header, etc. can also be distinguished from each other.

In step S120, it is checked whether the message has been edited.

Editing a message is not considered complete until the message contains at least one message type element and at least one second type message element. If it is determined in step S120 that the message has been edited, e.g., the message editor has selected a message completion completion item, provided that the message contains at least one first and at least one second message type, then S122 In step S124, temporarily compressing the second type of message elements stored in the temporary buffer using a plurality of different methods selected from all available compression methods, and in step S124, generating and displaying compression information for the compression performed by the different compression methods. Based on the compression information displayed, the user decides which compression method to apply to the second type of message elements, and, at his or her choice, selects the compression method to be applied in step S126 and performs the final compression of the second type message elements in the temporary file. compression method.

Next, in step S130, a compressed output file is created from the main buffer stored in the temporary buffer, the already compressed second type message elements, and optionally the unchanged third type message elements. The output file may contain special flags to distinguish between successive message elements, but obviously other methods may be used to distinguish between message elements.

Finally, in step S132, a message header is added to the output file, which contains at least information suitable for identifying a method of compression of the second type of message elements. If the message is to be transmitted via a communication line to a standard data transmission message (e.g., SMS), a special bit sequence may be inserted in the header, preferably at the very beginning, to indicate that the data field of the standard message is contains compressed data (and associated message headers). This completes the compression process.

The invention also encompasses any computer program that contains instructions executed on a computer or other processor device to implement any version of the method of the invention, including those described in more detail above, and the method of the invention not described herein, but other embodiments of the invention.

The invention also includes any computer program product stored on a data storage medium readable by a computer or other processor device and containing instructions executed on a computer or other processor device to implement any of the methods of the invention.

The short message compressed by the method of the present invention is decrypted, respectively, in reverse order. Upon reading the compressed data file and its associated header, it is recognized that the message contains data compressed by the method of the present invention, and then read from the header the control information associated with the compression, including the ID of the method used to compress the second type. forwarded - information identifying the compressed section in the message and other optional information. Based on the information extracted from the header, the decryption is performed using a predefined set of message elements stored in the decoder and language-specific code tables, i.e. replacing tokens with the corresponding first type message elements, replacing the character codes with the appropriate language characters and recovering the recovered input stream thus obtained, displaying it on the display of the equipment receiving the message, or sounding it on the equipment's speaker or otherwise informing the user.

The construction and operation of a compression system 200 for carrying out the process of the present invention will now be described in detail with reference to Figure 3, which illustrates a functional block diagram of a preferred embodiment of the system of the present invention.

The compression system 200 includes at least the following components:

- a message message set 210 containing predefined message type 1 items,

- a group of predefined compression methods 220,

- 230 message editing tools,

- 240 message element browsing devices,

- 250 data compression devices,

- 260 message formatting tools.

In addition to the items listed herein, the system of the present invention may include, in accordance with certain preferred embodiments, additional optional items, of which Figure 3 shows only the dashed messaging and storage devices 270 and the media playback device 280.

The compression of messages compressed by the method of the present invention is conveniently performed by units corresponding to the aforementioned components, which execute the functions performing the respective functions in the opposite direction, thus forming a decompression system. For the sake of simplicity, only the compaction units are described below; the operation of the decompression units is obvious to one of ordinary skill in the art based on the operation of the decompression units, so detailed description thereof is omitted.

A message element set 210 containing predetermined first type message elements is stored in a data storage unit (memory) of the apparatus 200 utilizing the compression system of the present invention. In preferred embodiments of the inventive order, the user is allowed to edit said message element set 210, which is primarily data (e.g. means to add or delete groups of sentences with a specific theme or language). In a preferred embodiment of the system, a further first type of message element can be added to the message element set 210 stored in the device by downloading it from a central database (not shown) to the device.

The predetermined compression methods 220 for compressing the second type of message elements are also stored in the data storage device (memory) of said user equipment. In a preferred embodiment of the system according to the invention, it is also possible to add new compression methods or to delete one or more of said compression methods 220.

The message processing unit 230 is an interactive word processor implemented on a user equipment that has special additional features compared to standard word processing applications for carrying out the compression process of the present invention. Tasks of traditional text messages per character! In addition to typing, it allows a predetermined first type of message elements (e.g., complete sentences, block parts, expressions, etc.) to be inserted from a pre-stored set of message elements 210 into the message. The message processing unit 230 allows e.g. inserting pictures, sounds or animation into the message. The message editor 230 displays the first type of text message elements that are part of the message at the time the message is created, or in the case of a decompressor system, when a received message is displayed, in a user-selected (set) language. The message processing unit 230 is, of course, connected to the data input or output of the user's equipment. data export tools (keyboard, display, etc.)

In a preferred embodiment of the system of the invention, the message element navigation unit 240, when inserting the first type of message elements, displays a hierarchical menu system that navigates through predefined, optimized main categories or within specific message elements (e.g., sentences, phrases, pictures, sounds, etc.) can be inserted into the message. In a preferred embodiment of the system according to the invention, the first type text message elements provide text message elements stored in the default language of the user equipment, but also preferably provide the user with the ability to select texts stored in a language other than the language. The message element set 210 may also include cross-links so that a given message element can be accessed through multiple browsing paths while using the message element browse unit 240.

In the compression system 200 of the present invention, the data compression unit 250 performs the replacement of the first type of message elements with the appropriate code (token) and the compression of the second type of message elements by a user-selected compression method 220. The data compression unit 250 generates a compressed output file 300 ready to be stored or transmitted from the message in two separate steps; puts the tokens for the first type of message items in the temporary buffer 255 stored in the temporary buffer while editing the message, and then, after the message is completed, compresses the second type of message elements and optionally the third type of message elements left unchanged .

As mentioned above, the system of the invention preferably has a plurality of different compression algorithms pre-stored for compression of the second type of message elements. In a preferred embodiment of the system of the present invention, the data compression unit 250 temporarily compresses the second type of message elements by selecting from a plurality of different compression methods at the completion of message editing, and compression information on the second type message elements compressed by the different compression methods produces the compression rates achieved by each method, the number of messages, the number of characters still available, etc.). This information is displayed (or read out) on the display of the equipment, preferably ranked according to the various methods, to the user, who can select the appropriate 220 compression method based on the compression information displayed. It is also possible for the data compression unit 250 to automatically perform the final compression of the second type of message elements using a specific compression method 220 preset by the user ···· ····.

The message formatting unit 260 is responsible for converting the compressed output file 300 to a state ready to be stored (saved) or transmitted over a communication line. In doing so, the message shaping unit 260 appends a message header containing information suitable for identifying at least the compression method 220 selected for the second type of message elements to the compressed output file. If the message needs to be forwarded, the message formatting unit 260 adds additional information to the message header, e.g. a special bit sequence for signaling a message compressed by the method of the invention, and optionally the size of the compressed data file.

For example, the compression system 200 of the present invention may be supplemented with a messaging and storage unit 270 for storing or transmitting the compressed output file 300 and its associated message header embedded in a data field of at least one standard transmission message. A standard data transmission message is a message of a specified format transmitted by any wired or wireless communication system (eg, GSM network, Internet, etc.). In the main fields of application of the invention, such a message is e.g. SMS, as well as any other short message, especially text message or text message, can be used for this purpose.

When sending a message, the messaging and storage device 270 automatically saves the message and forwards the message to the messaging subsystem of the device, e.g. SMS-sender for mobile phones.

In a particularly preferred embodiment of the compression system of the present invention, the messaging and storage device 270 includes a segmentation device (not shown) that divides the output file 300 into sections of appropriate size. The messaging and storage device 270 transmits the various sections sequentially, embedded in a plurality of standard data transmission messages, by including in the message headers for each section the data suitable for identifying that section.

The message sending and storage unit 270 corresponds to the message receiving and storage unit in the decompression system, which corresponds to the header of the received message 21 • · · · · · · · · · · · · · · · · · · · · · · · · Using a resident client program - examines and, if it finds a bit sequence identifying the message according to the invention, stores the message in a storage space for the decompression system and notifies the recipient of the message in the configured manner. If the sent user message has been sent in several installments, in several successive standard data transmission messages, the message receiving and storing unit ensures the sequential reception of the message.

The compression system 200 of the present invention may be supplemented, if necessary, by a media player unit 280, which may be capable of both machine-readable text message elements and other multimedia content embedded in the message.

The compression system 200 of the present invention may further include a configuration unit (not shown) that allows the user to customize the operation of the entire system. Here you can set, for example, the volume or mute reading, the default or currently selected language of the compression system, the default list of compression methods, various compatibility modes, other parameters related to the appearance and operation of the compression system, etc.

A preferred embodiment of the system of the present invention also provides the possibility of weak encryption of messages. This is important if the user's equipment is in unauthorized hands or the message is accidentally sent to the desired equipment. Such simpler encryption methods, which provide only a low level of additional protection, are well known in the art, and it is routine for one skilled in the art to implement them in the system of the present invention, so detailed description thereof is omitted.

The compression method and system of the present invention can be advantageously and efficiently applied in a number of fields other than the transmission of short messages. Such applications include:

- remote control of home electronic devices (eg thermostat, alarm system, lighting, etc.) from a mobile device;

- Health applications (eg automatic, mobile patient monitoring system for the elderly, people with heart disease in an emergency •• «V ···

........ ·· automatically send a message to the doctor or clinic central patient dispatcher cell phone; or mobile phone system

- remote voting, teleshopping, sending data via mobile phone, where the system also has reserved command codes (tokens) which do not display or read a particular phrase / sentence in any language but change the color, background, position of the displayed text, or they also symbolize various check boxes, list boxes, and menu system object building blocks, and some symbols also provide instructions on how to handle the forms that are put together (e.g., to what phone number, in what time frame it may be returned);

- organizing meetings using mobile phones, even in groups with different mother tongue, where the user initiating the meeting automatically sends out messages to all concerned with possible dates, preferably in the native language of each participant and then returned according to the recipients' deadline log and recipients and will be automatically evaluated and, if necessary, resubmitted until the meeting time and venue are optimized for all parties;

- data files, videos, 2D and 3D images, animations can be downloaded to the user's device using the system of the invention.

Claims (16)

  1. Claims
    A method for compressing short messages, preferably text messages or text messages, wherein the message is generated from at least one type of message element and at least one type of message element, wherein the number and order of the first type message elements and the second type message elements is arbitrary, characterized in that
    receiving a message element selected by the user from a predefined set of message elements as the first type of message element,
    - accepting the second type of message element as any user-defined message element consisting of one or more text characters,
    generating a compressed output file based on the message composed of the at least one type of message element and the at least one type of message element, such that
    replacing each first type message element with a code of less than the original bit length stored in the message element set of said first type message element, and
    - compressing each second type of message element from a predefined compression method using a user-selected compression method,
    - wherein the average compression rate of all first type message elements in the predefined message element set is significantly higher than the average compression rate of all possible characters supported by the compression method selected for the second type message elements, and
    associating the compressed output file with information suitable for identifying, at least for the second type of message elements, a selected compression method.
  2. The method of claim 1, further comprising storing or embedding in a data field of at least one standard transmission message a message header containing information for identifying a compression method selected for at least the second type of message elements.
    ··· ·· · · * · · · · · · ·
  3. 3. The method of claim 1 or 2, further comprising receiving at least one user-defined third type message element during message generation, the third type message element being unaltered added to the compressed output file.
  4. 4. A method according to any one of claims 1 to 6, wherein if the length of the compressed output file exceeds the length of the data field of the standard transmission message,
    dividing the output file into sections of appropriate size; and
    - transmitting the various sections sequentially embedded in a plurality of standard data transmission messages by transmitting in the message headers associated with each section the information suitable for identifying that section.
  5. 5. A method according to any one of claims 1 to 5, characterized in that the predetermined first type message element comprises text data or audio data or still image data or motion picture data.
  6. 6. A method according to any one of claims 1 to 4, wherein the compression method used for the second type message element is a language-specific, frequency-based compression method, wherein each encoding unit of the second type message element is replaced by a variable length bit sequence pre-stored in a code table, or a predefined length group of characters.
  7. The method of claim 6, wherein the language-specific, frequency-based compression method is a method selected from the group consisting of a character frequency compression of a language, a language group frequency compression of a language, and traditional information lossy text compression.
  8. 8. A method according to any one of claims 1 to 4, characterized in that the message is transmitted by voice data transmission, preferably by DTMF encoding.
  9. 9. A method according to any one of claims 1 to 4, characterized in that, as a further step of the method, compressing the second type of message elements
    - performing temporary compression of the second type of message elements using a number of different compression methods available,
    generating and displaying to the user compression information about the second type of message elements temporarily compressed by various compression methods, and
    performing, on the basis of the compression information displayed, a final compression of the second type of message elements using a compression method selected by the user.
  10. 10. A compression system for compressing short messages, preferably text or text messages, comprising:
    - a message element set (210) comprising predetermined first type message elements, each code type message element having a code of less than its original bit length stored in the message element set of said first type message element,
    - a group of predefined compression methods (220),
    - a message editing means (230) for generating the message from at least one pre-stored message type message element and at least one user-defined second message element type consisting of one or more text characters,
    - a message element browsing means (240) for selecting at least one first type message element from the pre-stored message element set (210),
    - a data compression means (250) for replacing the first type of message elements with the appropriate code and for compressing the second type of message elements by a user-selected compression method (220) and thereby producing a compressed output file (300), and
    - a message shaping means (260) for appending to the compressed output file (300) a message header including information capable of identifying at least the compression method (220) selected for the second type of message elements.
  11. The compression system of claim 10, further comprising: a messaging and storage means (270) for storing or transmitting the compressed output data file (300) and its associated message header embedded in the data field of at least one standard data transmission message.
  12. A compression system according to claim 10 or claim 11, characterized in that:
    - the messaging and storage means (270) comprising a segmenting means for splitting the output file into sections of appropriate size, wherein:
    the messaging and storage device (270) configured to transmit the various sections sequentially, embedded in a plurality of standard data transmission messages, by including in the message headers associated with each section the information suitable for identifying that section.
  13. 13. A 10-12. A compression system according to any one of claims 1 to 3, characterized in that the data compression means (250) comprises a pre-compression means for temporarily compressing second type message elements by a plurality of different methods selected from all available compression methods (220) and second type message elements for generating and displaying compression information to the user.
  14. 14. A 10-13. A compression system according to any one of claims 1 to 5, characterized in that the predetermined first type of message element comprises text data or audio data or still image data or motion picture data.
  15. 15. A computer program for compressing short messages, preferably text messages or text messages, characterized in that it contains instructions executed on a computer or other processor device as described in claims 1-9. A method according to any one of claims 1 to 6.
  16. 16. A computer program product stored on a data storage medium readable by a computer or other processor device, comprising instructions executed on a computer or other processor device in accordance with claims 1-9. A method according to any one of claims 1 to 6.
HU0900432A 2009-07-10 2009-07-10 Procedure, system, computer program and computer program product for the compression of short messages HU0900432A2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
HU0900432A HU0900432A2 (en) 2009-07-10 2009-07-10 Procedure, system, computer program and computer program product for the compression of short messages

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
HU0900432A HU0900432A2 (en) 2009-07-10 2009-07-10 Procedure, system, computer program and computer program product for the compression of short messages
PCT/HU2010/000078 WO2011004207A1 (en) 2009-07-10 2010-07-07 Method and system for compressing short messages, computer program and computer program product therefor

Publications (2)

Publication Number Publication Date
HU0900432D0 HU0900432D0 (en) 2009-09-28
HU0900432A2 true HU0900432A2 (en) 2011-01-28

Family

ID=41100961

Family Applications (1)

Application Number Title Priority Date Filing Date
HU0900432A HU0900432A2 (en) 2009-07-10 2009-07-10 Procedure, system, computer program and computer program product for the compression of short messages

Country Status (2)

Country Link
HU (1) HU0900432A2 (en)
WO (1) WO2011004207A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
SE538246C2 (en) 2012-11-09 2016-04-12 Layers of cardboard in an in-line production

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH10215472A (en) * 1998-03-03 1998-08-11 Sharp Corp Electronics
DE19954032C2 (en) * 1999-10-29 2002-08-08 Freie Erfindungskuenstler Gmbh Method and device for transmitting information
WO2004055779A1 (en) * 2002-12-16 2004-07-01 Sony Ericsson Mobile Communications Ab Device for generating speech, apparatus connectable to or incorporating such a device, and computer program product therefor
WO2004059459A1 (en) 2002-12-27 2004-07-15 Nokia Corporation Predictive text entry and data compression method for a mobile communication terminal
EP1628400A1 (en) * 2004-08-19 2006-02-22 Christian Schröder Method for compression of short textual data
FR2889782B1 (en) * 2005-08-09 2007-09-28 Alcatel Sa Method of communicating between two terminals through a telecommunication network
US20080046231A1 (en) * 2006-05-26 2008-02-21 Srk Ventures, Llc System and Method of Language Translation
US20080274756A1 (en) * 2007-05-02 2008-11-06 Research In Motion Limited Message handling based on receiver display size
KR101386169B1 (en) * 2007-08-09 2014-04-17 삼성전자주식회사 Apparatus and method for compression and restoration SMS

Also Published As

Publication number Publication date
HU0900432D0 (en) 2009-09-28
WO2011004207A4 (en) 2011-04-07
WO2011004207A1 (en) 2011-01-13

Similar Documents

Publication Publication Date Title
US10271009B2 (en) Method and apparatus for providing additional information of video using visible light communication
JP5960234B2 (en) Method and apparatus for scrolling text display of voice calls or messages between video display sessions
USRE44743E1 (en) Methods and apparatus for the composition and communication of digital composition coded multisensory messages (DCC MSMs)
US9363360B1 (en) Text message definition and control of multimedia
US8805345B2 (en) Method and system for processing queries initiated by users of mobile devices
Shirali-Shahreza et al. Text steganography in chat
US20130337852A1 (en) Apparatus and method for many-to-many mobile messaging
RU2442294C2 (en) Method and device for receiving and displaying animated sms-messages
KR101568311B1 (en) Method, apparatus and storage medium for adding friends in social network
AU2007346312B2 (en) A communication network and devices for text to speech and text to facial animation conversion
US7103548B2 (en) Audio-form presentation of text messages
KR100734240B1 (en) Communications device with a dictionary which can be updated with words contained in the text message
US7315613B2 (en) Multi-modal messaging
US6192111B1 (en) Abstracting system for multi-media messages
KR100571347B1 (en) User preference-based multimedia content service system and method and storage medium
US8375327B2 (en) Iconic communication
CN1279730C (en) Information distribution method, information distribution system and information distribution server
US6690777B2 (en) Method and system for wireless device initiation of web page printouts via remotely located facsimile machines
US7991401B2 (en) Apparatus, a method, and a system for animating a virtual scene
US20180068197A1 (en) Apparatus and method for reproducing handwritten message by using handwriting data
US7813724B2 (en) System and method for multimedia-to-video conversion to enhance real-time mobile video services
ES2288603T3 (en) Method for modifying the content of an exchanged message between two phones.
CN1524387B (en) Improvements in message display
US20080220798A1 (en) Mechanism to facilitate customization of real time messaging using mobile devices
JP2008529325A (en) Communication network system and method for using the same

Legal Events

Date Code Title Description
FD9A Lapse of provisional protection due to non-payment of fees