Methods of creating a dictionary for data compression

  • US 8,037,034 B2
  • Filed: 07/23/2007
  • Issued: 10/11/2011
  • Est. Priority Date: 03/30/2006
  • Status: Expired due to Fees
  • ×
    • Pin Icon | RPX Insight
    • Pin
First Claim
Patent Images

1. A method for creating a static dictionary, the method comprising:

  • providing a plurality of data trees, each of the plurality of data trees comprising a root node, at least one of the plurality of data trees comprising at least one child node, wherein each root node and each child node stores an associated binary pattern, wherein each child node is adapted to store a symbol associated with the child node and an occurrence count value associated with the child node;

    defining a binary pattern string, the binary pattern string comprising a concatenation of the binary patterns in a direct path from the root node to a particular child node, and wherein an occurrence count value for the binary pattern string is the occurrence count value of the particular child node;

    incrementing the occurrence count value of the particular child node when the particular child node is visited; and

    incrementing an occurrence count value of a node in the direct path between the root node and the particular child node less frequently than the occurrence count value of the particular child node.

View all claims
    ×
    ×

    Thank you for your feedback

    ×
    ×