Patent ID: 7274671
Filing Date: 2007-09-25
Classification: H03M

Abstract:
1. A method of encoding symbols, including ordering a set of symbols in a string, wherein said step of ordering includes performing one or more of a Burrows-Wheeler transform and a move-to-front transform; associating each symbol included in said set of symbols with a context, said context including a prefix; generating a prediction table for said prefix that is responsive to said set of symbols; generating a tree responsive to said prediction table, wherein said tree includes a set of nodes, used in the bitwise encoding of said set of symbols; selecting a partition bit associated with a select node included in said set of nodes, wherein said partition bit corresponds to a digit in a binary representation of said set of symbols; partitioning said set of symbols present at said select node based upon a value of said selected partition bit into two down-linked nodes, starting from a root node including said set of symbols with their probabilities and ending with a leaf node, wherein said leaf node includes a single symbol and a probability responsive to said symbol, wherein said down-linked nodes, said root node and said one or more leaf nodes are included in said set of nodes and said single symbol is included in said set of symbols; assigning a probability for each branch in said tree, wherein encoding said symbols such that said step of encoding is responsive to the probabilities on said branches that form the path from said root node to said node associated with said symbol; wherein said encoding provides a lossless compression of said symbols for efficient storage and transmission.