Facebook, Inc.

Oracle International Corporation

Cisco Technology, Inc.

Ben Chen

Zuxu Qin

Dawei Huang

Jing Yang Chen

Guy Hutchison

Jeremy Samuel Friedland

Awais Bin Nemat

Aigerim Shorman

Long Kong

Sachin Ramesh Gandhi

Noah Bradley Blecher

Philip P Kwan

Crystal Rhan-Tsor Chen

Nima Edelkhani

Mitchell Sadao Fukumoto

Adam Shih

David Martin Kaye

Alan Thomas Clark

Ryan Michael Houx

Xiao Yang Xie

Xiaoyi Zhang

Rahul Rajagopalan

Adam Ankenmann

In one embodiment, a method includes accessing, from a data store of the communication network, user information associated with a first user of the communication network, identifying one or more entities associated with the communication network that are relevant to the first user based on the user information, and retrieving, for each identified entity, one or more content frames associated with the entity. The method includes ranking the one or more content frames based on the user information. The method also includes sending, to a client device of the first user, one or more of the content frames for display to the first user in ranked order, wherein each content frame is selectable by the first user to display the selected content frame in association with a particular content item for a specified period of time.

Displaying temporary profile content items on communication networks

Systems, methods, and non-transitory computer-readable media can broadcast a first wireless communication including information associated with a first user. A second wireless communication including information associated with a second user can be detected. Log data including at least a portion of the information associated with the second user can be generated. The log data can also include signal strength data associated with the second wireless communication and time data indicating when the second wireless communication was detected. The log data can be provided for analysis. One or more connections suggested for the first user based, at least in part, on the log data can be received.

Systems and methods for utilizing wireless communications to suggest connections for a user

Embodiments include systems and methods for on-chip random jitter (RJ) measurement in a clocking circuit (e.g., in a phase-locked loop of a serializer/deserializer circuit). Some embodiments determine a reference delay code sweep window to capture at least a candidate RJ range of a feedback clock signal, the reference delay code sweep window comprising a sequence of reference delay codes. A distribution of one-scores can be computed over the reference delay code sweep window, so that the distribution indicates a relatively likelihood, for each reference delay code, of obtaining a '1' sample when sampling the feedback clock signal according to the delayed clock signal (delayed by an amount according to the reference delay code). The distribution can be transformed into a time domain by computing code offset times for the reference delay codes. A RJ output can be computed as a function of the distribution in the time domain.

On-chip jitter measurement for clock circuits

Embodiments include systems and methods for detecting and correcting phased clock error (PCE) in phased clock circuits (e.g., in context of serializer/deserializer (SERDES) transmission (TX) clock circuits). For example, phased input clock signals can be converted into unit interval (UI) clocks, which can be combined to form an output clock signal. PCE in the output clock signal can be detected by digitally sampling the UI clocks to characterize their respective clock pulse widths, and comparing the respective clock pulse widths (i.e., PCE in the output clock signal can result from pulse width differences in UI clocks). Delay can be applied to one or more UI clock generation paths to shift UI clock pulse transitions, thereby adjusting output clock pulse widths to correct for the detected PCE. Approaches described herein can achieve PCE detection over a wide error range and can achieve error correction with small resolution.

Phased clock error handling

A quaternary content-addressable memory includes multiple entries configured to match a lookup word, with each of these entries including multiple cells and with the lookup word including multiple lookup bits for matching corresponding cells of each of the entries. Each of the cells is individually configurable to be in one of multiple states identified by two bits, with these states including a first matching state for matching a value of a corresponding bit of the lookup word with the value having a first matching value, a second matching state for matching the value of the corresponding bit having a second matching value, a wildcard state for matching the value of the corresponding bit having either the first or the second matching value, and an ignore state for indicating to ignore the cell in determining whether or not the entry to which the cell belongs matches the lookup word.

Quaternary content-addressable memory

Growing community of inventors

San Jose, CA, United States of America

Ben Chen