G06F13/37

HIERARCHICAL RING-BASED INTERCONNECTION NETWORK FOR SYMMETRIC MULTIPROCESSORS

A symmetric multiprocessor includes with a hierarchical ring-based interconnection network is disclosed. The symmetric processor includes a plurality of buses comprised on the symmetric multiprocessor, wherein each of the buses are configured in a circular topology. The symmetric multiprocessor also includes a plurality of multi-processing nodes interconnected by the buses to make a hierarchical ring-based interconnection network for conveying commands between the multi-processing nodes. The interconnection network includes a command network configured to transport commands based on command tokens, wherein the tokens dictate a destination of the command, a partial response network configured to transport partial responses generated by the multi-processing nodes, and a combined response network configured to combine the partial responses generated by the multi-processing nodes using combined response tokens.

Sequential node identification in multiple-compartment dispensing enclosures

A system for automatically assigning sequential identification values to networked nodes, such as accessory modules within a storage and dispensing enclosure. The system includes a host controller communicating with client controllers via both a shared, multi-drop communications bus and an initial segment of a daisy-chained, point-to-point communications bus. The host controller issues a token to a first client controller via the point-to-point bus, then queries the client controllers, receives a reply from the client controller having the token (associating that controller with a sequential identification value), and commands passing of the token, each via the multi-drop bus. The client controllers receive the token and query via the respective busses and, if that controller has the token, reply to the query via the multi-drop bus, as well as receive the command and, if that controller has the token, pass the token via the point-to-point bus to a subsequent controller.

Sequential node identification in multiple-compartment dispensing enclosures

A system for automatically assigning sequential identification values to networked nodes, such as accessory modules within a storage and dispensing enclosure. The system includes a host controller communicating with client controllers via both a shared, multi-drop communications bus and an initial segment of a daisy-chained, point-to-point communications bus. The host controller issues a token to a first client controller via the point-to-point bus, then queries the client controllers, receives a reply from the client controller having the token (associating that controller with a sequential identification value), and commands passing of the token, each via the multi-drop bus. The client controllers receive the token and query via the respective busses and, if that controller has the token, reply to the query via the multi-drop bus, as well as receive the command and, if that controller has the token, pass the token via the point-to-point bus to a subsequent controller.

REDUCING BANDWIDTH REQUIREMENTS FOR TELEMETRY DATA USING A CROSS-IMPUTABILITY ANALYSIS TECHNIQUE

The disclosed embodiments relate to a system that reduces bandwidth requirements for transmitting telemetry data from sensors in a computer system. During operation, the system obtains a cross-imputability value for each sensor in a set of sensors that are monitoring the computer system, wherein a cross-imputability value for a sensor indicates how well a sensor value obtained from the sensor can be predicted based on sensor values obtained from other sensors in the set. Next, the system clusters sensors in the set of sensors into two or more groups based on the determined cross-imputability values. Then, while transmitting sensor values from the set of sensors, for a group of sensors having cross-imputability values exceeding a threshold, the system selectively transmits sensor values from some but not all of the sensors in the group to reduce a number of sensor values transmitted.

REDUCING BANDWIDTH REQUIREMENTS FOR TELEMETRY DATA USING A CROSS-IMPUTABILITY ANALYSIS TECHNIQUE

The disclosed embodiments relate to a system that reduces bandwidth requirements for transmitting telemetry data from sensors in a computer system. During operation, the system obtains a cross-imputability value for each sensor in a set of sensors that are monitoring the computer system, wherein a cross-imputability value for a sensor indicates how well a sensor value obtained from the sensor can be predicted based on sensor values obtained from other sensors in the set. Next, the system clusters sensors in the set of sensors into two or more groups based on the determined cross-imputability values. Then, while transmitting sensor values from the set of sensors, for a group of sensors having cross-imputability values exceeding a threshold, the system selectively transmits sensor values from some but not all of the sensors in the group to reduce a number of sensor values transmitted.

Digital signal processing circuit and corresponding method of operation

An embodiment circuit comprises a plurality of processing units, a plurality of data memory banks configured to store data, and a plurality of coefficient memory banks configured to store twiddle factors for fast Fourier transform processing. The processing units are configured to fetch, at each of the FFT computation stages, input data from the data memory banks with a burst read memory transaction, fetch, at each of the FFT computation cycles, different twiddle factors in a respective set of the twiddle factors from different coefficient memory banks of the coefficient memory banks, process the input data and the set of twiddle factors to generate output data, and store, at each of the FFT computation stages, the output data into the data memory banks with a burst write memory transaction.

Digital signal processing circuit and corresponding method of operation

An embodiment circuit comprises a plurality of processing units, a plurality of data memory banks configured to store data, and a plurality of coefficient memory banks configured to store twiddle factors for fast Fourier transform processing. The processing units are configured to fetch, at each of the FFT computation stages, input data from the data memory banks with a burst read memory transaction, fetch, at each of the FFT computation cycles, different twiddle factors in a respective set of the twiddle factors from different coefficient memory banks of the coefficient memory banks, process the input data and the set of twiddle factors to generate output data, and store, at each of the FFT computation stages, the output data into the data memory banks with a burst write memory transaction.

DIGITAL SIGNAL PROCESSING CIRCUIT AND CORRESPONDING METHOD OF OPERATION
20220350764 · 2022-11-03 ·

An embodiment circuit comprises a plurality of processing units, a plurality of data memory banks configured to store data, and a plurality of coefficient memory banks configured to store twiddle factors for fast Fourier transform processing. The processing units are configured to fetch, at each of the FFT computation stages, input data from the data memory banks with a burst read memory transaction, fetch, at each of the FFT computation cycles, different twiddle factors in a respective set of the twiddle factors from different coefficient memory banks of the coefficient memory banks, process the input data and the set of twiddle factors to generate output data, and store, at each of the FFT computation stages, the output data into the data memory banks with a burst write memory transaction.

DIGITAL SIGNAL PROCESSING CIRCUIT AND CORRESPONDING METHOD OF OPERATION
20220350764 · 2022-11-03 ·

An embodiment circuit comprises a plurality of processing units, a plurality of data memory banks configured to store data, and a plurality of coefficient memory banks configured to store twiddle factors for fast Fourier transform processing. The processing units are configured to fetch, at each of the FFT computation stages, input data from the data memory banks with a burst read memory transaction, fetch, at each of the FFT computation cycles, different twiddle factors in a respective set of the twiddle factors from different coefficient memory banks of the coefficient memory banks, process the input data and the set of twiddle factors to generate output data, and store, at each of the FFT computation stages, the output data into the data memory banks with a burst write memory transaction.

Envelope tracking amplifier apparatus incorporating single-wire peer-to-peer bus

An envelope tracking (ET) amplifier apparatus is provided. The ET amplifier apparatus includes an ET integrated circuit (ETIC) and a distributed ETIC (DETIC) coupled to a single-wire bus that correspond to a first bus access priority and a second bus access priority, respectively. The ETIC and the DETIC can contend for access to the single-wire bus by asserting a bus contention indication(s) when the single-wire bus is in a defined bus state configured to permit bus contention. In a non-limiting example, a winner for the single-wire bus is a peer device having a highest bus access priority between the ETIC and the DETIC. In this regard, each of the ETIC and the DETIC can have a chance to initiate communications over the single-wire bus, thus making it possible for the single-wire bus to function based on bidirectional peer-to-peer (P2P) bus architecture capable of supporting more application and/or deployment scenarios.