US5742181A — FPGA with hierarchical interconnect structure and…

Claim 1

Independent Claim 219 words

A programmable logic device comprising: a plurality of programmable atomic logic elements (PALEs) wherein each PALE has a plurality of .data inputs and generates a data output signal; a plurality of leafs wherein each leaf comprises a number of PALEs and a level one interconnect bus confined within the leaf; a plurality of blocks wherein each block comprises a number of leafs and a level two interconnect bus confined within the block; a plurality of sectors wherein each sector comprises a plurality of blocks and a level three interconnect bus confined within the sector; a first driver within each PALE for driving the data output signal out of the PALE into one or more immediately adjacent PALEs; a second driver within each PALE for driving the data output signal out of the PALE; a first programmable hyperlink associated with each PALE coupling the second driver to the level one interconnect bus of one of the leafs; a second programmable hyperlink associated with each PALE coupling the second driver to the level two interconnect bus of one of the blocks; a third driver within each PALE for driving the data output signals out of the PALE; and a third programmable hyperlink associated with each PALE coupling the third driver to the level three interconnect bus of one of the sectors.

Claim 2

Dependent Claim 219 words

A programmable logic device comprising: a plurality of programmable atomic logic elements (PALEs) wherein each PALE has a plurality of .data inputs and generates a data output signal; a plurality of leafs wherein each leaf comprises a number of PALEs and a level one interconnect bus confined within the leaf; a plurality of blocks wherein each block comprises a number of leafs and a level two interconnect bus confined within the block; a plurality of sectors wherein each sector comprises a plurality of blocks and a level three interconnect bus confined within the sector; a first driver within each PALE for driving the data output signal out of the PALE into one or more immediately adjacent PALEs; a second driver within each PALE for driving the data output signal out of the PALE; a first programmable hyperlink associated with each PALE coupling the second driver to the level one interconnect bus of one of the leafs; a second programmable hyperlink associated with each PALE coupling the second driver to the level two interconnect bus of one of the blocks; a third driver within each PALE for driving the data output signals out of the PALE; and a third programmable hyperlink associated with each PALE coupling the third driver to the level three interconnect bus of one of the sectors.

Claim 3

Dependent Claim 72 words

The programmable logic device of claim 1 wherein the plurality of sectors are formed on a single integrated circuit chip and the device further comprises: a level four interconnect bus confined within the chip; a fourth driver within each PALE for driving the data output signals out of the PALE; and a fourth programmable hyperlink associated with each PALE coupling the fourth driver to the level four interconnect bus of the chip.

Claim 4

Dependent Claim 75 words

The programmable logic device of claim 1 wherein the plurality of sectors are formed on a plurality of integrated circuit chips and the device further comprises: a level four interconnect bus confined within each of the chips; a fourth driver within each PALE for driving the data output signals out of the PALE; and a fourth programmable hyperlink associated with each PALE coupling the fourth driver to the level four interconnect bus of the chip.

Claim 5

Dependent Claim 77 words

The programmable logic device of claim 3 wherein the device further comprises: a level five interconnect bus extending in a first direction from each chip to another chip, wherein the fourth programmable hyperlink programmably couples the fourth driver to the level five interconnect bus; and a level six interconnect bus extending in a second direction from each chip to another chip, wherein the third programmable hyperlink programmably couples the third driver to the level six interconnect bus.

Claim 6

Dependent Claim 24 words

The programmable logic device of claim 1 wherein the number of PALES in each leaf differs from the number of leaves in each block.

Claim 7

Dependent Claim 62 words

The programmable logic device of claim 1 wherein the second programmable hyperlink comprises a plurality of switches, wherein each of switch couples the second driver to a unique wire of the level two interconnect bus; and the third programmable hyperlink comprises a plurality of switches, wherein each switch couples the third driver to a unique wire of the level three interconnect bus.

Claim 8

Dependent Claim 65 words

The programmable logic device of claim 1 further comprising: a fully populated crossbar matrix coupling the level one interconnect bus to the PALE data inputs within a leaf; a first sparsely populated crossbar matrix coupling the level two interconnect bus to the level one interconnect bus; and a second sparsely populated crossbar matrix coupling the level three interconnect bus to the level two interconnect bus.

Claim 9

Dependent Claim 46 words

The programmable logic device of claim 7 wherein the fully populated crossbar matrix, the first sparsely populated crossbar matrix, and the second sparsely populated crossbar matrix comprise switches that conduct signals in one direction from the higher level interconnect bus to the lower level interconnect bus.

Claim 10

Dependent Claim 115 words

A programmable logic device comprising: a plurality of programmable atomic logic elements (PALEs) wherein each PALE has a plurality of data inputs and generates a data output signal;. a plurality of hierarchically coupled partitions, wherein each partition comprises a unique set of the next lower hierarchy partitions and an interconnect bus that extends only to the unique set of the next lower partitions that are within that partition, and wherein the lowest level of hierarchy is one of the plurality of PALEs; a plurality of hyperlinks provided within each PALE programmably coupling the PALE data output signal to each of the interconnect busses in each of the higher levels of hierarchy that include the PALE.

Claim 11

Dependent Claim 115 words

