Patents by Inventor Dean K. Gibson

Dean K. Gibson has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 5406278
    Abstract: A method and apparatus for digital data compression having an improved matching algorithm which utilizes a parallel hashing technique. The matching algorithm of the present invention data compression method can (a) perform a first hash computation on data string subblocks of N bytes and save the hash table value; (b) perform a second hash computation on a data string subblock of N+1 bytes by using the hash result from (a) which is hashed on the data string subblocks of N bytes; (c) perform a first hash matching on data string subblocks of N+1 bytes; and (d) when the first hash matching on the data string subblock of N+1 bytes found no match, perform a second subsequent parallel hash matching on data string subblocks of N bytes.
    Type: Grant
    Filed: February 28, 1992
    Date of Patent: April 11, 1995
    Assignee: Intersecting Concepts, Inc.
    Inventors: Mark D. Graybill, Dean K. Gibson
  • Patent number: 5371499
    Abstract: Compressing a sequence of characters drawn from an alphabet uses string substitution with no a priori information. An input data block is processed into an output data block comprised of variable length incompressible data sections and variable length compressed token sections. Multiple hash tables are used based on different subblock sizes for string matching, and this improves the compression ratio and rate of compression. The plurality of uses of the multiple hash tables allows for selection of an appropriate compression data rate and/or compression factor in relation to the input data. Using multiple hashing tables with a recoverable hashing method further improves compression ratio and compression rate. Each incompressible data section contains means to distinguish it from compressed token sections.
    Type: Grant
    Filed: October 23, 1992
    Date of Patent: December 6, 1994
    Assignee: Intersecting Concepts, Inc.
    Inventors: Mark D. Graybill, Donald R. Harris, Dean K. Gibson
  • Patent number: 5049881
    Abstract: A method and apparatus for compressing digital data that is represented as a sequence of characters drawn from an alphabet. An input data block is processed into an output data block composed of sections of variable length. Unlike most prior art methods which emphasize the creation of a dictionary comprised of a tree with nodes or a set of strings, the present invention creates its own pointers from the sequence characters previously processed and emphasizes the highest priority on maximizing the data rate-compression factor product. The use of previously input data acting as the dictionary combined with the use of a hashing algorithm to find candidates for string matches and the absence of a traditional string matching table and associated search time allows the compressor to very quickly process the input data block. Therefore, the result is a high data rate-compression factor product achieved due to the absence of any string storage table and matches being tested only against one string.
    Type: Grant
    Filed: June 18, 1990
    Date of Patent: September 17, 1991
    Assignee: Intersecting Concepts, Inc.
    Inventors: Dean K. Gibson, Mark D. Graybill