Google Inc.

Legend Silicon Corporation

Cadence Design Systems, Inc.

Marvell International Limited

Nxp Usa, Inc.

Marvell Asia Pte., Ltd.

Cadonca Design Systems, Inc.

Yan Zhong

Lin Yang

Vinh Quoc Ly

Behshad Behzadi

Zaheed Sabur

Mao Yu

Okan Kolak

Daniel Cotting

Lucas Mirelmann

Denis Burakov

Sergey Nazarov

Michael Golikov

Steve Cheng

Mario Bertschler

Bohdan Vlasyuk

Manouchehr S Rafie

Xiaobin Yu

Ashrith Sheshan

Yong Ma

Chao Shan

Kevin Hwang

Abhiram Prabhakar

Techniques are described herein for using a smart device such as a standalone assistant-centric interactive speaker and/or a standalone assistant-centric interactive display with speaker(s) to send a message using a messaging application on a client device such as a smartphone. A method includes: receiving, by a first device, a request from a first user to send a message to a second user; determining that a messaging application corresponding to the request is unavailable on the first device; and in response to determining that the messaging application corresponding to the request is unavailable on the first device: selecting a second device on which the messaging application corresponding to the request is available; and sending, to the second device, a command that causes the second device to send the message from the first user to the second user using the messaging application on the second device.

Sending messages from smart speakers and smart displays via smartphones

Implementations set forth herein allow a user to access a first application in a foreground of a graphical interface, and simultaneously employ an automated assistant to respond to notifications arising from a second application. The user can provide an input, such as a spoken utterance, while viewing the first application in the foreground in order to respond to notifications from the second application without performing certain intervening steps that can arise under certain circumstances. Such intervening steps can include providing a user confirmation, which can be bypassed, and/or time-limited according to a timer, which can be displayed in response to the user providing a responsive input directed at the notification. A period for the timer can be set according to one or more characteristics that are associated with the notification, the user, and/or any other information that can be associated with the user receiving the notification.

Dynamically delaying execution of automated assistant actions and/or background application requests

A communication device determines that a data rate of a data packet exceeds a threshold, and in response, lowers a processing speed of an equalizer device to prevent a buffer from overflowing. The buffer stores outputs generated by the equalizer device. A forward error correction code decoder device of the communication device processes outputs of the equalizer device corresponding to the data packet to generate decoded information corresponding to the data packet. The communication device transmits an acknowledgment packet to acknowledge the data packet such that transmission of the acknowledgment packet begins within required time period, defined by a communication protocol, after an end of the data packet.

WiFi receiver architecture

Systems and methods described herein provides a method for dynamically allocating an iteration number for a decoder. The method includes receiving, at an input buffer, an input signal including at least one data packet. The method further includes calculating a first iteration number for decoding the at least one data packet. The method further includes monitoring at least one of available space of the input buffer and available decoding time for the at least one data packet. The method further includes dynamically adjusting the first iteration number to a second iteration number based on the available space or the available decoding time to continue decoding the at least one data packet.

Systems and methods for dynamic iteration control in a low-density parity-check (LDPC) decoder

In a decoder for decoding a low density parity check (LDPC) code suitable for decoding multi-rated LDPC codes, a method is provided. The method comprises the steps of: providing a memory for the decoding with the memory dependent on a parity check matrix H with maximum number of '1's; using a number of column updating units, updating columns parallely and simultaneously producing messages; and using a number of row updating units, updating rows parallely and simultaneously producing messages. Whereby an improved architecture in a logic and the memory is provided such that an improved throughput, power consumption, and memory area is achieved.

Method and apparatus for decoding a LDPC code

A method for constructing a simplified trellis diagram for BCH-encoded information is disclosed. BCH-encoded information is received, having a corresponding parity check matrix H. The parity check matrix H is expressed as an ordered sequence of columns of matrices. A sequence of sub-code words is provided, corresponding to one or more code words, each satisfying a given condition. A matrix H, having columns that are generated as a selected permutation of the columns of the matrix H through a column-permutation-for-binary-matching process, is provided, and a sequence of sub-matrices and a corresponding sequence of permuted sub-code words is provided. A trellis diagram, representing an ordered sequence of code word transitions in the received information and symmetric about a central location, is provided for each code word c, connecting n+1 stages, numbered i=0, 1, . . . , n, in an ordered sequence.

Trellis construction based on parity check matrix for BCH code

A method for efficient decoding of block product code format signals, using a (2)QAM signal constellation for mapping of a received signal, with p=2, 3, 4, 5, . . . A received signal value r, corresponding to an x=I or x=Q coordinate, is converted to a p-tuple (B, . . . , B) corresponding to a 'closest' I-coordinate or Q-coordinate numerical value, and a p-stage algorithm is applied to the signal values rand to the p-tuples (B, . . . , B) to determine a p-tuple (r, . . . , r) representing a decoded p-bit value for the received signal value r. Depending upon a communication channel parameter Eb/N0 and the bit error ratio BER associated with each of the p bits, the received signal values rmay be suitable for some or all communications activities (e.g., HDTV, SDTV, mobile comm).

Decoding multi-block product code

Method and system for efficiently and quickly forming a sequence of convolution values from an over-sampled digital signal sequence. Convolution value differences are computable from a set of digital signal values that is smaller than the original set of signal values by a factor of R, the over-sampling rate. The number of adders and the associated time delay for computation of the convolution differences are reduced by at least a factor R and by at least a factor approximately proportional to log (R), respectively, as compared to conventional computation of a convolution value. This approach is used to estimate a time value for which the convolution attains a largest magnitude or value.

Low complexity multiple bits matched filter

Described is an one bit matched filter for generating a sequences of correlations between a signal bit stream and a sample stream of n sample bits. The n sample bits are arranged in a rang of n bit positions n, n-1, . . . , 2, 1. Among the n sample bits, m boundary positions are defined based on the bit pattern of the sample stream, where m&lt;n. At a specific time T(k), the m boundary positions are used to generate a Contribution (k) for a section of signal bits that are shifted into the n bit positions. At the time T(k), a Correlation (k) is generated by adding the Contribution (k) with the Correlation (k-1) that was generated at the previous time T(k-1).

One bit matched filter with low complexity and high speed

A Viterbi decoder generates a branch metric table from first and second data signals taken at two sample times and provides selected branch metrics to an add/compare/select circuit in response to branch indices from a branch index generator. The branch metrics in the branch metric table are the sixteen combinations of the sum of the first and second parallel data signals at first and second sample times and the inverse of such signals. The branch index generator generates the branch indices in response to a received state from the add/compare/select circuit, convolutional code polynomials and the possible states of a radix-4 trellis. The add/compare/select generates a survivor path decision based on the selected branch metrics.

Growing community of inventors

San Jose, CA, United States of America

Yan Zhong