IP Library Granted Patent US 8,698,519
Granted Patent B2
US 8,698,519 · App. 13/551,011 · Granted Apr 15, 2014

Scalable non-blocking switching network for programmable logic

Inventors: Peter M. Pani (Mountain view, CA); Benjamin S. Ting (Mountain view, CA)
Assignee: Advantage Logic, Inc.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,698,519
App. No.
13/551,011
Granted
Apr 15, 2014
Kind
B2
Abstract

A L-level permutable switching network (L-PSN) having switches and multiple levels of conductors that are used to connect a first plurality of conductors to other multiple sets of conductors within respective interconnect resources constraints. The L-PSN can be applied in a wide range of applications, in tandem or hierarchically, to provide a large switch network used in network, routers, and programmable logic circuits. The L-PSN is used to connect a first set of conductors, through the L-PSN, to multiple sets of conductors in a given logic circuit hierarchy whereby the conductors in each of the multiple sets are equivalent or exchangeable, which in term, by construction, makes the first set of conductors equivalent when used in the next level of circuit hierarchy. The L-PSN is scalable for large sized sets of conductors and can be used in tandem or hierarchically to enable programmable interconnections among large sized circuits.

Claims (49)

1. An integrated circuit, comprising a L-level permutable switching network (L-PSN);

wherein the L-PSN comprises an 0-th level of I[0] number of conductors selectively coupling a (L+1)-th level of I[L+1] number of conductors through L levels of conductors and (L+1) sets of switches for L≧1:

wherein the L levels of conductors comprises:

i-th level of conductors of I[i] number of conductors comprising D[i] sets of conductors and I[i−1]≧I[i] for each i selected from [1:L], wherein (I[i]/D[i])>1, D[i]>1, and at least one j selected from [1:L] with D[j]>2;

wherein (I[0]/Π i=[1:L] D[i])>1;

wherein the I[L+1] number of conductors comprises D[L+1] sets of conductors where D[L+1]>2,

wherein each of the D[L+1] sets of conductors comprises Π i=[1: L] D[i] number of conductors;

wherein the (L+1) sets of switches comprise Σ i=[1:L+1] (I[i−1]×D[i]) number of switches,

wherein each i-th set of the (L+1) sets of switches comprises (I[i−1]×D[i]) number of switches for i=[1:L+1];

wherein the I[i−1] number of conductors of the (i−1)-th level of conductors selectively couple to (I[i]/D[i]) number of conductors in each of the D[i] sets of conductors of the i-th level of conductors through a respective I[i−1] number of switches of the i-th set of switches for i=[1:L+1] without requiring traversal of any other conductors;

wherein the Π i=[1:L] D[i] number of conductors in each of the D[L+1] sets of conductors of the (L+1)-th level of conductors are physically connected to a corresponding number of pins of a corresponding module selected from switching networks and logic cells; and

at least one j selected from [1:L], D s [j]=D[j]×(I[j−1]/I[j]), wherein each D s [j] number of conductors of the (j−1)-th level of conductors of the I[j−1]/D s [j] groups of D s [j] number of conductors of the I[j−1] number of conductors selectively couples to D[j] number of conductors of the j-th level of conductors selected one from each of the D[j] sets of conductors of the I[j] number of conductors through D s [j]×D[j] number of switches of the j-th set of switches;

wherein for D s [j+1]=D[j+1]×(I[j]/I[j+1]), each D[j] sets of conductors of the j-th level of conductors comprises (I[j]/D[j]/D s [j+1]) groups of D s [j+1] number of conductors,

wherein the D s [j+1] number of conductors selectively couples to D[j+1] number of conductors of the (j+1)-th level of conductors selected one from each of the D[j+1] sets of conductors of the I[j+1] number of conductors through D s [j+1]×D[j+1] number of switches of the (j+1)-th set of switches.

2. The integrated circuit of claim 1 , wherein for D s [L+1]=D[L+1]×(I[L]/I[L+1]), each D[L] sets of conductors of the L-th level of conductors comprises (I[L]/D[L]/D s [L+1]) groups of D s [L+1] number of conductors, wherein the D s [j+1] number of conductors selectively couples to D[L+1] number of conductors of the (L+1)-th level of conductors selected one from each of the D[L+1] sets of conductors of the I[L+1] number of conductors of the (L+1)-th level of conductors through D s [L+1]×D[L+1] number of switches of the (L+1)-th set of switches.

