Peter Leroy Barrett

US Patent:

6909384, Jun 21, 2005

Filed:

Jan 31, 2002

Appl. No.:

10/062153

Inventors:

James Armand Baldwin - Redwood City CA, US
Peter T. Barrett - San Francisco CA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

H03M007/30
G06F003/00
G06F013/00

US Classification:

341 55, 341 87, 725 39, 725 53, 707101

Abstract:

Data destined for a client is compressed at a server in a manner that produces a compressed data string that can be searched in its compressed state. The server constructs a code table that assigns codes from a standard code set (e. g. , ASCII code set) that are normally unused to selected character pairs in the data string (e. g. , the most frequently occurring character pairs). During compression, the selected character pairs are replaced with the corresponding codes. Identifiers are inserted into the compressed data string to separate substrings. To search the compressed data string at the client, a search query is compressed and compared to the compressed substrings. The substring identifiers are used to quickly locate each successive compressed substring. When a match is found, the matching substring is decompressed by replacing the code in the compressed substring with the corresponding character pair in the code table.

US Patent:

6937171, Aug 30, 2005

Filed:

Feb 3, 2005

Appl. No.:

11/050128

Inventors:

James Armand Baldwin - Redwood City CA, US
Peter T. Barrett - San Francisco CA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

H03M007/30
G06F007/00

US Classification:

341 87, 341 50, 341 65, 725 54, 707101, 711172

Abstract:

Data destined for a client is compressed at a server in a manner that produces a compressed data string that can be searched in its compressed state. The server constructs a code table that assigns codes from a standard code set (e. g. , ASCII code set) that are normally unused to selected character pairs in the data string (e. g. , the most frequently occurring character pairs). During compression, the selected character pairs are replaced with the corresponding codes. Identifiers are inserted into the compressed data string to separate substrings. To search the compressed data string at the client, a search query is compressed and compared to the compressed substrings. The substring identifiers are used to quickly locate each successive compressed substring. When a match is found, the matching substring is decompressed by replacing the code in the compressed substring with the corresponding character pair in the code table.

US Patent:

6970640, Nov 29, 2005

Filed:

May 14, 2001

Appl. No.:

09/858065

Inventors:

Dustin L. Green - Mountain View CA, US
Peter T. Barrett - San Francisco CA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

H04N005/783
H04N007/173

US Classification:

386 68, 386 81, 386 82, 725 88, 725102

Abstract:

Replaying a compressed digital video stream in fast-forward and reverse modes at varied playback rates. An index of interceded frames, those frames not dependant on other frames for generation, is stored. The index includes the size of intercoded frames and their storage location. When a specified playback rate is requested, the intercoded frames are retrieved using the index. The interceded frames then have one or more intracoded frames, frames that reference other frames for generation, placed between them to generate a frame sequence. The intracoded frames are “blank,” meaning they contain only information from their associated interceded frame. By inserting “blank” frames specified playback rates and bit rates are generated. The index of interceded frames may also be accessed to generate playback in reverse mode, which conserves memory resources of associated systems by generating the reverse playback stream in an iterative manner.

US Patent:

7026964, Apr 11, 2006

Filed:

Mar 17, 2005

Appl. No.:

11/082391

Inventors:

James Armand Baldwin - Redwood City CA, US
Peter T. Barrett - San Francisco CA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

H03M 7/30
G06F 3/00
G06F 13/00

US Classification:

341 87, 725 39, 725 54, 711170, 707101

Abstract:

Data destined for a client is compressed at a server in a manner that produces a compressed data string that can be searched in its compressed state. The server constructs a code table that assigns codes from a standard code set (e. g. , ASCII code set) that are normally unused to selected character pairs in the data string (e. g. , the most frequently occurring character pairs). During compression, the selected character pairs are replaced with the corresponding codes. Identifiers are inserted into the compressed data string to separate substrings. To search the compressed data string at the client, a search query is compressed and compared to the compressed substrings. The substring identifiers are used to quickly locate each successive compressed substring. When a match is found, the matching substring is decompressed by replacing the code in the compressed substring with the corresponding character pair in the code table.

