Christopher Todd Foulds, 536416 Convict Hill Rd, Austin, TX 78749

7496690, Feb 24, 2009

Oct 9, 2003

10/683941

Harlan T. Beverly - McDade TX, US
Christopher T. Foulds - Austin TX, US

Intel Corporation - Santa Clara CA

G06F 15/16

709250, 709214, 709215

Provided are a method, system, and program for managing memory for data transmission through a network. Virtual memory addresses of the data to be sent are provided to a sending agent. The sending agent provides to a host the virtual addresses of requested data. In response, the requested data addressed by the virtual addresses or the physical memory locations of the requested data are provided to the sending agent for sending to a destination.

7562158, Jul 14, 2009

Mar 24, 2004

10/809077

Hemal V. Shah - Austin TX, US
Gary Y. Tsao - Austin TX, US
Ashish V. Choubal - Austin TX, US
Harlan T. Beverly - McDade TX, US
Christopher T. Foulds - Austin TX, US

Intel Corporation - Santa Clara CA

G06F 15/16

709250

A method and system for transmitting packets. Packets may be transmitted when a protocol control block is copied from a host processing system to a network protocol offload engine. Message information that contains packet payload addresses may be provided to the network protocol offload engine to generate a plurality of message contexts in the offload engine. With the message contexts, protocol processing may be performed at the offload engine while leaving the packet payload in the host memory. Thus, packet payloads may be transmitted directly from the host memory to a network communication link during transmission of the packets by the offload engine. Other embodiments are also described.

7761529, Jul 20, 2010

Jun 30, 2004

10/882560

Ashish V. Choubal - Austin TX, US
Madhu R. Gumma - Austin TX, US
Christopher T. Foulds - Austin TX, US
Mohannad M. Noah - Austin TX, US

Intel Corporation - Santa Clara CA

H04L 29/06

709212, 709253, 370351, 370463, 710 27, 711E12067, 711154

Provided are a method, system, and program for managing memory requests for logic blocks or clients of a device. In one embodiment, busses are separated by the type of data to be carried by the busses. In another aspect, data transfers are decoupled from the memory requests which initiate the data transfers. In another aspect, clients competing for busses are arbitrated and selected memory requests may be provided programmable higher priority than other memory operations of a similar type.

8228997, Jul 24, 2012

Dec 1, 2008

12/325569

Timothy R. Cahalan - Austin TX, US
Christopher T. Foulds - Austin TX, US
Moinul H. Khan - Austin TX, US

Marvell International Ltd.

H04N 7/12

37524024

In accordance with the teachings described herein, systems and methods are provided for scanning a search area of reference pixel data to identify a reference macroblock of pixels with a closest pixel fit to a current macroblock of pixels. An example system may include a local memory array (e. g. , a shift register), a processing block and a scan sequencer. The local memory array may include a plurality of rows and columns, with N extra rows or columns in addition to a number of rows or columns necessary to store N reference macroblocks of pixels The processing block may be used to compare reference macroblocks of pixels with the current macroblock of pixels to identify the reference macroblock of pixels with the closest pixel fit to the current macroblock of pixels. The scan sequencer may be used to load reference pixel data into the local memory array and present reference macroblocks of pixels from the local memory array to the processing block according to a scan pattern.

8279936, Oct 2, 2012

Dec 10, 2008

12/331879

Timothy R. Cahalan - Austin TX, US
Christopher T. Foulds - Austin TX, US
Moinul H. Khan - San Diego CA, US

Marvell International Ltd.

H04N 7/12

37524024

In accordance with the teachings described herein, systems and methods are provided for identifying a block of pixel data in a reference frame. The system may include a data fetch, a shift register, and one or more processing blocks. The data fetch may receive a best fit integer block, where the best fit integer block is identified by comparing the current block of pixel data to a search area within a reference block of pixel data. The shift register may be configured to load pixel data to be used for performing a fractional pixel expansion for one quadrant corresponding to each integer pixel in a block of pixel data, the block of pixel data including the best fit integer block plus one additional row of integer pixels and one additional column of integer pixels, wherein a combination of all of the one quadrant fractional expansions provides a plurality of fractional blocks for the best fit integer block. The one or more processing blocks may be configured to compare each of the plurality of fractional blocks with the current block to identify a best fit fractional block, the best fit fractional block being the best fit pixel match with the current block.

8331728, Dec 11, 2012

Oct 29, 2008

12/260956

Christopher T. Foulds - Austin TX, US
Joel Rosenzweig - Marlborough MA, US

Marvell International Ltd. - Hamilton

G06K 9/36

382286, 382305

Embodiments of the present invention provide a method that comprises receiving an image frame, determining an image frame identification (ID) for the image frame, collecting image frame statistics comprising at least one type of statistic from the image frame, and correlating the image frame statistics with the image frame ID.

8351508, Jan 8, 2013

Dec 10, 2008

12/331866

Christopher T. Foulds - Austin TX, US
Timothy R. Cahalan - Austin TX, US
Moinul H. Khan - Austin TX, US
Anitha Kona - Austin TX, US

Marvell International Ltd. - Hamilton

H04N 7/12

37524016, 37524012, 37524023, 37524024, 37524025, 37524026

Systems and methods are provided for calculating a motion vector for a macroblock between a reference frame and a current frame. The system includes a main processor. The system further includes a programmable video accelerator configured to receive a linked list of variable length descriptor inputs at the direction of the main processor. The descriptor inputs include the macroblock for which the motion vector is to be calculated. The video accelerator is further configured to calculate a motion vector identifying motion of the identified macroblock from the reference frame to the current frame.

8432970, Apr 30, 2013

Dec 11, 2008

12/332483

Timothy R. Cahalan - Austin TX, US
Christopher T. Foulds - Austin TX, US
Moinul H. Khan - San Diego CA, US

Marvell International Ltd.

H04B 1/66
H04N 7/12
H04N 11/02
H04N 11/04

37524016

Devices, systems, methods, and other embodiments associated with block type selection are described. In one embodiment, a method calculates for each block from a set of M×N blocks that form a macroblock of image data, a first set of data. Adjacent blocks of the set of M×N blocks are combined into composite blocks. Data of the first set of data is selectively forwarded to composite blocks. For each composited block, a second set of data is calculated based, at least in part, on the forwarded data. A participation block is selected from one of the set of M×N blocks and the set of composite blocks based, at least in part, on the first set of data and the second set of data. The macroblock is compressed based on the participation block.