# US 2011/0292932 A1 · Extensible time space switch systems and methods

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

- Number: US 2011/0292932 A1
- Document ID: US20110292932A1
- Status: Published application
- Kind: A1
- Application number: 12/788,453
- Filed: 2010-05-27
- Published: 2011-12-01
- Earliest claimed: 2010-05-27
- Assignees: Ciena Corporation
- Inventors: Jeffery Thomas Nichols; Ian Dublin; Peter Bengough; Andre Sabourin
- Web page: https://patentgrep.com/patent/US20110292932A1

## CPC

- H04L 49/103: using a shared central buffer; using a shared memory
- H04L 49/00: Packet switching elements
- H04L 49/45: Arrangements for providing or supporting expansion
- H04Q 2213/13393: Time slot switching, T-stage, time slot interchanging, TSI
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04Q: SELECTING (switches, relays, selectors H01H; wireless communication networks H04W)

## Abstract

The present disclosure provides a structured, pipelined large time-space switch and method of operation resolving interconnect complexity. The time-space switch results in an interconnect complexity that does not grow as the spatial dimension is increased and results in a reduction of long high fan-out nets, a quicker layout, and improved clock speed. With respect to time-space switch fabric implementation, the present invention improves the maximum clock frequency of the switch fabric, and improves integrated circuit layout time by eliminating long high fan-out nets. Certain high-speed large switch fabrics may not be realizable without this implementation, and it significantly reduces implementation time (and cost). The present invention may include link encoding of switch frames by mapping 8B10B control characters into an 64B65B format (similar to Generic Framing Protocol-Transparent (GFP-T)), wrapping 32 65B encoded words with an 11-bit error correcting code, and scrambling the frame with a frame synchronous scrambler.

## Claims

### Claim 1

A pipelined time-space switch, comprising:
input circuitry comprising N links each receiving M timeslots;
a two-dimensional matrix of a plurality of individual timeslot interchangers, wherein the two-dimensional matrix is configured to receive from the input circuitry each of the M timeslots from the N links in a pipelined manner; and
output circuitry comprising N links configured to receive any of the M timeslots from any of the N links from the two-dimensional matrix.

### Claim 2 (depends on 1)

The pipelined time-space switch of claim 1, wherein the pipelined manner comprises each of the plurality of individual timeslot interchangers interconnected to adjacent neighbors only thereby providing interconnect complexity that does not grow as spatial dimension is increased and resulting in a reduction of long high fan-out nets.

### Claim 3 (depends on 1)

The pipelined time-space switch of claim 1, wherein input data from the input circuitry is substantially orthogonal to the output circuitry and each of the input circuitry and the output circuitry are adjacent to the two-dimensional matrix.

### Claim 4 (depends on 3)

The pipelined time-space switch of claim 3, wherein input data flows from the input circuitry orthogonal to the output circuitry, and wherein output data and control flows to the output circuitry orthogonal to the input circuitry.

### Claim 5 (depends on 4)

The pipelined time-space switch of claim 4, further comprising:
configuration memory for each of the N links, wherein the configuration memory is configured to control the data flow to the output circuitry.

### Claim 6 (depends on 4)

The pipelined time-space switch of claim 4, wherein the input circuitry comprises input framers for each of the N links; and wherein the output circuitry comprises output framers for each of the N links.

### Claim 7 (depends on 4)

The pipelined time-space switch of claim 4, wherein the input framers and the output framers utilize efficient line coding relative to 8B10B, comprising of SLP112 timeslot data framing, 64B65B encoding, Fire code forward error correction, and scrambling.

### Claim 8 (depends on 1)

The pipelined time-space switch of claim 1, wherein each of the plurality of individual timeslot interchangers comprises of 8×8 link cascadable time-space switches.

### Claim 9 (depends on 1)

The pipelined time-space switch of claim 1, wherein the pipelined time-space switch is configurable as one of an ingress switch, a center stage switch, and an egress switch.

### Claim 10

A pipelined time-space switch, comprising:
input circuitry comprising N links each receiving M timeslots;
a two-dimensional matrix of a plurality of time-space switches, wherein the two-dimensional matrix is configured to receive from the input circuitry each of the M timeslots from the N links in a pipelined manner; and
output circuitry comprising N links configured to receive any of the M timeslots from any of the N links from the two-dimensional matrix.

### Claim 11 (depends on 10)

The pipelined time-space switch of claim 10, wherein the pipelined manner comprises each of the plurality of time-space switches interconnected to adjacent neighbors only thereby providing interconnect complexity that does not grow as spatial dimension is increased and resulting in a reduction of long high fan-out nets.

### Claim 12 (depends on 11)

The pipelined time-space switch of claim 11, wherein each of the plurality of time-space switches comprises a memory tile configured to operate as an 8×8 time-space switch.

### Claim 13 (depends on 12)

The pipelined time-space switch of claim 12, wherein the pipelined time-space switch comprises N2 of the memory tiles interconnected in the pipelined manner thereby providing an overall 8N×8N link time-space switch, where N comprises an integer.

### Claim 14 (depends on 10)

The pipelined time-space switch of claim 10, wherein input data from the input circuitry is substantially orthogonal to the output circuitry and each of the input circuitry and the output circuitry are adjacent to the two-dimensional matrix.

### Claim 15 (depends on 14)

The pipelined time-space switch of claim 14, wherein input data flows from the input circuitry orthogonal to the output circuitry, and wherein output data and control flows to the output circuitry orthogonal to the input circuitry.

### Claim 16 (depends on 15)

The pipelined time-space switch of claim 15, further comprising:
configuration memory for each of the N links, wherein the configuration memory is configured to control the data flow to the output circuitry.

### Claim 17 (depends on 15)

The pipelined time-space switch of claim 15, wherein the input circuitry comprises input framers for each of the N links; wherein the output circuitry comprises output framers for each of the N links; and wherein the input framers and the output framers utilize efficient line coding relative to 8B10B, comprising of SLP112 timeslot data framing, 64B65B encoding, Fire code forward error correction and scrambling.

### Claim 18 (depends on 10)

The pipelined time-space switch of claim 10, wherein the pipelined time-space switch is configurable as one of an ingress switch, a center stage switch, and an egress switch.

### Claim 19

A pipelined time-space switching method, comprising:
receiving M timeslots over each of N links;
loading each of the M timeslots for each of the N links in a two-dimensional matrix in a pipelined fashion; and
reading out any of the M timeslots from any of the N links from the two-dimensional matrix.

### Claim 20 (depends on 19)

The pipelined time-space switching method of claim 19, wherein the pipelined fashion comprises interconnection within the two-dimensional matrix such that interconnections are only between adjacent neighbors only thereby providing interconnect complexity that does not grow as spatial dimension is increased and resulting in a reduction of long high fan-out nets.