3. A method of manufacturing an integrated circuit, comprising:

fabricating a L-level permutable switching network (L-PSN),

wherein the L-PSN comprises an 0-th level of I[0] number of conductors selectively coupling a (L+1)-th level of I[L+1] number of conductors through L levels of conductors and (L+1) sets of switches for L≧1:

wherein the L levels of conductors comprises:

i-th level of conductors of I[i] number of conductors comprising D[i] sets of conductors and I[i−1]≦I[i] for each i selected from [1:L], wherein (I[i]/D[i])>1, D[i]>1, and at least one j selected from [1:L] with D[j]>2;

wherein (I[0]/Π i=[1:L] D[i])>1;

wherein the I[L+1] number of conductors comprises D[L+1] sets of conductors where D[L+1]>2,

wherein each of the D[L+1] sets of conductors comprises Π i=[1:L] D[i] number of conductors;

wherein the (L+1) sets of switches comprise Σ i=[ 1:L+1](I[i−1]×D[i]) number of switches,

wherein each i-th set of the (L+1) sets of switches comprises (I[i−1]×D[i]) number of switches for i=[1:L+1];

selectively coupling the I[i−1] number of conductors of the (i−1)-th level of conductors to (I[i]/D[i]) number of conductors in each of the D[i] sets of conductors of the i-th level of conductors through a respective I[i−1] number of switches of the i-th set of switches for i=[1:L+1] without requiring traversal of any other conductors;

physically connecting the Π i=[1:L] D[i] number of conductors in each of the D[L+1] sets of conductors of the (L+1)-th level of conductors to a corresponding number of pins of a corresponding module selected from switching networks and logic cells; and

selecting at least one j from [1:L], D s [j]=D[j]×(I[j−1]/I[j]),

selectively coupling each D s [j] number of conductors of the (j−1)-th level of conductors of the I[j−1]/D s [j] groups of D s [j] number of conductors of the I[j−1] number of conductors to D[j] number of conductors of the j-th level of conductors selected one from each of the D[j] sets of conductors of the I[j] number of conductors through D s [j]×D[j] number of switches of the j-th set of switches;

wherein for D s [j+1]=D[j+1]×(I[j]/I[j+1]), each D[j] sets of conductors of the j-th level of conductors comprises (I[j]/D[j]/D s [j+1]) groups of D s [j+1] number of conductors; and

selectively coupling the D s [j+1] number of conductors to D[j+1] number of conductors of the (j+1)-th level of conductors selected one from each of the D[j+1] sets of conductors of the I[j+1] number of conductors through D s [j+1]×D[j+1] number of switches of the (j+1)-th set of switches.

4. The method of claim 3 , wherein for D s [L+1]=D[L+1]×(I[L]/I[L+1]), each D[L] sets of conductors of the L-th level of conductors comprises (I[L]/D[L]/D s [L+1]) groups of D s [L+1] number of conductors, wherein the method further comprises:

selectively coupling D s [j+1] number of conductors to D[L+1] number of conductors of the (L+1)-th level of conductors selected one from each of the D[L+1] sets of conductors of the I[L+1] number of conductors of the (L+1)-th level of conductors through D s [L+1]×D[L+1] number of switches of the (L+1)-th set of switches.

5. A non-transitory machine readable storage medium that stores data representing an integrated circuit layout, comprising:

a L-level permutable switching network (L-PSN);

wherein the L-PSN comprises an 0-th level of I[0] number of conductors selectively coupling a (L+1)-th level of I[L+1] number of conductors through L levels of conductors and (L+1) sets of switches for L≧1:

wherein the L levels of conductors comprises:

i-th level of conductors of I[i] number of conductors comprising D[i] sets of conductors and I[i−1]≦I[i] for each i selected from [1:L], wherein (I[i]/D[i])>1, D[i]>1, and at least one j selected from [1:L] with D[j]>2;

wherein (I[0]/Πi=[1:L] D[i])>1;

wherein the I[L+1] number of conductors comprises D[L+1] sets of conductors where D[L+1]>2,

wherein each of the D[L+1] sets of conductors comprises Π i=[ 1:L] D[i] number of conductors;

wherein the (L+1) sets of switches comprise Σ i=[ 1:L+1](I[i−1]×D[i]) number of switches,

wherein each i-th set of the (L+1) sets of switches comprises (I[i−1]×D[i]) number of switches for i=[1:L+1];

wherein the I[i−1] number of conductors of the (i−1)-th level of conductors selectively couple to (I[i]/D[i]) number of conductors in each of the D[i] sets of conductors of the i-th level of conductors through a respective I[i−1] number of switches of the i-th set of switches for i=[1:L+1] without requiring traversal of any other conductors;

wherein the Π i=[1:L] D[i] number of conductors in each of the D[L+1] sets of conductors of the (L+1)-th level of conductors are physically connected to a corresponding number of pins of a corresponding module selected from switching networks and logic cells; and

at least one j selected from [1:L], D s [j]=D[j]×(I[j−1]/I[j], wherein each D s [j] number of conductors of the (j−1)-th level of conductors of the I[j−1]/D s [j] groups of D s [j] number of conductors of the I[j−1] number of conductors selectively couples to D[j] number of conductors of the j-th level of conductors selected one from each of the D[j] sets of conductors of the I[j] number of conductors through D s [j]×D[j] number of switches of the j-th set of switches;

wherein for D s [j+1]=D[j+1]×(I[j]/I[j+1]), each D[j] sets of conductors of the j-th level of conductors comprises (I[j]/D[j]/D s [j+1]) groups of D s [j+1] number of conductors,

wherein the D s [j+1] number of conductors selectively couples to D[j+1] number of conductors of the (j+1)-th level of conductors selected one from each of the D[j+1] sets of conductors of the I[j+1] number of conductors through D s [j+1]×D[j+1] number of switches of the (j+1)-th set of switches.

6. The non-transitory machine readable medium of claim 5 , wherein for D s [L+1]=D[L+1]×(I[L]/I[L+1]), each D[L] sets of conductors of the L-th level of conductors comprises (I[L]/D[L]/D s [L+1]) groups of D s [L+1] number of conductors, wherein the D s [j+1] number of conductors selectively couples to D[L+1] number of conductors of the (L+1)-th level of conductors selected one from each of the D[L+1] sets of conductors of the I[L+1] number of conductors of the (L+1)-th level of conductors through D s [L+1]×D[L+1] number of switches of the (L+1)-th set of switches.

Assignments (7)
RELEASE OF SECURITY INTEREST Recorded Oct 26, 2020
From: JEFFERIES FINANCE LLC
To: RPX CORPORATION
Reel/Frame 054486/0422 →
PATENT SECURITY AGREEMENT Recorded Oct 23, 2020
From: RPX CLEARINGHOUSE LLC; RPX CORPORATION
To: BARINGS FINANCE LLC, AS COLLATERAL AGENT
Reel/Frame 054198/0029 →
PATENT SECURITY AGREEMENT Recorded Oct 23, 2020
From: RPX CLEARINGHOUSE LLC; RPX CORPORATION
To: BARINGS FINANCE LLC, AS COLLATERAL AGENT
Reel/Frame 054244/0566 →
SECURITY INTEREST Recorded Jun 29, 2018
From: RPX CORPORATION
To: JEFFERIES FINANCE LLC
Reel/Frame 046486/0433 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 17, 2016
From: PANI, PETER M; TING, BENJAMIN S
To: ADVANTAGE LOGIC, INC.
Reel/Frame 038609/0737 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 17, 2016
From: ADVANTAGE LOGIC, INC.
To: ADVANTAGE LOGIC, INC.
Reel/Frame 038609/0751 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 17, 2016
From: ADVANTAGE LOGIC, INC.
To: RPX CORPORATION
Reel/Frame 038609/0807 →
Continuity (9)
Continuation 13165668 · Jun 21, 2011
Continuation 12955738 · Nov 29, 2010
Continuation 12794685 · Jun 4, 2010
Continuation 12472305 · May 26, 2009
Continuation 12174080 · Jul 16, 2008
Continuation 11823257 · Jun 26, 2007
Continuation 11218419 · Sep 1, 2005
Continuation 10814943 · Mar 30, 2004
Related Publication 20120280712A1 · Nov 8, 2012