Henry Hin Hi Kwok, Age 744992 Omar St, Fremont, CA 94538

7200196, Apr 3, 2007

Apr 24, 2003

10/422316

Xiaohui Li - College Station TX, US
Henry Kin-Chuen Kwok - Fremont CA, US

Texas Instruments Incorporated - Dallas TX

H04L 7/00

375355, 375220, 375221, 375260, 375352, 375354, 375371, 370401

The present invention provides a solution that eliminates both the voltage-controlled oscillator (“VXCO” ) and its associated D/A converter () from the timing recovery scheme, thereby significantly reducing manufacturing costs for modems, such as asymmetric digital subscriber loop (“ADSL”) modems. The present invention also enables tracking of a wider frequency offset. The present invention provides this with a novel timing recovery scheme implemented entirely in the digital domain. The present invention includes a free running clock () as the sampling clock for the A/D () and D/A () converters, and interpolators ( and ) to correct timing errors for both the receive and transmit samples. The desired sample can be obtained based on its timing offset and its neighboring samples.

7240149, Jul 3, 2007

Nov 6, 2003

10/703915

Ashwath Nagaraj - Los Altos CA, US
Thomas Jeffrey Enderwick - San Jose CA, US
Henry Kin-Chuen Kwok - Fremont CA, US
Surya Prakash Jonnavithula - Santa Clara CA, US

Cisco Technology, Inc. - San Jose CA

G06F 12/02

711108, 711202, 711213, 365 49

Multiple branch operations using one or more associative memories are performed, which may be of particular use for, but is not limited to implementing security classification and access control lists. One embodiment generates a first lookup value including a first branch search level indication. A first lookup operation is performed on a set of associative memory entries based on the first lookup value to identify a first associative memory result, with each of associative memory entries including a branch level indication. The associative memory result is used to identify an adjunct memory result associated with a second branch level indication. A second lookup value is derived based on the second branch level indication. A second lookup operation is then performed on the associative memory entries based on the second lookup value to identify a second associative memory result.

7493328, Feb 17, 2009

Nov 13, 2005

11/273289

Thomas Jeffrey Enderwick - San Jose CA, US
Henry Kin-Chuen Kwok - Fremont CA, US
Ashwath Nagaraj - Los Altos CA, US

Cisco Technology, Inc. - San Jose CA

G06F 7/00

707100, 711101

Mechanisms for storing and searching a hierarchy of policies and associations thereof are disclosed which may be particularly useful for implementing security protocols, such as, but not limited to Internet Protocol security (IPsec). For example, a hierarchy of policies is stored in a search priority order in an associative memory, with each association of a particular policy stored higher in the search priority than its associated policy and after any other policy. Therefore, a lookup operation on the associative memory will identify a matching association, if one, else its matching policy. A match of a policy instead of an association may result in a corresponding association being added in the appropriate location. For IPsec implementations, the lookup word is typically derived from the packet, with this packet being typically processed based on the identified policy or association.

2005001, Jan 13, 2005

Jul 9, 2003

10/616737

Thomas Enderwick - San Jose CA, US
Henry Kwok - Fremont CA, US
Ashwath Nagaraj - Los Altos CA, US

CISCO TECHNOLOGY, INC. - SAN JOSE CA

G06F007/00

707201000

Mechanisms for storing and searching a hierarchy of items are disclosed which may be particularly useful for implementing security policies and security associations, such as, but not limited to Internet Protocol security (IPsec). A hierarchy of items is stored in a search priority order. Multiple element definitions and groups of elements are identified. Representations of the element definitions and elements are stored in a prioritized searchable data structure in decreasing search priority such that representations of each particular element definition is stored after representations of a set of particular elements associated with the particular element definition and before representations of lower priority element definitions and their associated elements. The element definitions may include Internet Protocol security policies and the elements may include Internet Protocol security associations. The searchable data structure may include an associative memory or a plurality of associative memory entries.