Patents by Inventor Jim D. Guilford

Jim D. Guilford 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).

  • Bitstream processing using coalesced buffers and delayed matching and enhanced memory writes
    Patent number: 9203887
    Abstract: Methods and apparatus for processing bitstreams and byte streams. According to one aspect, bitstream data is compressed using coalesced string match tokens with delayed matching. A matcher is employed to perform search string match operations using a shortened maximum string length search criteria, resulting in generation of a token stream having <len, distance> data and literal data. A distance match operation is performed on sequentially adjacent tokens to determine if they contain the same distance data. If they do, the len values of the tokens are added through use of a coalesce buffer. Upon detection of a distance non-match, a final coalesced length of a matching string is calculated and output along with the prior matching distance as a coalesced token.
    Type: Grant
    Filed: December 23, 2011
    Date of Patent: December 1, 2015
    Assignee: Intel Corporation
    Inventors: Vinodh Gopal, Jim D. Guilford, Gilbert M. Wolrich, Wajdi K. Feghali, Deniz Karakoyunlu, Erdinc Ozturk, Martin Dixon, Kahraman Akdemir
  • BITSTREAM PROCESSING USING COALESCED BUFFERS AND DELAYED MATCHING AND ENHANCED MEMORY WRITES
    Publication number: 20140156790
    Abstract: Methods and apparatus for processing bitstreams and byte streams. According to one aspect, bitstream data is compressed using coalesced string match tokens with delayed matching. A matcher is employed to perform search string match operations using a shortened maximum string length search criteria, resulting in generation of a token stream having <len, distance> data and literal data. A distance match operation is performed on sequentially adjacent tokens to determine if they contain the same distance data. If they do, the len values of the tokens are added through use of a coalesce buffer. Upon detection of a distance non-match, a final coalesced length of a matching string is calculated and output along with the prior matching distance as a coalesced token.
    Type: Application
    Filed: December 23, 2011
    Publication date: June 5, 2014
    Inventors: Vinodh Gopal, Jim D. Guilford, Gilbert M. Wolrich, Wajdi K. Feghail, Deniz Karakoyunlu, Erdinc Ozturk, Martin Dixon, Kahraman Akdemir