US Patent:

7133051, Nov 7, 2006

Filed:

Sep 19, 2003

Appl. No.:

10/665714

Inventors:

David Hendler Sloo - Menlo Park CA, US
Ronald Alan Morris - San Francisco CA, US
Peter T. Barrett - San Francisco CA, US
Jeffrey W. Fassnacht - San Francisco CA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G09G 5/00
G06F 13/00
H04N 5/45

US Classification:

345629, 345660, 725 39, 348565

Abstract:

The present disclosure relates to displaying full scale images with overlaid similar scaled images and a graphical user device in a display of a client device. The client device receives video streams of the full scale images and scaled images. The video streams are broadcast independent of one another, and a user of the client device may manipulate the format of the images of either or both streams, and/or place the scaled image on any portion of the full scaled image. The graphical user interface is placed so it does not obscure the scaled image. Alternatively a single video stream may be received by the client device. When a single video stream is received, the client device creates two video streams, one stream comprising full scale images and the other stream comprising scaled images. The full scale image is overlaid with the scaled image and the graphical user interface.

US Patent:

7148823, Dec 12, 2006

Filed:

Dec 16, 2005

Appl. No.:

11/303798

Inventors:

James Armand Baldwin - Redwood City CA, US
Peter T. Barrett - Palo Alto CA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

H03M 7/30
G06F 3/00
G06F 13/00

US Classification:

341 87, 725 39, 725 53, 707101

Abstract:

Data destined for a client is compressed at a server in a manner that produces a compressed data string that can be searched in its compressed state. The server constructs a code table that assigns codes from a standard code set (e. g. , ASCII code set) that are normally unused to selected character pairs in the data string (e. g. , the most frequently occurring character pairs). During compression, the selected character pairs are replaced with the corresponding codes. Identifiers are inserted into the compressed data string to separate substrings. To search the compressed data string at the client, a search query is compressed and compared to the compressed substrings. The substring identifiers are used to quickly locate each successive compressed substring. When a match is found, the matching substring is decompressed by replacing the code in the compressed substring with the corresponding character pair in the code table.

US Patent:

7151471, Dec 19, 2006

Filed:

Dec 16, 2005

Appl. No.:

11/303797

Inventors:

James Armand Baldwin - Redwood City CA, US
Peter T. Barrett - Palo Alto CA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

H03M 7/30
G06F 3/00
G06F 13/00

US Classification:

341 87, 725 39, 725 53, 707101

Abstract:

Data destined for a client is compressed at a server in a manner that produces a compressed data string that can be searched in its compressed state. The server constructs a code table that assigns codes from a standard code set (e. g. , ASCII code set) that are normally unused to selected character pairs in the data string (e. g. , the most frequently occurring character pairs). During compression, the selected character pairs are replaced with the corresponding codes. Identifiers are inserted into the compressed data string to separate substrings. To search the compressed data string at the client, a search query is compressed and compared to the compressed substrings. The substring identifiers are used to quickly locate each successive compressed substring. When a match is found, the matching substring is decompressed by replacing the code in the compressed substring with the corresponding character pair in the code table.

US Patent:

7168085, Jan 23, 2007

Filed:

Jan 31, 2002

Appl. No.:

10/078330

Inventors:

James Armand Baldwin - Redwood City CA, US
Peter T. Barrett - San Francisco CA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

H04N 5/445

US Classification:

725 50, 725 54, 725 37, 711133

Abstract:

Program data for use in electronic program guides is selected for storage at a low resource client according to a preference for current program data over program data for a future time. In the described implementation, a memory representative of the client memory is disproportionately allocated for different time units (e. g. , 24-hour days) to be represented in an electronic program guide. Analysis is conducted as to whether program data for the different time units can fit in the portions of memory and adjustments to the amount of program data for respective time units are made. Different-size sets of program data are eventually selected such that more program data will be stored in the portion of memory corresponding to the current time unit and progressively less program data will be stored in other portions of memory corresponding to future time units.