A programmable logic device comprising: a plurality of programmable atomic logic elements (PALEs) wherein each PALE has a plurality of data inputs and generates a data output signal;. a plurality of hierarchically coupled partitions, wherein each partition comprises a unique set of the next lower hierarchy partitions and an interconnect bus that extends only to the unique set of the next lower partitions that are within that partition, and wherein the lowest level of hierarchy is one of the plurality of PALEs; a plurality of hyperlinks provided within each PALE programmably coupling the PALE data output signal to each of the interconnect busses in each of the higher levels of hierarchy that include the PALE.

Claim 12

Dependent Claim 37 words

The programmable logic device of claim 9 wherein each partition further comprises: a crossbar switch matrix programmably coupling the interconnect bus to the interconnect busses of each of the next lower partitions that are within that partition.

Claim 13

Dependent Claim 15 words

The programmable logic device of claim 10 wherein the crossbar switch matrix is sparsely populated.

Claim 14

Dependent Claim 32 words

The programmable logic device of claim 10 wherein the crossbar switch matrix allows signal propagation in one direction only from the interconnect bus to the interconnect busses of the next lower partitions.

Claim 15

Dependent Claim 39 words

The programmable logic device of claim 9 wherein each PALE further comprises a plurality of tunnel connections for electrically coupling the PALE data output signal to data inputs of adjacent neighbor PALEs without using the interconnect busses or hyperlinks.

Claim 16

Independent Claim 174 words

A method for programing a target circuit design into programmable logic devices comprising the steps of: mapping the circuit design into a plurality of networks defined in terms of fundamental programmable units of the programmable logic devices and interconnections between the fundamental programmable units; providing a plurality of hierarchically related logical partitions on the programmable logic device, wherein a number of the partitions are included in each hierarchy level and each partition on a given hierarchy level has a interconnect bus that is electrically isolated from the other of the number of partitions on the given hierarchy level; recursively partitioning the mapped circuit design into portions that fit into partitions at successively lower hierarchy levels until each portion is capable of fitting into one of the fundamental programmable units; providing a plurality of hyperlinks associated with each of the fundamental programmable units wherein the hyperlinks allow the fundamental programmable unit to communicate with the interconnect bus of any logical partition at a higher level of which the given fundamental programmable unit is a member.

Claim 17

Independent Claim 174 words

A method for programing a target circuit design into programmable logic devices comprising the steps of: mapping the circuit design into a plurality of networks defined in terms of fundamental programmable units of the programmable logic devices and interconnections between the fundamental programmable units; providing a plurality of hierarchically related logical partitions on the programmable logic device, wherein a number of the partitions are included in each hierarchy level and each partition on a given hierarchy level has a interconnect bus that is electrically isolated from the other of the number of partitions on the given hierarchy level; recursively partitioning the mapped circuit design into portions that fit into partitions at successively lower hierarchy levels until each portion is capable of fitting into one of the fundamental programmable units; providing a plurality of hyperlinks associated with each of the fundamental programmable units wherein the hyperlinks allow the fundamental programmable unit to communicate with the interconnect bus of any logical partition at a higher level of which the given fundamental programmable unit is a member.

Claim 18

Dependent Claim 41 words

The method of claim 14 further comprising the step of: creating interconnections between fundamental logic units in a given partition using the interconnect bus of that partition; and creating interconnections between fundamental logic units outside of a partition using the hyperlinks.

Claim 19

Dependent Claim 30 words

The method of claim 14 wherein at least one hierarchy level has a number of logical partitions that is different from the number of logical partitions at another hierarchy level.

Claim 20

Dependent Claim 46 words

The method of claim 14 further comprising the step of providing a plurality of tunnels associated with each of the fundamental programmable units wherein the tunnels allow the fundamental programmable unit to communicate with adjacent neighbor fundamental programmable units without using the hyperlinks or interconnect busses.

Claim 21

Dependent Claim 108 words

A programmable logic device comprising: a plurality of programmable atomic logic elements (PALEs); a plurality of hierarchically coupled partitions, wherein each partition comprises a unique set of the next lower hierarchy partitions and an interconnect bus that extends only to the unique set of the next lower partitions that are within that partition, and wherein the lowest level of hierarchy is one of the plurality of PALEs, wherein the interconnect bus of at least two of the partitions share a finite number of interconnect resources that are reconfigurably assigned by a user to an interconnect bus of either one or the other of the at least two partitions.

Claim 22

Dependent Claim 108 words

A programmable logic device comprising: a plurality of programmable atomic logic elements (PALEs); a plurality of hierarchically coupled partitions, wherein each partition comprises a unique set of the next lower hierarchy partitions and an interconnect bus that extends only to the unique set of the next lower partitions that are within that partition, and wherein the lowest level of hierarchy is one of the plurality of PALEs, wherein the interconnect bus of at least two of the partitions share a finite number of interconnect resources that are reconfigurably assigned by a user to an interconnect bus of either one or the other of the at least two partitions.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	2001-04-20	2001-10-20	2002-04-21	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2005-04-20	2005-10-20	2006-04-21	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2009-04-20	2009-10-20	2010-04-21	$7700.00	Window Closed / Lapsed

FPGA with hierarchical interconnect structure and hyperlinks

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag