# US 2016/0285968 A1 · Low-power and low-latency device enumeration with cartesian addressing

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2016/0285968 A1
- Document ID: US20160285968A1
- Status: Published application
- Kind: A1
- Application number: 15/077,841
- Filed: 2016-03-22
- Published: 2016-09-29
- Earliest claimed: 2015-03-24
- Assignees: QUALCOMM Incorporated
- Applicants: QUALCOMM Incorporated
- Inventors: Lalan Jee Mishra; James Panian; Richard Wietfeldt
- Web page: https://patentgrep.com/patent/US20160285968A1

## CPC

- H04L 67/1091: {Interfacing with client-server systems or between P2P systems}
- G06F 13/4247: {on a daisy chain bus}
- H04L 61/5007: Internet protocol [IP] addresses
- G06F 2213/0052: Assignment of addresses or identifiers to the modules of a bus system
- H04L 2101/64: Asynchronous transfer mode [ATM] addresses
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

An enumeration technique is provided that requires no pre-assignment of addresses to slave devices connected through P2P links to a host device. With regard to any P2P link between devices, one device has a master interface and the remaining device has a slave interface. To distinguish between the master and slave interfaces, a master/slave status bit may be used. Each P2P link has a link ID that may be concatenated with the status bit for a corresponding interface (slave or master) to form a node ID. The host device receives a unique concatenated address from each slave device that represents a concatenation of the node ID for the slave and the node ID for any intervening interfaces between the slave device and the host device. The host device then assigns a unique Cartesian address to each slave device.

## Claims

### Claim 1

A host device, comprising:
a plurality of master interfaces corresponding to a plurality of point-to-point (P2P) links for coupling to a corresponding plurality of first slave devices, wherein each first slave device includes a slave interface for coupling through the corresponding P2P link to the corresponding master interface on the host device; and
a node aggregator configured to assign a unique link ID to each P2P link upon initiation of an enumeration process for the plurality of first slave devices, the node aggregator being further configured to receive a unique concatenated address from each first slave device's slave interface that includes the unique link ID for the corresponding P2P link, and wherein the node aggregator is further configured to address each first slave device through the corresponding master interface with a message including the first slave device's unique concatenated address, the message including a bit-optimized address to be assigned to the first slave device, the bit-optimized address for each slave device being shorter than the unique concatenated address for each first slave device.

### Claim 2 (depends on 1)

The host device of claim 1, wherein the node aggregator is further configured to identify whether each unique concatenated address corresponds to the slave interface or to a master interface in the corresponding first slave device.

### Claim 3 (depends on 1)

The host device of claim 1, wherein the node aggregator comprises a processor.

### Claim 4 (depends on 1)

The host device of claim 1, wherein the node aggregator comprises a state machine.

### Claim 5 (depends on 3)

The host device of claim 3, wherein each master interface comprises:
a finite state machine configured to serialize a corresponding transmit set of GPIO signals into at least one first frame of virtual GPIO signals; and
a Universal Asynchronous Receiver/Transmitter (UART) interface configured to transmit the at least one first frame over a UART transmit pin responsive to cycles of an oversampling clock, wherein the processor is further configured to assign a frame length to each first slave device's slave interface by communicating with the first slave device using its bit-optimized address, and wherein each finite state machine is further configured to serialize the corresponding transmit set of GPIO signals into the at least one frame of virtual GPIO signals according to the assigned frame length.

### Claim 6 (depends on 3)

The host device of claim 3, wherein at least some of the first slave devices each includes a master interface coupled through an additional P2P link to a slave interface in a corresponding second slave device from a plurality of second slave devices, each additional P2P link have a link ID, and wherein the node aggregator is further configured to receive a second concatenated node ID from the slave interfaces in the second slave devices that equals a concatenation of node IDs.

### Claim 7 (depends on 5)

The host device of claim 5, wherein the finite state machine includes a plurality of messaging registers, and wherein the processor is configured to write a plurality of messaging signals to the messaging registers, and wherein the finite state machine is further configured to serialize the messaging signals from the messaging registers into at least one second frame, and wherein the UART interface is further configured to transmit the at least one second frame over the UART transmit pin responsive to cycles of the oversampling clock.

### Claim 8

A method, comprising:
for a system including a plurality of first slave devices coupled to a host device through a corresponding plurality of first point-to-point (P2P) links each having a unique link ID, each first slave device including a slave interface coupled to the corresponding first P2P link, transmitting from each slave interface to the host device a node ID equaling a concatenation of a slave bit and the unique link ID for the corresponding first P2P link;
counting the number of node IDs to determine the minimum number of bits necessary to uniquely identify each slave interface;
addressing each slave interface with a first message including the slave interface's node ID to assign a bit-optimized address to the slave interface that is at least the minimum number of bits wide; and
addressing each slave interface with a second message including the slave interface's bit-optimized address to enumerate the slave interface.

### Claim 9 (depends on 8)

The method of claim 8, wherein the system includes a second slave device having a slave interface coupled though a second P2P link to a master interface in an intervening one of the first slave devices, the method further comprising: receiving at the host device a concatenated address from the slave interface in the second slave device that equals a concatenation of a node ID for the slave interface in the second slave device, a node ID for the master interface in the intervening one of the first slave devices, and the node ID for the slave interface in the intervening one of the first slave devices.

### Claim 10 (depends on 9)

The method of claim 9, further comprising: from the host device, addressing the slave interface in the second slave device with a third message including the concatenated address to assign a bit-optimized address to the slave interface in the second slave device.

### Claim 11 (depends on 10)

The method of claim 10, wherein addressing the slave interface in the second slave device comprises transmitting the third message through the slave interface and the master interface in the intervening one of the first slave devices to the slave interface in the second slave device.

### Claim 12 (depends on 8)

The method of claim 8, wherein enumerating each slave interface comprises assigning a virtual GPIO frame length for each slave interface.

### Claim 13 (depends on 8)

The method of claim 8, wherein enumerating each slave interface comprises assigning a flow control technique to each slave interface.

### Claim 14 (depends on 8)

The method of claim 8, wherein enumerating each slave interface comprises assigning an error correction technique to each slave interface.

### Claim 15 (depends on 8)

The method of claim 8, wherein each bit-optimized address is a power of 2 bits wide.

### Claim 16

A host device, comprising:
a plurality of master interfaces corresponding to a plurality of point-to-point (P2P) links for coupling to a slave interface in each of a corresponding plurality of slave devices; and
a node aggregator configured to assign a unique link ID to each P2P link upon initiation of an enumeration process, the node aggregator being further configured to receive a unique concatenated address from each slave interface that includes the unique link ID for the corresponding P2P link,
and wherein the node aggregator is further configured to address each slave interface with a message including the slave interface's concatenated address to re-assign a Cartesian address to each slave device, each Cartesian address comprising an X address and a Y address, wherein the Y address is for each slave device is based upon a required number of hops through any intervening slave devices for the slave device to couple to the host device.

### Claim 17 (depends on 16)

The host device of claim 16, wherein the slave devices are arranged into columns and wherein the X address for each slave device identifies the column including the slave device.

### Claim 18 (depends on 16)

The host device of claim 16, wherein each node aggregator comprises a processor.

### Claim 19 (depends on 16)

The host device of claim 16, wherein each node aggregator comprise a state machine.

### Claim 20 (depends on 16)

The host device of claim 16, wherein each master interface comprises:
a finite state machine configured to serialize a corresponding transmit set of GPIO signals into at least one first frame of virtual GPIO signals; and
a Universal Asynchronous Receiver/Transmitter (UART) interface configured to transmit the at least one first frame over a UART transmit pin responsive to cycles of an oversampling clock, wherein the processor is further configured to assign a frame length to each first slave device's slave interface by communicating with the first slave device using its Cartesian address, and wherein each finite state machine is further configured to serialize the corresponding transmit set of GPIO signals into the at least one frame of virtual GPIO signals according to the assigned frame length.

### Claim 21 (depends on 20)

The host device of claim 20, wherein each finite state machine includes a plurality of messaging registers, and wherein the processor is configured to write a plurality of messaging signals to the messaging registers, and wherein the finite state machine is further configured to serialize the messaging signals from the messaging registers into at least one second frame, and wherein the UART interface is further configured to transmit the at least one second frame over the UART transmit pin responsive to cycles of the oversampling clock.

### Claim 22 (depends on 18)

The host device of claim 18, wherein the processor is configured to enumerate each slave device by addressing each slave device using its Cartesian address to assign a virtual GPIO frame length to the slave device.

### Claim 23 (depends on 18)

The host device of claim 18, wherein the processor is configured to enumerate each slave device by addressing each slave device using its Cartesian address to assign a flow control technique to each slave interface.

### Claim 24 (depends on 18)

The host device of claim 18, wherein the processor is configured to enumerate each slave device by addressing each slave device using its Cartesian address to assign an error correction technique to each slave interface.

### Claim 25

A method, comprising:
for a system including a first slave device coupled to a host device through a first point-to-point (P2P) link the system further including a plurality of second slave devices coupled to the host device through the first slave device, assigning a Cartesian address to the first slave device, the Cartesian address comprising a first X address and a first Y address;
assigning a Cartesian address to each of the second slave devices by: assigning a Y address to each second slave devices that is incremented from the first Y address depending upon a number of intervening ones of the second slave device that the second slave device couples through to couple to the first slave device, the number of intervening ones of the second slave devices being zero or greater for each second slave device, and assigning an X address to each second slave device that is incremented from the first X address depending upon whether others of the second slave devices share the same Y address with the second slave device being assigned the X address; and
enumerating the second slave devices by addressing each second slave device with its Cartesian address.

### Claim 26 (depends on 25)

The method of claim 25, further comprising: routing a message from a first one of second slave devices to a second one of the second slave devices based upon the Cartesian address for the second one of the second slave devices.

### Claim 27 (depends on 25)

The method of claim 25, wherein each second slave device includes a virtual general purpose input output (GPIO) interface, wherein enumerating each second slave device comprises assigning a virtual GPIO frame length to the second slave device.

### Claim 28 (depends on 25)

The method of claim 25, further comprising: assigning a Cartesian address to a third slave device coupled to the host device through a P2P link, wherein the Cartesian address for the third slave device includes an incremented X address that is greater than any X address for the second slave device and includes the first Y address.
