Patents by Inventor Gordon Davis
Gordon Davis 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).
-
Publication number: 20130208942Abstract: A digitally encoded video fingerprinting system for generating and comparing/matching finger-prints from digitally encoded video which has been encoded according to an encoding method which involves the generation of residual macroblocks of pixels and the generation of quantized transform coefficients of the residual macroblocks, or of portions of the residual macroblocks, comprises a fingerprint database (5) and a video processing subsystem (10). The video processing subsystem (10) includes a fingerprint sequence selection module (14, 24) which is operable to select one or more sets of frames from input video content to be processed in order to generate a fingerprint; a fingerprint calculation module (14, 26) which is operable to generate a fingerprint based on a set of frames selected by the fingerprint sequence selection module; and a fingerprint comparator module (14, 28) which is operable to compare two fingerprints and to output a similarity score of the compared fingerprints.Type: ApplicationFiled: September 30, 2011Publication date: August 15, 2013Applicant: BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANYInventor: Andrew Gordon Davis
-
Patent number: 8465226Abstract: A culvert end for a culvert includes a culvert body and a brow. The culvert body has an upper section and an outer end that defines an opening. One or more structural weaknesses are formed in the culvert body. The one or more structural weaknesses are configured and arranged to encourage a partial collapse of the upper section of the culvert body when the culvert end is subjected to a sudden end-on force caused by a vehicle impacting against the outer end of the culvert body, thereby creating a transitioning surface that enables the impacting vehicle to ride over the outer end of the culvert body. The brow is formed at the outer end of the culvert body and configured to initiate the partial collapse of the upper section when the brow is struck by the impacting vehicle.Type: GrantFiled: January 24, 2011Date of Patent: June 18, 2013Inventor: Dennis Gordon Davis
-
Publication number: 20110206461Abstract: The present invention provides for a culvert end, wherein the culvert end is structurally weakened to allow partial collapse of an upper section of the end on impact loading. The culvert end aims to decrease the severity of motor vehicle accidents wherein the culvert has an end that is deformable under impact to create a transitioning surface to reduce the likelihood of the vehicle arresting, catching or snagging itself in the entrance to the culvert.Type: ApplicationFiled: January 24, 2011Publication date: August 25, 2011Inventor: Dennis Gordon DAVIS
-
Publication number: 20100141835Abstract: In order to detect interlace errors in a video signal, one receives successive digitally coded frames, each frame comprising data for a field of a first type and data for a field of a second type (i.e. a top field and bottom field or vice versa). One then generates for each field of the first type:—a first difference signal (D1 F1) representative of the difference between the field and the second-type field of the previous frame;—a second difference signal (D1 F2) representative of the difference between the field and the second-type field of the same frame; and—a third difference signal (D1 F3) representative of the difference between the field and the second-type field of the following frame. Then, in dependence of the values of said difference signals, a decision signal (wOFlag) is generated indicating an estimated temporal relationship of the field to the second-type field of the same frame.Type: ApplicationFiled: April 11, 2008Publication date: June 10, 2010Inventor: Andrew Gordon Davis
-
Publication number: 20080098015Abstract: A structure and technique for preventing collisions using a hash table in conjunction with a CAM to identify and prevent collisions of binary keys. A portion of the hash value of a binary key, which does not collide with a portion of the hash value of any other reference binary key, is used as an entry in the hash table. If two or more binary keys have identical values of the portions of the hash values, each of these binary keys are stored in their entirety, in the CAM. The key in the CAM provides a pointer to a data structure where the action associated with that binary key is stored. If the binary key is not found in the CAM, the binary key is hashed, and a specific entry in the hash table is selected using a portion of this hash value.Type: ApplicationFiled: December 21, 2007Publication date: April 24, 2008Applicant: International Business Machines CorporationInventors: Gordon Davis, Andreas Herkersdorf, Clark Jeffries, Mark Rinaldi
-
Publication number: 20080069194Abstract: A method for operating plurality of DSL modem transmitters integrated within a circuit card. The method includes each DSL modem transmitter: generating a full power physical frame when the DSL modem transmitter is provided with data to transmit; generating a low power physical frame having a control channel signal component and no data; and selecting between the full power physical frame and the low power physical frame for transmission from the DSL modem transmitter, wherein selection of the low power physical frame for transmission from the DSL modem transmitter is based only on the DSL modem transmitter having no data to transmit. The method further includes limiting aggregate flow of data to the plurality of DSL modem transmitters such that a total power required by the plurality of DSL modem transmitters is held below a predefined target power level.Type: ApplicationFiled: November 26, 2007Publication date: March 20, 2008Applicant: International Business Machines CorporationInventors: Gordon DAVIS, Jeffrey Derby, Evangelos Eleftheriou, Sedat Oelcer, Malcolm Ware
-
Publication number: 20080072005Abstract: A method, computer program product and system for facilitating inter-digital signal processing (DSP) data communications. A direct memory access (DMA) controller may be configured to facilitate transfers of data between a first and a second DSP processor core coupled to the DMA controller. The DMA controller may read a data structure, referred to as a “buffer descriptor block,” to perform the data transfer. The buffer descriptor block may store both a source address and a destination address indicating where the data is to be retrieved and stored. The buffer descriptor block may further store a value, e.g., number of bytes, indicating a size of the data to be transferred. The DMA controller may then transfer the data located at the source address in the first DSP processor core, with a size, e.g., number of bytes, indicated from the buffer descriptor block, to the destination address in the second DSP processor core.Type: ApplicationFiled: November 21, 2007Publication date: March 20, 2008Applicant: International Business Machines CorporationInventors: Youseff Abdelilah, Bartholomew Blaner, Gordon Davis, Jeffrey Derby, Joseph Garvey, Malcolm Ware, Hua Ye
-
Publication number: 20080052486Abstract: A page table mechanism translates virtual addresses to real addresses. In a first aspect, page table entries are contained in equal-sized blocks, the entries within each block corresponding to contiguous pages of virtual address space. Preferably, the common high-order portion of the virtual address is contained in segments distributed among multiple page table entries of the block. In a second aspect, the virtual address indexes a binary tree definitional structure. Decode logic traverses a binary tree defined by the definitional structure by testing selective bits of the virtual address to reach a leaf of the binary tree, which defines the location of data defining the real address.Type: ApplicationFiled: October 31, 2007Publication date: February 28, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Gordon Davis
-
Publication number: 20080028140Abstract: A structure and technique for preventing collisions using a hash table in conjunction with a CAM to identify and prevent collision of binary keys. A portion of the hash value of a binary key, which does not collide with a portion of the hash value of any other reference binary key, is used as an entry in the hash table. If two or more binary keys have identical values of the portions of the hash values, each of these binary keys are stored in their entirety, in the CAM. The key in the CAM provides a pointer to a data structure where the action associated with that binary key is stored. If the binary key is not found in the CAM, the binary key is hashed, and a specific entry in the hash table is selected using a portion of this hash value.Type: ApplicationFiled: October 5, 2007Publication date: January 31, 2008Applicant: International Business Machines CorporationInventors: Gordon Davis, Andreas Herkersdorf, Clark Jeffries, Mark Rinaldi
-
Publication number: 20080013541Abstract: A method and structure are disclosed for dispatching appropriate data to a network processing system comprising an improved technique for extracting protocol header fields for use by the network processor. This technique includes basic classification of a packet according to the types of protocol headers present in the packet. Based on the results of the classification, specific parameter fields are extracted from corresponding headers. All such parameter fields from one or more protocol headers in the packet are concatenated into a compressed dispatch message. Multiples of such dispatch messages are bundled into a single composite dispatch message. Thus, selected header fields from N packets are passed to the network processor in a single composite dispatch message, increasing the network processor's packet forwarding capacity by a factor of N.Type: ApplicationFiled: July 12, 2007Publication date: January 17, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPRATIONInventors: Jean Calvignac, Gordon Davis
-
Publication number: 20080010390Abstract: A method, computer program product and system for facilitating inter-digital signal processing (DSP) data communications. A direct memory access (DMA) controller may be configured to facilitate transfers of data between a first and a second DSP processor core coupled to the DMA controller. The DMA controller may read a data structure, referred to as a “buffer descriptor block,” to perform the data transfer. The buffer descriptor block may store both a source address and a destination address indicating where the data is to be retrieved and stored. The buffer descriptor block may further store a value, e.g., number of bytes, indicating a size of the data to be transferred. The DMA controller may then transfer the data located at the source address in the first DSP processor core, with a size, e.g., number of bytes, indicated from the buffer descriptor block, to the destination address in the second DSP processor core.Type: ApplicationFiled: September 17, 2007Publication date: January 10, 2008Applicant: International Business Machines CorporationInventors: Youseff Abdelilah, Bartholomew Blaner, Gordon Davis, Jeffrey Derby, Joseph Garvey, Malcolm Ware, Hua Ye
-
Publication number: 20070294471Abstract: Access arbiters are used to prioritize read and write access requests to individual memory banks in DRAM memory devices, particularly fast cycle DRAMs. This serves to optimize the memory bandwidth available for the read and the write operations by avoiding consecutive accesses to the same memory bank and by minimizing dead cycles. The arbiter first divides DRAM accesses into write accesses and read accesses. The access requests are divided into accesses per memory bank with a threshold limit imposed on the number of accesses to each memory bank. The write receive packets are rotated among the banks based on the write queue status. The status of the write queue for each memory bank may also be used for system flow control. The arbiter also typically includes the ability to determine access windows based on the status of the command queues, and to perform arbitration on each access window.Type: ApplicationFiled: August 1, 2007Publication date: December 20, 2007Applicant: International Business Machines CorporationInventors: Jean Calvignac, Chih-jen Chang, Gordon Davis, Fabrice Verplanken
-
Publication number: 20070280198Abstract: A method and system for identifying sessions in a computer network is disclosed. The session is between a first computer system and a second computer system. The session consists of an exchange of a plurality of packets between the computer systems. Each of the packets includes source information and destination information relating to the first computer system and the second computer system. The method and system include providing a symmetric key and identifying the session using the symmetric key. The symmetric key is provided utilizing a manipulation of the source information and the destination information. The symmetric key is associated with the plurality of packets traveling between the first computer system and the second computer system.Type: ApplicationFiled: August 21, 2007Publication date: December 6, 2007Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Gordon Davis
-
Publication number: 20070079106Abstract: A page table mechanism translates virtual addresses to real addresses. In a first aspect, page table entries are contained in equal-sized blocks, the entries within each block corresponding to contiguous pages of virtual address space. Preferably, the common high-order portion of the virtual address is contained in segments distributed among multiple page table entries of the block. In a second aspect, the virtual address indexes a binary tree definitional structure. Decode logic traverses a binary tree defined by the definitional structure by testing selective bits of the virtual address to reach a leaf of the binary tree, which defines the location of data defining the real address.Type: ApplicationFiled: September 22, 2005Publication date: April 5, 2007Applicant: International Business Machines CorporationInventor: Gordon Davis
-
Publication number: 20070033303Abstract: A method and system for messaging between processors and co-processors connected through a bus. The method permits a multi-thread system processor to request the services of a processor or co-processor located on the bus. Message control blocks are stored in a memory which identify the physical address of the target processor, as well as a memory location in the memory dedicated to the thread requesting the service. When the system processor requests service of a processor or co-processor, a DCR command is created pointing to the message control block. A message is built from information contained in the message control block or transferred to the processor or co-processor. The return address for the processor or co-processor message is concatenated with the thread number, so that the processor or co-processor can create a return message specifically identifying memory space dedicated to the requesting thread for storage of the response message.Type: ApplicationFiled: August 5, 2005Publication date: February 8, 2007Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jeffrey Bridges, Gordon Davis, Thomas Sartorius, Michael Siegel
-
Publication number: 20060271576Abstract: A technique is provided to delete a leaf from a Patricia tree having a direct table and a plurality of PSCB's which decode portions of the pattern of a leaf in the tree without shutting down the functioning of the tree. A leaf having a pattern is identified as a leaf to be deleted. Using the pattern, the tree is walked to identify the location of the leaf to be deleted. The leaf to be deleted is identified and deleted, and any relevant PSCB modified, if necessary. The technique also is applicable to deleting a prefix of a prefix.Type: ApplicationFiled: August 4, 2006Publication date: November 30, 2006Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Claude Basso, Jean Calvignac, Gordon Davis, Marco Heddes, Piyush Patel, Steven Perrin, Grayson Randall, Sonia Rovner
-
Publication number: 20060265372Abstract: A structure and technique for preventing collisions using a hash table in conjunction with a CAM to identify and prevent a collisions of binary keys. A portion of the hash value of a binary key, which does not collide with a portion of the hash value of any other reference binary key, is used as an entry in the hash table. If two or more binary keys have identical values of the portions of the hash values, each of these binary keys are stored in their entirety, in the CAM. The key in the CAM provides a pointer to a data structure where the action associated with that binary key is stored. If the binary key is not found in the CAM, the binary key is hashed, and a specific entry in the hash table is selected using a portion of this hash value.Type: ApplicationFiled: August 3, 2006Publication date: November 23, 2006Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Gordon Davis, Andreas Herkersdorf, Clark Jeffries, Mark Rinaldi
-
Publication number: 20060265363Abstract: A method and system for identifying a data structure associated with a packet of data. A processor internal to a packet processor may extract one or more fields in a packet header field of a received packet of data to generate a search key. The internal processor may then be configured to select which table, e.g., routing table, quality of service table, filter table, needs to be accessed using the search key in order to process the received packet of data. A determination may then be made by the internal processor as to whether a CAM or a hash table and a Patricia Tree are used to identify the data structure associated with the received packet of data. Based on table definitions in a register, the internal processor may make such a determination.Type: ApplicationFiled: July 17, 2006Publication date: November 23, 2006Inventors: Jean Calvignac, Gordon Davis, Marco Heddes, Michael Siegel
-
Publication number: 20060265576Abstract: In a first aspect, a first processing method is provided. The first processing method includes the steps of (1) operating a processor in a first mode based on an operand size associated with a first instruction received by the processor; and (2) dynamically switching the processor operation mode from the first mode to a second mode based on a different operand size associated with a second instruction received by the processor. Numerous other aspects are provided.Type: ApplicationFiled: May 19, 2005Publication date: November 23, 2006Applicant: International Business Machines CorporationInventors: Gordon Davis, Jeffrey Derby
-
Publication number: 20060265552Abstract: A prefetch mechanism using prefetch attributes is disclosed. In one aspect, an explicit request for data stored in a memory is provided, and a prefetch attribute in a page table entry associated with the explicit request is examined to determine whether to provide one or more prefetch requests based on the prefetch attribute. Another aspect includes determining dynamic prefetch attributes for use in prefetching data, in which prefetch attributes are adjusted based on memory access requests that target next sequential blocks of memory relative to the most recent previous access in a page of memory.Type: ApplicationFiled: May 18, 2005Publication date: November 23, 2006Inventors: Gordon Davis, Thomas Genduso, Harold Kossman, Robert Todd