Method and apparatus for compressing and decompressing messages

• US 6,222,942 B1
• Filed: 07/14/1997
• Issued: 04/24/2001
• Est. Priority Date: 07/16/1996
• Status: Expired due to Term

• Current Assignee: DRNC Holdings, Inc. (InterDigital, Inc.)
• Original Assignee: Alcatel Mobile Phones
• Inventors: Martin, Jean-Marie
• Primary Examiner(s): Boudreau, Leo
• Assistant Examiner(s): Mariam, Daniel G.
• Application Number:
  US08/892,091
• Time in Patent Office: 1,380 Days
• Field of Search: 382/229, 382/232, 382/240, 382/245, 382/246, 382/233, 345/202, 348/384, 358/426, 358/261.1, 708/203
• US Class Current: 382/232
• CPC Class Codes: H03M 7/42 using table look-up for the coding or decoding process, e.g. using read-only memory H03M7/4006 takes precedence
• CPC Class Codes: H04M 1/72403 with means for local support of applications that increase the functionality

Abstract

This method of compressing messages, in particular messages intended to be displayed on a telecommunications terminal, in particular a portable telephone, is essentially characterized in that, with said messages being made up of words themselves made up of characters, it includes compiling two encoding tables, namely an “encoding table for compressing words”, causing each compressed word represented by its rank in the table to correspond to a “semi-compressed” word made up of a sequence of compressed characters corresponding to the word, and an “encoding table for compressing characters”, causing each compressed character represented by its rank in the table to correspond to a non-compressed character.

Claims

1. A method of compressing messages, in particular messages intended to be displayed on a telecommunications terminal, in particular a portable telephone, wherein, with said messages being made up of words themselves made up of characters, the method comprising:

reading in said messages;

compiling an encoding table for compressing words, causing each compressed word represented by its rank in the table to correspond to a “

semi-compressed”

word made up of a sequence of compressed characters corresponding to the word;

compiling an encoding table for compressing characters, causing each compressed character represented by its rank in the table to correspond to a non-compressed character;

forming compressed messages from the compressed words.

2. A method according to claim 1, wherein, said encoding table for compressing words itself comprises at least two tables referred to as “

dictionaries” and

having mutually different storage capacities, and wherein the method further includes sorting the words making up said messages by frequency of appearance in said messages, the words that appear more frequently being placed in a smaller-capacity dictionary.

3. A method according to claim 1, wherein, said encoding table for compressing characters itself comprises two tables referred to as “

alphabets” and

having mutually different storage capacities, and wherein the method further includes sorting the characters making up said words by frequency of appearance in said words, the characters that appear more frequently being placed in a smaller-capacity alphabet.

4. A method according to claim 1, wherein the spaces between words in said messages are considered as words for the purposes of implementing the method.

5. A method according to claim 1, wherein, with the compressed messages being intended to be stored contiguously in a memory, and having various sizes, the method further includes compiling a compressed message beginning address table for indicating the addresses of the beginnings of said compressed messages in said memory.

6. A method according to claim 1, further including searching for words, referred to as “

sub-words”

, included in longer words, referred to as “

root words”

, and wherein, with only the root words being placed in said encoding table for compressing words, and with ranks in the table also being defined for the sub-words, provision is also made for compiling a semi-compressed word beginning address table and a semi-compressed word size table, these tables serving to indicate, respectively and for each rank in said encoding table, the beginning address and the size of the corresponding semi-compressed word, whether it be a root word or a sub-word.

7. A method for decompressing messages, in particular messages intended to be displayed on a telecommunications terminal, in particular a portable telephone, wherein, with said messages being made up of words themselves made up of characters, the method comprising:

reading in compressed messages;

addressing two encoding tables respectively with compressed words, an encoding table for compressing words, and with compressed characters, an encoding table for compressing characters;

causing each compressed word represented by its rank in the encoding table for compressing words to correspond to a “

semi-compressed”

word made up of a sequence of compressed characters corresponding to the word;

causing each compressed character represented by its rank in the encoding table for compressing characters to correspond to a non-compressed character; and

forming said messages.

8. A method according to claim 7, wherein, with the compressed messages being intended to be stored contiguously in a memory, and having various sizes, the method further includes addressing a compressed message beginning address table for indicating the addresses of the beginnings of said compressed messages in said memory.

9. A method according to claim 7, wherein, with only “

root”

words including other shorter words referred to as “

sub-words”

being placed in said encoding table for compressing words, and with ranks in the table also being defined for the sub-words, the method further includes addressing a semi-compressed word beginning address table and a semi-compressed word size table, these tables serving to indicate, respectively and for each rank in said encoding table, the beginning address and the size of the corresponding semi-compressed word, whether it be a root word or a sub-word.

10. Apparatus for decompressing messages, in particular messages intended to be displayed on a telecommunications terminal, in particular a portable telephone, wherein, with said messages being made up of words themselves made up of characters, the apparatus includes:

a memory containing two encoding tables, namely an encoding table for compressing words and an encoding table for compressing characters;

memory addressing means for addressing the two tables with compressed words and with compressed characters and causing each compressed word represented by its rank in the encoding table for compressing words to correspond to a semi-compressed word made up of a sequence of compressed characters corresponding to the word, and causing each compressed represented by its rank in the encoding table for compressing characters to correspond to a non-compressed character.

11. Apparatus according to claim 10, wherein, with the compressed messages being stored contiguously in said memory, and having various sizes, said memory further includes a compressed message beginning address table for indicating the addresses of the beginnings of said compressed messages in said memory, and wherein the apparatus further includes means for addressing the compressed message beginning address table.

12. Apparatus according to claim 10, wherein, with only “

root”

words including other shorter words referred to as “

sub-words”

being placed in said encoding table for compressing words, and with ranks in the table also being defined for the sub-words, said memory further includes a semi-compressed word beginning address table and a semi-compressed word size table, these tables serving to indicate, respectively and for each rank in said encoding table, the beginning address and the size of the corresponding semi-compressed word, whether it be a root word or a sub-word, and wherein the apparatus further includes means for addressing the semi-compressed word beginning address table and the semi-compressed word size table.