Huffman data compression method
AssigneeRoke Manor Research Limited
InventorRichard Price
Life of this patent
Estimating the term…
Abstract
A method of compressing a character by determining an overall code specific to the character comprising the steps of: a) grouping the characters in terms of a common behaviour pattern; b) where the number of characters within that group is odd, creating a two new groups of character, one new group containing just one character and the other new group containing the remaining characters; c) for each new group from of step b) said groups from step a) which have an even number of characters, assigning a group specific code d) where there is more than one character in the group referred to in step c) assigning a character identifier code to identify an individual character within the group, e) the overall character code comprising of the cocatenated group specific and identifier codes.
Claims7
A method of compressing a character by determining an overall code specific to the character, said method comprising:
- a) grouping characters in terms of a common behavior pattern;
- b) where the number of characters within a group in step a) is odd, creating two new groups of characters, one new group containing just one character and the other new group containing the remaining characters;
- c) for each new group in step b), and for said groups in step a) which have an even number of characters, assigning a group specific code;
- and
- d) where there is more than one character in a group referred to in step c) assigning a character identifier code to identify an individual character within the group;
- wherein,
- e) the overall character code comprising of the concatenated group specific and identifier codes.
Dependencies are inferred from the claim text.